Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints - Archive ouverte HAL Access content directly
Conference Papers Year :

Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints

(1) , (1) , (2)
1
2
Yanyan Yang

Abstract

This paper deals with vehicle routing problem (VRP) with synchronization constraints. This problem consists in determining a least-cost set of routes to serve customers who may require several synchronized visits. The main contribution of the paper is: 1) it presents a definition and a classification of different types of synchronization constraints considered in the VRP literature; 2) it describes a variant of vehicle routing problem with synchronization constraints which is formulated as a mixed integer programming model; 3) finally, it provides a constructive heuristics and an iterated local search metaheuristic to solve the considered problem. The performance of the proposed approaches is evaluated on small and medium sized instances.

Dates and versions

hal-02735839 , version 1 (02-06-2020)

Identifiers

Cite

Nacima Labadie, Christian Prins, Yanyan Yang. Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints. International Conference on Operations Research and Enterprise Systems, Mar 2014, Angers, France. pp.257-263, ⟨10.5220/0004837502570263⟩. ⟨hal-02735839⟩
11 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More