Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services - Université de technologie de Troyes Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2014

Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services

Résumé

In the field of high-value shipment transportation, companies are faced to the malevolence problem. The risk of ambush increases with the predictability of vehicle routes. This paper addresses a very hard periodic vehicle routing problem with time windows, submitted by a software company specialized in transportation problems with security constraints. The hours of visits to each customer over the planning horizon must be spread in the customer's time window. As the aim is to solve real instances, the running time must be reasonable. A mixed integer linear model and a multi-start iterated local search are proposed. Results are reported on instances derived from classical benchmarks for the vehicle routing problem with time windows, and on two practical instances. Experiments are also conducted on a particular case with a single period, the vehicle routing problem with soft time windows: the new metaheuristic competes with two published algorithms and improves six best known solutions.
Fichier non déposé

Dates et versions

hal-02499399 , version 1 (05-03-2020)

Identifiants

Citer

Julien Michallet, Christian Prins, Lionel Amodeo, Farouk Yalaoui, Grégoire Vitry. Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Computers and Operations Research, 2014, 41, pp.196-207. ⟨10.1016/j.cor.2013.07.025⟩. ⟨hal-02499399⟩

Collections

CNRS UTT LOSI
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More