Реферат: We are working with a class of heterogeneous fleet vehicle routing problems (VRPwHF) which combines petrol station replenishment problem (SRP) and other attributes. Using an iterated local search algorithm with set partition- ing formulation (SP), allows us to effectively solve complex tasks with several restrictions. We decided to work with very common modifications: multiple routes, multiple depots, duration limits, time windows, asymmetric distances and traffic congestion (or speed limits). Each example is a combination of de- pots, fuels, gas stations with requests and tank tracks. Tra c congestion is implemented using several matrices (12 or 24 in total) for 30 minutes or 1 hour period. They describe coe cients for the time of moving between points. All chara?teristics of the algorithm and the results obtained on synthetic tests will be presented at the conference.

Библиографическая ссылка: Kononova P. , Farladanskii D.
Local search algorithm for vehicle routing problem with limited work shifts and traffic jams
XXIV International conference “Mathematical Optimization Theory and Operations Research” 07-11 Jul 2025