Skip to main content
SpringerLink
Log in

Using Oriented Random Search to Provide a Set of Alternative Solutions to the Capacitated Vehicle Routing Problem

  • Conference paper
Book cover Operations Research and Cyber-Infrastructure

Part of the book series: Operations Research/Computer Science Interfaces ((ORCS,volume 47))

Abstract

In this paper we present SR-GCWS, a simulation-based algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, the SR-GCWS algorithm incorporates a randomness criterion to the classical Clarke and Wright Savings (CWS) heuristic and starts an iterative process in order to obtain a set of alternative solutions, each of which outperforms the CWS algorithm. Thus, a random but oriented local search of the space of solutions is performed, and a list of “good alternative solutions” is obtained. We can then consider several properties per solution other than aprioristic costs, such as visual attractiveness, number of trucks employed, load balance among routes, environmental costs, etc. This allows the decision-maker to consider multiple solution characteristics other than just those defined by the aprioristic objective function. Therefore, our methodology provides more flexibility during the routing selection process, which may help to improve the quality of service offered to clients. Several tests have been performed to discuss the effectiveness of this approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Alba, E. and B. Dorronsoro. 2004. Solving the Vehicle Routing Problem by using Cellular Genetic Algorithms. In Jens Gottlieb and Günter R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization — EvoCOP 2004, LNCS 3004, 11–20, Coimbra, Portugal, 5–7 April, 2004. Springer-Verlag

    Chapter  Google Scholar 

  • Baldacci, R., Christofides, N. and Mingozzi, A. 2008. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming, 115(2): 351–385

    Article  MathSciNet  MATH  Google Scholar 

  • Battarra, M., Golden, B. and Vigo, D. 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

    Google Scholar 

  • Beasley, J. 1981. Adapting the Savings Algorithm for Varying Inter-Customer Travel Times. Omega, 9, 658–659

    Article  Google Scholar 

  • Berger, J. and M. Barkaoui. 2003. A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem. In E. Cantó-Paz, editor. Proceedings of the International Genetic and Evolutionary Computation Conference — GECCO03, LNCS 2723, 646–656, Illinois. Chicago, USA. Springer-Verlag

    Google Scholar 

  • Buxey, G.M. 1979. The Vehicle Scheduling Problem and Monte Carlo Simulation. Journal of Operational Research Society, 30, 563–573

    MATH  Google Scholar 

  • Clarke, G. and J. Wright. 1964. Scheduling of Vehicles from a central Depot to a Number of Delivering Points. Operations Research, 12, 568–581

    Article  Google Scholar 

  • Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., and J.S. Sormany. 2004. New Heuristics for the Vehicle Routing Problem. In A. Langevin and D. Riopel, editors, Logistics Systems: Design and Optimization. Kluwer Academic Publishers

    Google Scholar 

  • Dror, M. and P. Trudeau, P. 1986. Stochastic Vehicle Routing with Modified Savings Algorithm. European Journal of Operational Research, 23, 228–235

    Article  MathSciNet  MATH  Google Scholar 

  • Faulin, J. and A. Juan. 2008. The ALGACEA-1 Method for the Capacitated Vehicle Routing Problem. International Transactions in Operational Research, 15, 1–23

    Article  MathSciNet  Google Scholar 

  • Feo, T.A. and M.G.C. Resende. 1995. Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6, 109–133

    Article  MathSciNet  MATH  Google Scholar 

  • Fernández de Córdoba, P., García Raffi, L.M., Mayado, A. and J.M. Sanchis. 2000. A Real Delivery Problem Dealt with Monte Carlo Techniques. TOP, 8, 57–71

    Article  MathSciNet  MATH  Google Scholar 

  • Gaskell, T.J. 1967. Bases for the Vehicle Fleet Scheduling. Operational Research Quarterly, 18, 281–295

    Article  Google Scholar 

  • Gendreau, M., Hertz, A. and G. Laporte. 1994. A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science, 40, 1276–1290

    Article  MATH  Google Scholar 

  • Gendreau, M., Potvin, J.-Y., Bräysy, O., Hasle, G. and Løkketangen, A. 2008. Meta-heuristics for the vehicle routing problem and its extensions: A categorized bibliography. In Bruce, G., Raghavan, S. and Wasil, E., editors, The Vehicle Routing Problem: Latest Advanced and New Challenges. Springer, Dordrecht

    Google Scholar 

  • Gillet, B.E. and L.R. Miller. 1974. A Heuristic Algorithm for the Vehicle Dispatch Problem. Operations Research, 22, 340–349

    Article  Google Scholar 

  • Golden, B., Raghavan, S. and E. Edward Wasil (eds.). 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer

    Google Scholar 

  • Holmes, R.A. and R.G. Parker. 1976. A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme. Operational Research Quarterly, 27, 83–92

    Article  MATH  Google Scholar 

  • Kant, G., Jacks, M. and C. Aantjes. 2008. Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery. Interfaces, 38: 40–50

    Article  Google Scholar 

  • Kytöjoki, J., Nuortio, T., Bräysy, O. and Gendreau, M. 2007. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers and Operations Research, 34: 2743–2757

    Article  MATH  Google Scholar 

  • Laporte, G. 2007. What you should know about the Vehicle Routing Problem. Naval Research Logistics, 54: 811–819

    Article  MathSciNet  MATH  Google Scholar 

  • Laporte, G., Gendreau, M., Potvin, J.Y. and F. Semet. 2000. Classical and Modern Heuristics for the Vehicle Routing Problem. International Transactions in Operational Research, 7, 285–300

    Article  MathSciNet  Google Scholar 

  • Law, A. 2007. Simulation Modeling & Analysis. McGraw-Hill

    Google Scholar 

  • L'Ecuyer, P. 2002. SSJ: A Framework for Stochastic Simulation in Java. In Proceedings of the 2002 Winter Simulation Conference, pp. 234–242

    Google Scholar 

  • Mester, D. and Bräysy, O. 2005. Active guided evolution strategies for the large scale vehicle routing problems with time windows. Computers and Operations Research, 32: 1165–1179

    Article  Google Scholar 

  • Mester, D. and Bräysy, O. 2007. Active-guided evolution strategies for the large-scale capacitated vehicle routing problems. Computers and Operations Research, 34: 2964–2975

    Article  MATH  Google Scholar 

  • Mole, R.H. and S.R. Jameson. 1976. A Sequential Route-building Algorithm Employing a Generalised Savings Criterion. Operational Research Quarterly, Vol. 27, 503–511

    Article  Google Scholar 

  • Mohcine, J., Contassot-Vivier, S. and Couturier, R. (2007). Parallel Iterative Algorithms: From Sequential to Grid Computing. Chapman & Hall/CRC.

    Google Scholar 

  • Nagata, Y. 2007. Edge aseembly crossover for the capacitated vehicle routing problem. In Cotta, C. and van Hemert, J., editors, Lecture Notes in Computer Science, vol 4446. Springer-Verlag, Berlin Heidelberg

    Google Scholar 

  • Paessens, H. 1988. The Savings Algorithm for the Vehicle Routing Problem. European Journal of Operational Research, 34, 336–344

    Article  MATH  Google Scholar 

  • Pisinger, D. and Ropke, S. 2007. A general heuristic for vehicle routing problems. Computers and Operations Research, 34: 2403–2435

    Article  MathSciNet  MATH  Google Scholar 

  • Poot, A., Kant, G. and A Wagelmans. 2002. A savings based method for real-life vehicle routing problems. Journal of the Operational Research Society, 53, 57–68

    Article  MATH  Google Scholar 

  • Prins, C. 2004. A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem. Computers and Operations Research, 31, 1985–2002

    Article  MathSciNet  MATH  Google Scholar 

  • Tarantilis, C.D. and C.T. Kiranoudis. 2002. Boneroute: an Adaptative Memory-Based Method for Effective Fleet Management. Annals of Operations Research, 115, 227–241

    Article  MathSciNet  MATH  Google Scholar 

  • Toth, P. and D. Vigo. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM

    Google Scholar 

  • 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

    Article  MathSciNet  MATH  Google Scholar 

Download references

9 Acknowledgements

This work has been partially financed by the United States Department of Transportation under grant DTOS59-06-00035 and by the Spanish Ministry of Education and Science under grant TRA2006-10639.

Author information

Authors and Affiliations

  1. Dep. of Computer Science and Telecommunication, Open University of Catalonia, Rambla Poblenou, 156, Barcelona, 08018, Spain

    Angel A. Juan, Miquel Gilibert & Xavier Vilajosana

  2. Dep. of Statistics and Operations Research, Public University of Navarre, Campus Arrosadia, Pamplona, 31006, Spain

    Javier Faulin & Barry Barrios

  3. Dep. of Statistics, Applied OR and Quality, Valencia University of Technology, Camino de Vera, s/n, Valencia, 46022, Spain

    Rubén Ruiz

Authors
  1. Angel A. Juan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Faulin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rubén Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Barry Barrios
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Miquel Gilibert
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Xavier Vilajosana
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Systems & Computer Engineering, Carleton University, Ottawa, ON, K1S 5B6, Canada

    John W. Chinneck

  2. Maximal Software, Inc., 2111 Wilson Blvd., Arlington, VA, 22201, USA

    Bjarni Kristjansson

  3. Dept. of Mathematical Sciences College of Engineering and Science, Clemson University, 340975, Clemson, SC, 29634, USA

    Matthew J. Saltzman

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this paper

Cite this paper

Juan, A.A., Faulin, J., Ruiz, R., Barrios, B., Gilibert, M., Vilajosana, X. (2009). Using Oriented Random Search to Provide a Set of Alternative Solutions to the Capacitated Vehicle Routing Problem. In: Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds) Operations Research and Cyber-Infrastructure. Operations Research/Computer Science Interfaces, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88843-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-88843-9_17

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-88842-2

  • Online ISBN: 978-0-387-88843-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation