Abstract
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is a variant of the Capacitated Vehicle Routing Problem (CVRP), in which clients require both pickup and delivery services. This paper proposes an improved particle swarm optimization algorithm based on multiple social structures for solving VRPSPD. The decoding of single particle in swarm consists two parts: the first is m dimensional (m-D) variables for m customers, and the second comprises 2n dimensions (2n-D) for n vehicles which presents vehicle route orientation. The particle is transformed to customers’ list and vehicles matrix. A benchmark dataset is used to validate the performance of proposed algorithm. Comparing with prior works, promising results indicate that the proposed algorithm may hold high potentials for generating powerful tool for solving VRPSPD and other attributes of vehicle routing problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Min, H.: The multiple vehicle routing problem with simultaneous delivery and pickup points. Transportation Research A 23, 377–386 (1989)
Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23, 79–96 (2001)
Tang, F.A., Galvao, R.D.: Vehicle routing problems with simultaneous pick-up and delivery service. Journal of the Operational Research Society of India (OPSEARCH) 39, 19–33 (2002)
Tang, F.A., Galvao, R.D.: A tabu search algorithm for the vehicle routing problems with simultaneous pick-up and delivery service. Computer & Operation Research 33, 595–619 (2006)
Baker Barrie, M., Ayechew, M.A.: A Genetic Algorithm for the Vehicle Routing Problem. Computers & Operations Research 30, 787–800 (2003)
Christian, P.: A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem. Computers & Operations Research 31, 1985–2002 (2004)
Angelelli, E., Mansini, R.: A branch-and-price algorithm for a simultaneous pick-up and delivery problem. Working Paper, Article Presented at the EURO/INFORMS Meeting, 2003.
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Ai, J., Kachitvichyanukul, V.: A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research 36, 1693–1702 (2009)
Mateo, S.: Swarm Intelligence. Morgan Kaufmann, CA (2001)
Bianchessi, N., Righini, G.: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers and Operations Research 34, 578–594 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, R., Zhang, T., Tang, H. (2010). An Improved Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Simultaneous Pickup and Delivery. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Communications in Computer and Information Science, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16336-4_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-16336-4_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16335-7
Online ISBN: 978-3-642-16336-4
eBook Packages: Computer ScienceComputer Science (R0)