A new saving-based ant algorithm for the Vehicle Routing Problem with simultaneous Pickup and Delivery

Expert Systems with Applications

Volumn 37, Issue 10, 2010, Pages 6809-6817

  Çatay, Bülent ^a  

^a SABANCI UNIVERSITY   (Turkey)

Author keywords

Ant colony optimization; Metaheuristics; Reverse logistics; Vehicle routing

Indexed keywords

ANT COLONY OPTIMIZATION; FLEET OPERATIONS; LOGISTICS; OPTIMIZATION; PICKUPS; ROUTING ALGORITHMS; SALES; VEHICLES;

ANT COLONY ALGORITHMS; BENCH-MARK PROBLEMS; META HEURISTICS; PICKUP AND DELIVERY; REVERSE LOGISTICS; SIMULTANEOUS PICKUP AND DELIVERIES; VEHICLE ROUTING PROBLEMS; VISIBILITY FUNCTION;

VEHICLE ROUTING;

EID: 81355132152     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.03.045     Document Type: Article

References (44)

1. Angelelli, E., & Mansini, R. (2002). The vehicle routing problem with time windows and simultaneous pickup and delivery. In Quantitative approaches to distribution logistics and supply chain management series. Lecture Notes in Economics and Mathematical Systems (pp. 249-267).
2. Bianchessi, N., & Righini, G. (2007). Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers and Operations Research, 34, 578-594. (Pubitemid 44205374)
3. Brandão, J. (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 173, 540-555.
4. Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999a). An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89, 319-328.
5. Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999b). A new rank-based version of the ant system: A computational study. Central European Journal of Operations Research and Economics, 7, 25-38.
6. Casco, D. O., Golden, B. L, & Wasil, E. A. (1988). Vehicle routing with backhauls: Models, algorithms, and case studies. In B. L. Golden & A. A. Assad (Eds.), Vehicle routing: Methods and studies (pp. 127-147). Amsterdam: Elsevier.
7. Chen, J. F., & Wu, T. H. (2006). Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society, 57, 579-587.
8. Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem. In N. Christofides, A. Mingozzi, P. Toth, & C. Sandi (Eds.), Combinatorial optimization (pp. 315-338). Chichester: Wiley.
9. Clarke, G., & Wright, W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568-581.
10. Colorni, A., Dorigo, M., & Maniezzo, V. (1991). Distributed optimization by ant colonies. In F. Varela & P. Bourgine (Eds.), Proceedings of the first European conference on artificial life (pp. 134-142). Paris: Elsevier Publishing.
11. Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994). Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science, 34, 39-45.
12. Crispim, J., & Brandão, J. (2005). Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. Journal of the Operational Research Society, 56, 1296-1302. (Pubitemid 41486893)
13. Dethloff, J. (2001). Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, 23, 79-96. (Pubitemid 33692894)
14. Doerner, K. F., Gronalt, M., Hartl, R. F., Reimann, M., Strauss, C, & Stummer, M. (2002). SavingsAnts for the vehicle routing problem. In S. Cagnoni et al. (Eds.), Proceedings of EvoWorkshops 2002. Lecture Notes in Computer Science (Vol. 2279, pp. 11-20).
15. Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy (in Italian).
16. Dorigo, M. (2008). Ant colony optimization. Scholarpedia, 2(3), 1461.
17. Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1, 53-66. (Pubitemid 127771018)
18. Dorigo, M., Maniezzo, V., & Colorni, A. (1996). The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26, 29-41. (Pubitemid 126780573)
19. Dorigo, B., & Stützle, T. (2004). Ant colony optimization. Cambridge, MA: MIT Press.
20. Gambardella, L. M., Taillard, E., & Agazzi, G. (1999). MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 63-76). London: McGraw-Hill.
21. Gambardella, L. M., & Dorigo, M. (2000). Ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing, 12, 237-255.
22. Gendreau, M., Laporte, G., & Vigo, D. (1999). Heuristics for the traveling salesman problem with pickup and delivery. Computers and Operations Research, 26, 699-714. (Pubitemid 29346447)
23. Goetschalckx, M., & Jacobs-Blecha, C. (1989). The vehicle routing problem with backhauls. European Journal of Operational Research, 42, 39-51.
24. Gökçe, E. I., & Çatay, B. (2005). A revised ant colony system for the vehicle routing problem with time windows. In B. Durmusoglu & C. Kahraman (Eds.), Proceedings of the 35th international conference on computers & industrial engineering, Istanbul, Turkey (Vol. 2, pp. 813-818).
25. Gribkovskaia, I., Halskau, Ø., Laporte, G., & Vlcek, M. (2007). General solutions to the single vehicle routing problem with pickups and deliveries. European Journal of Operational Research, 180, 568-584. (Pubitemid 46199073)
26. Halse, K. (1992). Modeling and solving complex vehicle routing problems. Unpublished PhD thesis, Department of Mathematical Modeling, Technical University of Denmark.
27. Min, H. (1989). The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research A, 23, 377-386.
28. Montané, F. A. T., & Galvão, R. D. (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers and Operations Research, 33, 595-619. (Pubitemid 41101115)
29. 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, 126-141.
30. Paessens, H. (1988). The savings algorithm for the vehicle routing problem. European Journal of Operational Research, 34, 336-344. (Pubitemid 18579989)
31. Reimann, M., Stummer, M., & Doerner, K. (2002). A savings based ant system for the vehicle routing problem. In: W. B. Langdon et al. (Eds.), Proceedings of the genetic and evolutionary computation conference (GECCO-2002), New York City, NY, USA (pp. 1317-1325).
32. Reimann, M., Doerner, K., & Hartl, R. F. (2003). Analyzing a unified ant system for the VRP and some of its variants. In S. Cagnoni et al. (Eds.), Proceedings of EvoWorkshops 2003. Lecture Notes in Computer Science (Vol. 2611, pp. 300-310).
33. Reimann, M., Doerner, K., & Hartl, R. F. (2004). D-Ants: Savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research, 31, 563-591. (Pubitemid 38098444)
34. Reimann, M., & Ulrich, U. (2006). Comparing backhauling strategies in vehicle routing using Ant Colony Optimization. Central European Journal of Operations Research, 14, 105-123. (Pubitemid 44727093)
35. Ropke, S. (2005). Heuristic and exact algorithms for vehicle routing problems. Unpublished PhD thesis, Computer Science Department, University of Copenhagen.
36. Ropke, S., & Pisinger, D. (2006). A unified heuristic for vehicle routing problems with backhauls. European Journal of Operational Research, 171, 750-775. (Pubitemid 43132944)
37. 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. (Pubitemid 129596355)
38. Stützle, T., & Dorigo, M. (1999). ACO algorithms for the quadratic assignment problem. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 33-50). London: McGraw-Hill.
39. Stützle, T., & Hoos, H. H. (1997). The MAX-MIN ant system and local search for the traveling salesman problem. In T. Bäck, Z. Michalewicz, & X. Yao (Eds.), Proceedings of the 1997 IEEE international conference on evolutionary computation (ICEC'97) (pp. 309-314). Piscataway, NJ: IEEE Press.
40. Toth, P., & Vigo, D. (1997). An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31, 372-385. (Pubitemid 127601478)
41. Vural, A. V., Çatay, B., & Eksioglu, B. (2005). A dual GA approach to capacitated vehicle routing problem with simultaneous pick-up and deliveries. In Proceedings of the IIE research conference, Atlanta, GA (CD-ROM).
42. Wade, A., & Salhi, S. (2001). An ant system algorithm for the vehicle routing problems with backhauls. In J. P. De Sousa (Ed.), Proceedings of MIC2001 fourth metaheuristics international conference, Porto (pp. 99-203).
43. Wade, A., & Salhi, S. (2003). An ant system algorithm for the mixed vehicle routing problem with backhauls. In M. G. Resende & J. P. de Sousa (Eds.), Metaheuristics: Computer decision making (pp. 699-719). New York: Kluwer.
44. Wassan, N. A., Wassan, A. H., & Nagy, G. (2008). A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization, 15, 368-386. (Pubitemid 351399920)