Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows

Abstract : A variant of vehicle routing problem in which customers require simultaneous pickup and delivery goods during specific individual time windows (VRPSPDTW) is addressed. A general mixed integer programming model focused on minimizing the number of vehicles is proposed. A simulated annealing (SA) algorithm is developed and applied to solve this NP-hard optimization problem. Computational results are reported for a set of 15 test problems from Wang and Chen’s benchmark and compared with the results from a genetic algorithm (GA). It is shown that SA is an effective metaheuristic to solve the VRPSPDTW.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01451752
Contributor : Estelle Nivault <>
Submitted on : Wednesday, February 1, 2017 - 2:15:14 PM
Last modification on : Friday, December 1, 2017 - 1:15:30 AM

File

978-3-642-41263-9_21_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Chao Wang, Fu Zhao, Dong Mu, John Sutherland. Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows. 20th Advances in Production Management Systems (APMS), Sep 2013, State College, PA, United States. pp.170-177, ⟨10.1007/978-3-642-41263-9_21⟩. ⟨hal-01451752⟩

Share

Metrics

Record views

104

Files downloads

433