The ALGACEA-1 method for the capacitated vehicle routing problem

International Transactions in Operational Research

Volumn 15, Issue 5, 2008, Pages 599-621

  Faulin, Javier ^a   Juan, Angel A ^b  

^a PUBLIC UNIVERSITY OF NAVARRE   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Distribution; Entropy; Heuristics; Monte Carlo methods; Vehicle routing problem

Indexed keywords

EID: 66549130418     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2008.00640.x     Document Type: Article

References (39)

1. Augerat, P., 1995. CVRP Problem Instances (Last accessed November 11, 2006). Available at http://neo.lcc.uma.es/radi-aeb/WebVRP/index.html?VRP-Intro.html
2. Beasley, J., 1981. Adapting the savings algorithm for varying inter-customer travel times. Omega 9, 658–659.
3. Bodin, L., Berman, L., 1979. Routing and scheduling of school buses by computer. Transportation Science 13, 113–129.
4. Bodin, L., Golden, B., Assad, A., Ball, M., 1983. Routing and scheduling of vehicles and crews. The state of the art. Computers and Operations Research 10, 63–212.
5. Buxey, G.M., 1979. The vehicle scheduling problem and Monte Carlo simulation. Journal of Operational Research Society 30, 563–573.
6. Clarke, G., Wright, J., 1964. Scheduling of vehicles from a central depot to a number of delivering points. Operations Research 12, 568–581.
7. Dror, M., Trudeau, P., 1986. Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research 23, 228–235.
8. Faulin, J., 2003. Applying MIXALG procedure in a routing problem to optimize food product delivery. Omega 31, 387–395.
9. Faulin, J., Gil, I., 2002. Using the Monte Carlo Simulation in the ALGACEA Model for the Logistic Optimization. IFORS 2002 Sixteenth Triennial Conference of the International Federation of Operational Research Societies, Edinburg, UK.
10. Feo, T.A., Resende, M.G.C., 1989. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67–71.
11. Feo, T.A., Resende, M.G.C., 1995. Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133.
12. Fernández de Córdoba, P., García Raffi, L.M., Mayado, A., Sanchis, J.M., 2000. A real delivery problem dealt with Monte Carlo techniques. TOP 8, 57–71.
13. Fernández de Córdoba, P., García Raffi, A., Sanchis, J.M., 1998. A heuristic algorithm based on Monte Carlo methods for the rural postman problem. Computers and Operations Research 25, 1097–1106.
14. Gaskell, T.J., 1967. Bases for the vehicle fleet scheduling. Operational Research Quarterly 18, 281–295.
15. Gass, S.I., Assad, A.A., 2005a. An Annotated Timeline of Operations Research. Springer, New York.
16. Gass, S.I., Assad, A.A., 2005b. Model world: tales from the time line. The definition of OR and the origins of Monte Carlo simulation. Interfaces 35, 429–435.
17. Gendreau, M., Hertz, A., Laporte, G., 1994. A Tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290.
18. Gil, I., 2001. Variation of the Clarke and Wright's Algorithm for Routes of Vehicles by Monte Carlo Techniques. Solution of a Real Problem. Final Project Dissertation. ETSII. Public University of Navarre, Spain.
19. Gillet, B.E., Miller, L.R., 1974. A Heuristic Algorithm for the vehicle dispatch problem. Operations Research 22, 340–349.
20. Golden, B., Magnanti, T., Nguyen, H., 1977. Implementing vehicle routing algorithms. Networks 7, 113–148.
21. Gutin, G., Punnen, A.P. (eds) 2002. The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Boston, MA.
22. Holmes, R.A., Parker, R.G., 1976. A vehicle scheduling procedure based upon savings and a solution perturbation scheme. Operational Research Quarterly 27, 83–92.
23. Laporte, G., Gendreau, M., Potvin, J.Y., Semet, F., 2000. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7, 285–300.
24. Laporte, G., Nobert, Y., 1987. Exact algorithms for the vehicle routing problem. Annals of Discrete Mathematics 31, 147–184.
25. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds) 1985. The Traveling Salesman Problem. John Wiley, Chichester.
26. Lin, S., Kernighan, B.W., 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations Research 11, 498–516.
27. Mole, R.H., Jameson, S.R., 1976. A sequential route-building algorithm employing a generalised savings criterion. Operational Research Quarterly 27, 503–511.
28. Monje, D., 2006. Vehicle Routing Building with Environmental Criteria. Application of a Variant of the ALGACEA Algorithm. Final Project Dissertation. ETSII. Public University of Navarre, Spain.
29. Nance, R.E., Sargent, R.G., 2002. Perspectives on the evolution of simulation. Operations Research 50, 161–172.
30. Paessens, H., 1988. The savings algorithm for the vehicle routing problem. European Journal of Operational Research 34, 336–344.
31. Papoulis, A., 1990. Probability and Statistics. Prentice-Hall International Editions, Englewood Cliffs, NJ.
32. Shannon, C.E., Weaver, W., 1963. Mathematical Theory of Communication. University of Illinois Press, Urbana, IL.
33. Solomon, M.M., 2002. VRPTW's Instances (Last accessed November 11, 2006). Available at http://www.idsia.ch/luca/macs-vrptw/problems/welcome.htm
34. Taneja, I.J., 2002. Generalized Information Measures and Their Applications. Electronic Book available at http://mtm.ufsc.br/taneja/dados/dados1.html. Downloaded on March 6, 2006.
35. Tarantilis, C.D., Kiranoudis, C.T., 2002. Boneroute: an adaptative memory-based method for effective fleet management. Annals of Operations Research 115, 227–241.
36. Toth, P., Vigo, D., 2002 The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA.
37. Toth, P., Vigo, D., 2003. The granular Tabu Search and its application to the vehicle routing problem. INFORMS Journal on Computing 15, 333–346.
38. Van Breedam, A., 2001. Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers and Operations Research 28, 289–315.
39. Vigo, D., 2005. CVRP Problem Instances (Last accessed November 11, 2006). Available at http://www.or.deis.unibo.it/research_pages/ORinstances/VRPLIB/VRPLIB.html