A hybrid particle swarm optimization algorithm for multi-objective pickup and delivery problem with time windows

Journal of Computers (Finland)

Volumn 8, Issue 10, 2013, Pages 2583-2589

  Zou, Shuilong ^a   Li, Jin ^b   Li, Xueqian ^c  

^a Nanchang Institute of Science and Technology   (China)

^b ZHEJIANG GONGSHANG UNIVERSITY   (China)

^c UNIVERSITY OF SHANGHAI FOR SCIENCE AND TECHNOLOGY   (China)

Author keywords

Algorithm; Particle swarm optimization; Pickup and delivery; Transportation; Vehicle routing problem with time windows

Indexed keywords

HYBRID PARTICLE SWARM OPTIMIZATION; HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM; MINIMIZING THE NUMBER OF; MIXED INTEGER PROGRAMMING MODEL; PICKUP AND DELIVERY; PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

ALGORITHMS; BENCHMARKING; FLEET OPERATIONS; PARTICLE SWARM OPTIMIZATION (PSO); TRANSPORTATION;

PROBLEM SOLVING;

EID: 84884791781     PISSN: 1796203X     EISSN: None     Source Type: Journal    
DOI: 10.4304/jcp.8.10.2583-2589     Document Type: Article

References (24)

1. G.B. Dantzig, J.H. Ramser, "The truck dispatching problem," Management Science, vol. 6, no.1, pp.80-91, 1959.
2. J. Li, "Research on team orienteering problem with dynamic travel times," Journal of Software, vol.7, no. 2, pp.249-255, 2012.
3. J. Li, P.H. Fu, "A label correcting algorithm for dynamic tourist trip planning," Journal of Software, vo.7, no. 12, pp.2899-2905, 2012.
4. Y.Z. Wang, "Constraint cellular ant algorithm for the multi-objective vehicle routing problem," Journal of Software, vol.8, no.6, pp.1339-1345, 2013.
5. C.Y. Ren, "Research on single and mixed fleet strategy for open vehicle routing problem," Journal of Software, vol.6, no.10, pp. 2076-2081, 2011.
6. J. Li, "Vehicle routing problem with time windows for reducing fuel consumption," Journal of Computers, vol. 7, no.12, pp.3020-3027, 2012.
7. J. Li, "Model and simulation for collaborative VRPSPD," Journal of Networks, vol.8, no.2, pp.331-338, 2013.
8. B. Rekiek, A. Delehambre, H.A. Saleh, "Handicapped person transportation: An application of the grouping genetic algorithm," Eng Appl Artif Intel, no.19, pp.511-520, 2006.
9. K. Fagerholt, M. Christiansen, "A combined ship scheduling and allocation problem," Journal Operation Research Society, no.51, pp.834-842, 2000.
10. A.G. Najera, J.A. Bullinaria. "An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows," Computers & Operations Research, no.38, pp.287-300, 2011.
11. C.L. Hoong, L. Zhe, "Pickup and delivery with time windows: algorithms and test case generation," International Journal on Artificial Intelligence Tools, vol.11, no.3, DOI: 10.1142/S0218213002000988, 2002.
12. H.F. Wang, Y.Y. Chen, "A genetic algorithm for the simultaneous delivery and pickup problems with time window," Computers & Industrial Engineering, 2012, vol.62, no.1, pp.84-95.
13. Q. Lu, M.M. Dessouky, "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, 2006, vol.175, no.2, pp.672-687.
14. th IEEE International Conference on Tools with Artificial Intelligence, IEEE Computer Society, LosAlamitos, CA, 2001, pp. 333-340.
15. G. Pankratz, "A grouping genetic algorithm for the pickup and delivery problem with time windows," Operation Research Spectrum, 2005, vol.27, pp.21-41.
16. H.F. Wang, Y.Y. Chen, "A coevolutionary algorithm for the flexible delivery and pickup problem with time windows," International Journal of Production Economics, 2013, vol. 141, no. 1, pp.4-13.
17. M.I. Hosny, C.L. Mumford, "Constructing initial solutions for the multiple vehicle pickup and delivery problem with time windows," Journal of King Saud University -Computer and Information Sciences, 2012, vol.24, no.1, pp.59-69.
18. Y. Qu, J.F. Bard, "A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment," Computers & Operations Research, 2012, vol.29, no.10, pp.2439-2456.
19. W.P. Nanry, J.W. Barnes, "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B: Methodological, 2000, vol.34, no.2, pp.107-121.
20. J. Kennedy, R.C. Eberhart, "Particle swarm optimization," In Proceeding of the IEEE international conference on neural network, 1995, no.4, pp.1942-1948.
21. Y. Marinakis, M. Marinaki, G. Dounias, "A hybrid particle swarm optimization algorithm for the vehicle routing problem," Engineering Applications of Artificial Intelligence, 2010, vol.23, pp.463-472.
22. Q.K. Pan, M.F. Tasgetiren, Y.C. Liang, "A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem," Computers & Operation Research, 2008, vol.35, no.9, pp.2807-2839.
23. Q. Kang, H. He, "A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems," Microprocessors and Microsystems, 2011, no.35, pp.10-17.
24. A. Subramanian, L.M.A. Drummond, C. Bentes, et al., "A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery," Computers& Operations Research, vol.37, pp.1899-1911, 2010.