Applied & Computational Mathematics · Operations Research

Guilherme Almeida Zeni

I work on combinatorial optimization — the problems where a decision has to be made over a space too large to enumerate, and where the difference between a good answer and an optimal one is measured in money, time, or lives.

My research began in 2015 with the travelling salesman problem applied to postal routing in Artur Nogueira, under the supervision of Prof. Dr. Luis Augusto Angelotti Meira. It grew into VRPBench, a benchmark generator for rich vehicle routing problems built from real delivery data, and then into PostVRP — a formulation in which route length is bounded and workload must be distributed fairly among carriers.

I am currently in the professional master’s programme in Applied and Computational Mathematics at IMECC, working on an integrated production–routing problem drawn from the MOPTA 2017 competition: scheduling radiopharmaceutical production across heterogeneous lines whose product decays, while routing vehicles to imaging centres with fixed appointment windows.