A heuristic algorithm for a vehicle routing problem with pickup & delivery and synchronization constraints

Seddik Hadjadj Hamamache Kheddouci 1
1 GrAMA - Graphes, Algorithmes et Multi-Agents
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : In this paper, we consider a vehicle routing problem with pickup & delivery and synchronization constraint. One vehicle with a known and finite capacity has to visit n customers to pickup or deliver empty containers. At the same time, another vehicle has to deliver ready-mixed concrete by pouring it into the previously delivered containers. This implies dealing with capacity and temporal precedence constraints. We propose a heuristic to tackle this problem. A two-step approach including a local search and a constructive algorithm. We provide some experiments that show positive results.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02155536
Contributor : Mohamed Hadjadj <>
Submitted on : Thursday, June 13, 2019 - 4:27:58 PM
Last modification on : Tuesday, November 19, 2019 - 2:38:51 AM

File

INOC_2019_paper_39.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Seddik Hadjadj, Hamamache Kheddouci. A heuristic algorithm for a vehicle routing problem with pickup & delivery and synchronization constraints. 9th International Network Optimization Conference (INOC), Jun 2019, Avignon, France. ⟨10.5441/002/inoc.2019.21⟩. ⟨hal-02155536⟩

Share

Metrics

Record views

28

Files downloads

21