Solving the capacitated vehicle routing problem with maximum traveling distance and service time requirements: An approach based on Monte Carlo simulation

Proceedings - Winter Simulation Conference

Volumn , Issue , 2009, Pages 2467-2475

  Juan, Angel A ^a   Adelantado, Ferran ^a   Faulin, Javier ^b   Grasman, Scott E ^c   Montoya Torres, Jairo R ^d  

^a UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^b PUBLIC UNIVERSITY OF NAVARRE   (Spain)

^c Missouri University of Science and Technology   (United States)

^d UNIVERSIDAD DE LA SABANA   (Colombia)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL COSTS; BASIC IDEA; CAPACITATED VEHICLE ROUTING PROBLEM; DIVIDE-AND-CONQUER TECHNIQUE; GEOMETRIC DISTRIBUTION; MONTE CARLO SIMULATION; RANDOM BEHAVIOR; SERVICE TIME; SUB-PROBLEMS;

COMPUTER SIMULATION; ROUTING ALGORITHMS;

MONTE CARLO METHODS;

EID: 77951558411     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2009.5429663     Document Type: Conference Paper

References (34)

1. Alfa, A., S. Heragu, and M. Chen. 1991. A 3-opt based simulated annealing algorithm for the vehicle routing problem. Computers & Industrial Engineering 21:635-639.
2. Battarra, M., B. Golden, and D. Vigo. 2009. Tuning a parametric Clarke-Wright heuristic via a genetic algorithm. In press at Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2602488.
3. Beasley, J. 1981. Adapting the Savings Algorithm for Varying Inter-Customer Travel Times. Omega 9:658-659.
4. Bell, J., and P. McMullen. 2004. Ant Colony Optimization Techniques For The Vehicle Routing Problem. Advanced Engineering Informatics 18:41-48.
5. Berger, J., and M. Barkaoui. 2003. A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem. In Proceedings of the International Genetic and Evolutionary Computation Conference, ed. E. Cantó-Paz, 646-656. Illinois, Chicago, USA. Springer-Verlag.
6. Buxey, G. 1979. The Vehicle Scheduling Problem and Monte Carlo Simulation. Journal of Operational Research Society 30:563-573.
7. Christofides, N., A. Mingozzi, and P. Toth. 1979. The vehicle routing problem. In Combinatorial Optimization, 315-338, ed. N. Christofides, A. Mingozzi, P. Toth, and L. Sandi. Wiley, Chichester, U.K.
8. Clarke, G., and J. Wright. 1964. Scheduling of Vehicles from a central Depot to a Number of Delivering Points. Operations Research 12:568-581.
9. Dror, M., and P. Trudeau. 1986. Stochastic Vehicle Routing with Modified Savings Algorithm. European Journal of Operational Research 23:228-235.
10. Faulin, J., and A. Juan. 2008. The ALGACEA-1 Method for the Capacitated Vehicle Routing Problem. International Transactions in Operational Research 15:1-23.
11. Fernandez, P., L. Garcia, A. Mayado, and J. Sanchis. 2000. A Real Delivery Problem Dealt with Monte Carlo Techniques. TOP 8:57-71.
12. Festa, P., and M.G.C. Resende. 2009. An Annotated Bibliography of GRASP- Part I: Algorithms. International Transactions in Operational Research 16: 1-24
13. Gendreau M., A. Hertz, and G. Laporte. 1994. A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science 40:1276-1290.
14. Golden, B., S. Raghavan, and E. Wasil (eds.). 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer.
15. Harding, S., and W. Banzhaf. 2007. Fast genetic programming on GPUs. In Proceedings of the 10th European Conference on Genetic Programming 90-101. Valencia, Spain.
16. Holmes, R., and R. Parker. 1976. A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme. Operational Research Quarterly 27:83-92.
17. Juan, A., J. Faulin, R. Ruiz, B. Barrios, M. Gilibert, and X. Vilajosana. 2009. Using oriented random search to provide a set of alternative solutions to the capacitated vehicle routing problem. In Operations Research and Cyber-Infrastructure, ed. J. Chinneck, B. Kristjansson, M. Saltzman, 331-346. Springer, New York, USA.
18. Kant, G., M. Jacks, and C. Aantjes. 2008. Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery. Interfaces 38:40-50.
19. L'Ecuyer, P. 2002. SSJ: A Framework for Stochastic Simulation in Java. In Proceedings of the 2002 Winter Simulation Conference ed. E. Yücesan, C. H. Chen, J. L. Snowdon, J. M. Charnes, 234-242. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers, Inc.
20. L'Ecuyer, P. 2006. Random Number Generation. In Handbooks in Operations Research and Management Science: Simulation, ed. S. Henderson and B. Nelson, 55-81. Elsevier Science, Amsterdam.
21. Laporte, G. 2007. What you should know about the Vehicle Routing Problem. Naval Research Logistics 54:811-819.
22. Laporte, G., and F. Semet. 2001. The vehicle routing problem. In SIAM monographs on discrete mathematics and application, eds. P. Toth and D. Vigo, 109-125.
23. Law, A. 2007. Simulation Modeling & Analysis. McGraw-Hill.
24. Lin, S., Z. Lee, K. Ying, and C. Lee. 2009. Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Systems with Applications 36(2):1505-1512.
25. Mester, D., and O. Bräysy. 2007. Active-guided evolution strategies for the large-scale capacitated vehicle routing problems. Computers and Operations Research 34:2964-2975.
26. Mole, R., and S. Jameson. 1976. A Sequential Route-building Algorithm Employing a Generalised Savings Criterion. Operational Research Quarterly 27:503-511.
27. Montoya-Torres, J.R., E. Alfonso-Lizarazo, E. Gutierrez-Franco, and A.X. Halabi. 2009. Using Randomization to solve Deterministic Vehicle Routing Problem with Service Times Requirements. Working paper No. 2009-2102, School of Economics and Management Sciences, Universidad de La Sabana, Chia, Colombia.
28. Paessens, H. 1988. The Savings Algorithm for the Vehicle Routing Problem. European Journal of Operational Research 34:336-344.
29. Prins, C. 2004. A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem. Computers and Operations Research 31:1985-2002.
30. Resende, M. 2008. Metaheuristic hybridization with Greedy Randomized Adaptive Search Procedures. In TutORials in Operations Research, ed. Z. Chen and S. Raghavan, 295-319.
31. Taillard, E. 1993. Parallel Iterative Search Methods for Vehicle Routing Problems. Networks 23:661-673.
32. Tarantilis, C., and C. Kiranoudis. 2002. Boneroute: an Adaptative Memory-Based Method for Effective Fleet Management. Annals of Operations Research 115:227-241.
33. Toth, P., and D. Vigo. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM.
34. Toth, P., and D. Vigo. 2003. The Granular Tabu Search and its Application to the Vehicle Routing Problem. INFORMS Journal on Computing 15:333-346.