Advertisement

Annals of Operations Research

, Volume 207, Issue 1, pp 43–65 | Cite as

Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands

  • Angel A. Juan
  • Javier Faulin
  • Josep Jorba
  • Jose Caceres
  • Joan Manuel Marquès
Article

Abstract

This paper focuses on the Vehicle Routing Problem with Stochastic Demands (VRPSD) and discusses how Parallel and Distributed Computing Systems can be employed to efficiently solve the VRPSD. Our approach deals with uncertainty in the customer demands by considering safety stocks, i.e. when designing the routes, part of the vehicle capacity is reserved to deal with potential emergency situations caused by unexpected demands. Thus, for a given VRPSD instance, our algorithm considers different levels of safety stocks. For each of these levels, a different scenario is defined. Then, the algorithm solves each scenario by integrating Monte Carlo simulation inside a heuristic-randomization process. This way, expected variable costs due to route failures can be naturally estimated even when customers’ demands follow a non-normal probability distribution. Use of parallelization strategies is then considered to run multiple instances of the algorithm in a concurrent way. The resulting concurrent solutions are then compared and the one with the minimum total costs is selected. Two numerical experiments allow analyzing the algorithm’s performance under different parallelization schemas.

Keywords

Vehicle routing problem with stochastic demands Parallel and distributed computing Monte Carlo simulation Probabilistic algorithms Heuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amazon (2010). High performance computing using Amazon EC2. Amazon’s technical report. Available at: http://aws.amazon.com/ec2/hpc-applications/. Last access 19 March 2011.
  2. Anderson, D. (2004). BOINC: a system for public-resource computing and storage. In Proceedings of the 5th IEEE/ACM international workshop on grid computing (pp. 4–10). CrossRefGoogle Scholar
  3. Armbrust, M., Fox, A., Griffith, R., Joseph, A., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., & Zaharia, M. (2009). Above the clouds: a Berkeley view of cloud computing. Technical Report No. UCB/EECS-2009-28. Available at: http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-28.html. Last access 15 September 2010.
  4. Armbrust, M., Fox, A., Griffith, R., Joseph, A., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., & Zaharia, M. (2010). A view of cloud computing. Communications of the ACM, 53(4), 50–58. CrossRefGoogle Scholar
  5. Balaprakash, P., Birattari, M., Stützle, T., & Dorigo, M. (2010). Estimation-based metaheuristics for the probabilitic travelling salesman problem. Computers and Operations Research, 37, 1939–1951. CrossRefGoogle Scholar
  6. Bastian, C., & Rinnooy Kan, A. (1992). The stochastic vehicle routing problem revisited. European Journal of Operational Research, 56, 407–412. CrossRefGoogle Scholar
  7. Bent, R., & Van Hentenryck, P. (2004). Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research, 52(6), 1526–1563. CrossRefGoogle Scholar
  8. Bent, R., & Van Hentenryck, P. (2007). Waiting and relocation strategies in online stochastic vehicle routing. In Proceedings of the twentieth international joint conference on artificial intelligence (pp. 1816–1821). Google Scholar
  9. Berger, J., & Barkaoui, M. (2004). A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 31(12), 2037–2053. CrossRefGoogle Scholar
  10. Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O., & Schiavinotto, T. (2006). Hybrid metaheuristics for the vehicle routing problem with stochastic demands. Journal of Mathematical Modelling and Algorithms, 5, 91–110. CrossRefGoogle Scholar
  11. Bianchi, L., Dorigo, M., Gambardella, L., & Gutjahr, W. (2009). A survey on metaheuristics for stochastic combinatorial optimization. Natural Computing: an International Journal, 8(2), 239–287. CrossRefGoogle Scholar
  12. Bouthillier, A., & Crainic, T. (2005). A cooperative parallel metaheuristic for the vehicle routing problem with time windows. Computers and Operations Research, 32(7), 1685–1708. CrossRefGoogle Scholar
  13. Clarke, G., & Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivering points. Operations Research, 12, 568–581. CrossRefGoogle Scholar
  14. Crainic, T. (2008). Parallel solution methods for vehicle routing problems. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem—latest advances and new challenges. Berlin: Springer. Google Scholar
  15. Eksioglu, B., Volkan, A., & Reisman, A. (2009). The vehicle routing problem: a taxonomic review. Computers & Industrial Engineering, 57(4), 1472–1483. CrossRefGoogle Scholar
  16. Gendreau, M., Laporte, G., & Séguin, R. (1996a). A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research, 44(3), 469–477. CrossRefGoogle Scholar
  17. Gendreau, M., Laporte, G., & Séguin, R. (1996b). Stochastic vehicle routing. European Journal of Operational Research, 88(3), 3–12. CrossRefGoogle Scholar
  18. Ghiani, G., Guerriero, F., & Laporte, G. (2003). Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research, 151(1), 1–11. CrossRefGoogle Scholar
  19. Golden, B., Raghavan, S., & Wasil, E. (Eds.) (2008). The vehicle routing problem: latest advances and new challenges. New York: Springer. Google Scholar
  20. Hemmelmayr, V., Doerner, K., Hartl, R., & Savelsbergh, M. (2010). Vendor managed inventory for environments with stochastic product usage. European Journal of Operational Research, 202, 686–695. CrossRefGoogle Scholar
  21. Jézéquel, A. (1985). Probabilistic vehicle routing problems. MSc dissertation. Department of Civil Engineering. Massachussets Institute of Technology, Cambridge, MA. Google Scholar
  22. Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., & Barrios, B. (2011a). On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics. Journal of the Operational Research Society, 62(6), 1085–1097. CrossRefGoogle Scholar
  23. Juan, A., Faulin, J., Grasman, S., Riera, D., Marull, J., & Mendez, C. (2011b). Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transportation Research Part C, 19(5), 751–765. CrossRefGoogle Scholar
  24. Kirk, D., & Hwu, W. (2010). Programming massively parallel processors. A hands-on approach. San Mateo: Morgan Kaufmann. Google Scholar
  25. L’Ecuyer, P., & Buist, E. (2005). Simulation in Java with SSJ. In Proceedings of 2005 winter simulation conference (pp. 611–620). CrossRefGoogle Scholar
  26. Laporte, G. (2007). What you should know about the Vehicle Routing Problem. Naval Research Logistics, 54, 811–819. CrossRefGoogle Scholar
  27. Marques, J. M., Vilajosana, X., Daradoumis, T., & Navarro, L. (2007). LaCOLLA: middleware for self-sufficient online collaboration. IEEE Internet Computing, 11(2), 56–64. CrossRefGoogle Scholar
  28. Madhu, K., & Saxena, S. (1998). Parallel algorithms for vehicle routing problems. In Proceedings of 5th international conference on high performance computing (pp. 171–178). Google Scholar
  29. Mitra, S. (2008). A parallel clustering technique for the vehicle routing problem with split deliveries and pickups. Journal of the Operational Research Society, 59(11), 1532–1546. CrossRefGoogle Scholar
  30. Novoa, C., & Storer, R. (2009). An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research, 196, 509–515. CrossRefGoogle Scholar
  31. Protonotarios, M., Mourkousis, G., Vyridis, I., & Varvarigou, T. (2000). Very large scale vehicle routing with time windows and stochastic demand using genetic algorithms with parallel fitness evaluation. In Proceedings of 8th international conference on high performance computing and networking (pp. 467–476). CrossRefGoogle Scholar
  32. Rego, C. (2001). Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Computing, 27(3), 201–222. CrossRefGoogle Scholar
  33. Sanders, J., & Kandrot, E. (2010). CUDA by example: an introduction to general-purpose GPU programming. Reading: Addison-Wesley. Google Scholar
  34. Subramanian, A., Drummonda, L., Bentesb, C., Ochia, L., & Farias, R. (2010). A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 37(11), 1899–1911. CrossRefGoogle Scholar
  35. Sungur, I., Ordóñez, F., & Dessourky, M. (2008). A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Transactions, 40, 509–523. CrossRefGoogle Scholar
  36. Talbi, E. (Ed.) (2006). Parallel combinatorial optimization. New York: Wiley. Google Scholar
  37. Talbi, E. (Ed.) (2009). Metaheuristics. From design to implementation. New York: Wiley. Google Scholar
  38. Tan, K., Cheong, C., & Goh, C. (2007). Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. European Journal of Operational Research, 177, 813–839. CrossRefGoogle Scholar
  39. Van Hentenryck, P., & Bent, R. (2010). Online stochastic combinatorial optimization. Boston: MIT Press. Google Scholar
  40. Verweij, B., Ahmed, S., Kleywegt, A., Nemhauser, G., & Shapiro, A. (2003). The sample average approximation method applied to stochastic routing problems: a computational study. Computational Optimization and Applications, 24, 289–333. CrossRefGoogle Scholar
  41. Walker, E. (2008). Benchmarking Amazon EC2 for high-performance scientific computing. LOGIN, 33(5), 18–23. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Angel A. Juan
    • 1
  • Javier Faulin
    • 2
  • Josep Jorba
    • 1
  • Jose Caceres
    • 1
  • Joan Manuel Marquès
    • 1
  1. 1.Department of Computer Science, Multimedia, and TelecommunicationOpen University of CataloniaBarcelonaSpain
  2. 2.Department of Statistics and ORPublic University of NavarrePamplonaSpain

Personalised recommendations