Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows - Advances in Production Management Systems Sustainable: Production and Service Supply Chains - Part II Access content directly
Conference Papers Year : 2013

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

Fu Zhao
  • Function : Author
  • PersonId : 999939
Dong Mu
  • Function : Author
  • PersonId : 999940
John W. Sutherland
  • Function : Author
  • PersonId : 999941

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.
Fichier principal
Vignette du fichier
978-3-642-41263-9_21_Chapter.pdf (154.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01451752 , version 1 (01-02-2017)

Licence

Attribution

Identifiers

Cite

Chao Wang, Fu Zhao, Dong Mu, John W. 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⟩
112 View
1105 Download

Altmetric

Share

Gmail Facebook X LinkedIn More