Abstract: We consider a family of rich vehicle routing problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes. Modifying the Hybrid iterated local search algorithm with variable neighborhood descent and a set partitioning formulation (HILS-RVRP), we want to effectively solve more realistic problem combinations. It was decided to leave the following attributes: pickup and delivery, multiple depots, site dependency, open routes, duration limits, time windows, asymmetric distances and traffic congestion (or speed limits). Traffic congestion is realized using several matrices (12 or 24 in total) for 30 minutes or 1 hour period. Each describes coefficients for the vehicle speed on exact distances. The algorithm has a modular structure that allows you to select only the necessary attributes and thereby save computation time. Comparative characteristics and tests of the universal algorithm will be presented at the conference.

Cite: Farladanskii D. , Kononova P.
Hybrid iterated local search algorithm for vehicle routing problem with traffic congestion
XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024