A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery

Computers and Industrial Engineering

Volumn 65, Issue 1, 2013, Pages 39-53

  Goksal, Fatma Pinar ^a   Karaoglan, Ismail ^b   Altiparmak, Fulya ^c  

^a BASKENT UNIVERSITY   (Turkey)

^b SELCUK UNIVERSITY   (Turkey)

^c GAZI UNIVERSITY   (Turkey)

Author keywords

Particle swarm optimization; Simultaneous pickup and delivery; Variable neighborhood descent algorithm; Vehicle routing problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; PICKUPS; VEHICLE ROUTING; VEHICLES;

BENCHMARK-PROBLEM INSTANCES; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; DISCRETE PARTICLE SWARM OPTIMIZATION; SIMULTANEOUS PICKUP AND DELIVERIES; VARIABLE NEIGHBORHOOD DESCENTS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 84879686510     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2012.01.005     Document Type: Article

References (53)

1. Ai, T. J., & Kachitvichyanukul, V. (2009a). A particle-sicle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers and Operations Research, 36, 1693-1702.
2. Ai, T. J., & Kachitvichyanukul, V. (2009b). Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering, 56(1), 380-387.
3. Berbeglia, G., Cordeau, J. F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: A classification scheme and survey. TOP, 15, 1-31.
4. Bianchessi, N., & Righini, G. (2007). Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research, 34, 578-594.
5. Catay, B. (2010). A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications, 37(10), 6809-6817.
6. Chen, J. F., & Wu, T. H. (2006). Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society, 57, 579-587.
7. Chen, A., Yang, G., & Wu, Z. (2006). Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University Science A, 7, 607-614.
8. Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem. In N. Christofides, A. Mingozzi, P. Toth, & L. Sandi (Eds.), Combinatorial optimization. Chichester, UK: Wiley.
9. Cosco, D. O., Golden, B. L., & Wasil, E. A. (1988). Vehicle routing with backhauls: Models, algorithms and case studies. In Vehicle routing: Method and studies (pp. 127-147). Amsterdam: Elsevier.
10. Crispim, J., & Brandao, J. (2005). Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. Journal of the Operational Research Society, 56, 1296-1302.
11. Czogalla, J., & Fink, A. (2008). On the effectiveness of particle swarm optimization and variable neighborhood descent for the continuous flow-shop scheduling problem. Studies in Computational Intelligence, 128, 61-89.
12. Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91.
13. Deif, I., & Bodin, L. (1984). Extension of the clarke and wright algorithm for solving the vehicle routing problem with backhauling. In A. Kidder (Ed.), Proceedings of the Babson conference on software uses in transportation and logistic management (pp. 75-96). USA: Babson Park.
14. Dell'Amico, M., Righini, G., & Salani, M. (2006). A branch-And-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Science, 40, 235-247.
15. Dethloff, J. (2001). Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, 23, 79-96.
16. Eberhart, R. C., Shi, Y., & Kennedy, J. (2001). Swarm intelligence. San Francisco: Morgan Kaufmann Publisher.
17. Gajpal, Y., & Abad, P. (2009). An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Computers and Operations Research, 36(12), 3215-3223.
18. Gajpal, Y., & Abad, P. (2010). Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery. Journal of the Operational Research Society, 61(10), 1498-1509.
19. Gen, M., & Cheng, R. (1997). Genetic algorithms & engineering design. NewYork: Wiley.
20. Golden, B., Baker, E., Alfaro, J., Schaffer, J. (1985). The vehicle routing problem with backhauling: Two approaches. In R. Hammesfahr (Ed.), Proceedings of the XXI annual meeting of S.E. Times (pp. 90-92).
21. Hansen, P., Mladenovic, N., & Perez, J. A. M. (2010). Variable neighborhood search: Methods and applications. Annals of Operations Research, 175, 367-407.
22. Kang, Q., & He, H. (2011). A novel discrete particle swarm optimization algorithm for meta-Task assignment in heterogeneous computing systems. Microprocessors and Microsystems, 35, 10-17.
23. Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks (pp. 1942-1948). NJ: Piscataway.
24. Lee, C. Y., Lee, Z. J., Lin, S. W., & Ying, K. C. (2010). An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Applied Intelligent, 32, 88-95.
25. Liao, C. J., Tseng, C. T., & Luarn, P. (2007). A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research, 34, 3099-3111.
26. Liu, S., Huang, W., & Ma, H. (2009). An effective genetic algorithm for fleet size and mix vehicle routing problems. Transportation Research Part E: Logistics and Transportation Review, 45(3), 434-445.
27. Liu, B., Wang, L., & Jin, Y. H. (2007). An effective PSO-based memetiv algorithm for flow shop scheduling. IEEE Transactions on Systems, Man and Cybernetics-Part B: Cybernetics, 37(1), 18-37.
28. Marinakis, Y., & Marinaki, M. (2010). A hybrid genetic-particle swarm optimization algorithm for the vehicle routing problem. Expert Systems with Application, 37(2), 1446-1455.
29. Marinakis, Y., Marinaki, M., & Dounias, G. (2010). A hybrid particle swarm optimization algorithm for the vehicle routing problem. Engineering Applications of Artificial Intelligence, 23(4), 463-472.
30. Min, H. (1989). The multiple vehicle routing problem with simultaneous delivery and pickup points. Transportation Research A, 23, 377-386.
31. Montane, F. A. T., & Galvao, R. D. (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research, 33(3), 595-619.
32. Mosheiov, G. (1998). Vehicle routing with pick-up and delivery: Tour-partitioning heuristics. Computers & Industrial Engineering, 34(3), 669.
33. Nagy, G., & Salhi, S. (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162(1), 126-141.
34. Pan, Q. K., Tasgetiren, M. F., & Liang, Y. C. (2008). A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operation Research, 35(9), 2807-2839.
35. Pang, W., Wang, K. P., Zhou, C. G., & Dong, L. J. (2004). Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In Proceedings of the 4th international conference on computer and information technology (pp. 796-800). IEEE CS Press.
36. Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Part I: Transportation between customers and depot. Journal für Betriebswirtschaft, 58(1), 21-51.
37. Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31, 1985-2002.
38. Prins, C. (2009). Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence, 22(6), 916-928.
39. Repoussis, P. P., Tarantilis, C. D., Braysy, O., & Ioannou, G. (2010). A hybrid evolution strategy for the open vehicle routing problem. Computers & Operations Research, 37, 443-455.
40. Ropke, S., & Pisinger, D. (2006). A unified heuristic for a large class of vehicle routing problems with bakhauls. European Journal of Operational Research, 171(3), 750-775.
41. Salhi, S., & Nagy, G. (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society, 50, 1034-1042.
42. Subramanian, A., Drummond, L. M. A., Bentes, C., Ochi, L. S., & Farias, R. (2010). A parallel heuristic for the vehicle routing problem with simultaneous pick-up and delivery. Computers and Operations Research, 37(11), 1899-1911.
43. Talbi, E. G. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8, 541-564.
44. Tan, K. C., Lee, L. H., & Ou, K. (2001). Artificial intelligence heuristics in solving vehicle routing problems with time window constraints. Engineering Applications of Artificial Intelligence, 14(6), 825-837.
45. Tang, F. A., & Galvao, R. D. (2006). Vehicle routing problems with simultaneous pickup and delivery service. Journal of the Operational Research Society of India, 39, 19-33.
46. Tang, L., & Wang, X. (2010). An improved particle swarm optimization algorithm for the hybrid flowshop scheduling to minimize total weighted completion time in process industry. IEEE Transactions on Control Systems Technology. doi:10.1109/TCST.2009.2036718.
47. Toth, P., & Vigo, D. (Eds.). (2002). The vehicle routing problem. Philadelphia: SIAM Monographs on Discrete Mathematics and Applications.
48. Tasgetiren, M. F., Liang, Y. C., Sevkli, M., & Gencyilmaz, G. (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177, 1930-1947.
49. Wassan, N. A., Nagy, G., & Ahmadi, S. (2008). A heuristic method for the vehicle routing problem with mixed deliveries and pickups. Journal of Scheduling, 11, 149-161.
50. Wassan, N. A., Wassan, A. H., & Nagy, G. (2007). A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization, 15, 368-386.
51. Zachariadis, E. E., & Kiranoudos, T. (2011). A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries. Expert Systems with Applications, 38, 2717-2726.
52. Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2009). A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pickup service. Expert Systems with Applications, 36(2), 1070-1080.
53. Zachariadis, E. E., Tarantilis, C. D., & Kiranoudos, T. (2010). An adaptive methodlogy for the vehicle routing problem with simultaneous pick-ups and deliveries. European Journal of Operational Research, 202(2), 401-411.