Séminaire Optimisation Mathématique Modèle Aléatoire et Statistique
Maxime Agius
( Mohammed VI Polytechnic University, Rabat (Morocco) )Salle 2, IMB
19 novembre 2026 à 11:00
Equity in classical Vehicle Routing Problems generally concerns balancing workloads among drivers. In Vehicle Routing Problems with Profits, however, only a subset of customers is served and the objective is to maximize collected profit. Equity therefore concerns the distribution of profits among drivers rather than the allocation of workloads. We analyze equity in this setting and propose two profit-based strategies. The first maximizes the profit of the least profitable route, while the second refines the first by maximizing total profit under the resulting optimal minimum-profit guarantee. We develop a dedicated exact dichotomy-based algorithm for the first strategy and assess its efficiency against a direct formulation solved by branch-price-and-cut. The second strategy is also solved exactly using an adapted branch-price-and-cut algorithm. Finally, we analyze the resulting trade-offs between total profit and equity on benchmark instances of the Team Orienteering Problem with Time Windows.