Speakers: Jens Lysgaard and Sune Lauth Gadegaard

Title: A Set Partitioning Model for MinMax Vehicle Routing

Abstract: This paper proposes a new approach to modeling of vehicle routing problems with a MinMax objective. At the core of the approach, a Set Partitioning model is formulated and used for minimizing infeasibility of the considered vehicle routing problem for a given upper bound on the objective value. Generally, the optimal value of the MinMax objective is obtained as the smallest upper bound for which the Set Partitioning model obtains a total infeasibility of zero.

Coordinators: Sanne Wøhlk and Marcel Turkensteen