Solving vehicle routing problem with simultaneous pickup and delivery using parallel simulated annealing algorithm Online publication date: Mon, 30-Nov-2015
by Dong Mu; Chao Wang; Fu Zhao; John W. Sutherland
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 8, No. 1, 2016
Abstract: The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is an NP-hard combinatorial optimisation problem that has received considerable attention in the past few decades. A parallel simulated annealing (parallel-SA) algorithm that uses four different neighbourhood structures has been developed to solve this problem. The parallel-SA algorithm follows the traditional sequential SA algorithm with an integrated asynchronous and synchronous multiple Markov chains (MMC) approach and incorporates a master-slave structure in the algorithm. Computational results are reported for 72 test problems with 50 to 400 customers from Dethloff's medium-scale benchmark, Salhi and Nagy's medium-to-large-scale benchmark and Montane and Galvao's large-scale benchmark. Computational results indicate that the proposed parallel-SA algorithm is competitive with other well-known algorithms for VRPSPD from both quality of solution and computational time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook