Abstract
The vehicle routing problem with simultaneous deliveries and pick-ups (VRPSDP) is an extension for the classical vehicle routing problem (VRP) where customers require simultaneous deliveries and pick-ups. In this paper, an integer programming model of VRPSDP was presented in detail from the point of bidirectional logistics (including the logistics and reverse logistics). Moreover, an improved particle swarm optimization (IPSO) was proposed to solve the model of VRPSDP. In the algorithm, an ordinal number coding method was adopted based on customers and an auxiliary operator based on integer order criterion (IOR) was adopted, and the evolution equation was improved such that search process was self-adapting with iteration. Finally, some numerical examples were presented to illustrate the efficiency of the proposed models and algorithms.
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.
References
Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23(1), 79–96 (2001)
Biabchessi, N., Righini, G.: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research 34(2), 578–594 (2007)
Min, H.: The multiple vehicle routing problems with simultaneous delivery and pickup points. Transportation Research A 23(5), 377–386 (1989)
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(1), 19–33 (2002)
Alfredo, F., Montane, T.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computer & Operations Research 33(3), 595–619 (2006)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. IEEE Int. Conf. on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)
Mendes, R., Kennedy, J., Neves, J.: Watch thy neighbor or how the swarm can learn from its environment. In: Proc. IEEE Int. Conf on Evolutionary Computation, Indianapolis, pp. 88–94 (2003)
Gen, M., Cheng, R.: Genetic Algorithms &Engineering Optimization. Wiley, New York (2000)
Cao, E., Lai, M.: The open vehicle routing problem with fuzzy demands. Expert Systems with Applications 37(3), 2405–2411 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, C., Wang, T. (2011). An Improved Particle Swarm Optimization for the Vehicle Routing Problem with Simultaneous Deliveries and Pick-Ups. In: Shen, G., Huang, X. (eds) Advanced Research on Computer Science and Information Engineering. CSIE 2011. Communications in Computer and Information Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21411-0_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-21411-0_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21410-3
Online ISBN: 978-3-642-21411-0
eBook Packages: Computer ScienceComputer Science (R0)