Simulated Annealing Approach for the Vehicle Routing Problem with Synchronized Visits

Seddik Hadjadj, Hamamache Kheddouci

Abstract

In this paper, we consider a vehicle routing problem in which customers have to be visited by two different vehicles in a certain order. The first vehicle has to visit n customers to pickup or deliver empty containers, while the second has to deliver ready-mixed concrete by pouring it into the previously delivered containers. This problem is a vehicle routing problem (VRP) variant involving synchronized visits and temporal precedence constraints. We propose an ILP formulation and a simulated annealing algorithm to minimize the total travel times of both vehicles, and we provide experiments that show very satisfying results.

Download


Paper Citation


in Harvard Style

Hadjadj S. and Kheddouci H. (2020). Simulated Annealing Approach for the Vehicle Routing Problem with Synchronized Visits.In Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-396-4, pages 297-303. DOI: 10.5220/0008990302970303


in Bibtex Style

@conference{icores20,
author={Seddik Hadjadj and Hamamache Kheddouci},
title={Simulated Annealing Approach for the Vehicle Routing Problem with Synchronized Visits},
booktitle={Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2020},
pages={297-303},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008990302970303},
isbn={978-989-758-396-4},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Simulated Annealing Approach for the Vehicle Routing Problem with Synchronized Visits
SN - 978-989-758-396-4
AU - Hadjadj S.
AU - Kheddouci H.
PY - 2020
SP - 297
EP - 303
DO - 10.5220/0008990302970303