Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2008, Article ID 571414, 16 pages
http://dx.doi.org/10.1155/2008/571414
Research Article

A Solution Approach from an Analytic Model to Heuristic Algorithm for Special Case of Vehicle Routing Problem with Stochastic Demands

1Department of Industrial Engineering, Ataturk University, 25240 Erzurum, Turkey
2Department of Industrial Engineering, Gazi University, Maltepe, 06570 Ankara, Turkey

Received 18 August 2008; Accepted 11 December 2008

Academic Editor: Irina Trendafilova

Copyright © 2008 Selçuk K. İşleyen and Ö. Faruk Baykoç. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. G. Laporte and I. H. Osman, “Routing problems: a bibliography,” Annals of Operations Research, vol. 61, no. 1, pp. 227–262, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. P. Toth and D. Vigo, “Models, relaxations and exact approaches for the capacitated vehicle routing problem,” Discrete Applied Mathematics, vol. 123, no. 1–3, pp. 487–512, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. G. Laporte, M. Gendreau, J.-Y. Potvin, and F. Semet, “Classical and modern heuristics for the vehicle routing problem,” International Transactions in Operational Research, vol. 7, no. 4-5, pp. 285–300, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  4. C. D. Tarantilis, G. Ioannou, and G. Prastacos, “Advanced vehicle routing algorithms for complex operations management problems,” Journal of Food Engineering, vol. 70, no. 3, pp. 455–471, 2005. View at Publisher · View at Google Scholar
  5. M. Gendreau, G. Laporte, and R. Séguin, “Stochastic vehicle routing,” European Journal of Operational Research, vol. 88, no. 1, pp. 3–12, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. M. Dror, M. Ball, and B. Golden, “A computational comparison of algorithms for the inventory routing problem,” Annals of Operations Research, vol. 4, no. 1–4, pp. 3–23, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  7. V. Lambert, G. Laporte, and F. Louveaux, “Designing collection routes through bank branches,” Computers & Operations Research, vol. 20, no. 7, pp. 783–791, 1993. View at Publisher · View at Google Scholar
  8. R. C. Larson, “Transporting sludge to the 106-mile site: an inventory/routing model for fleet sizing and logistics system design,” Transportation Science, vol. 22, no. 3, pp. 186–198, 1988. View at Publisher · View at Google Scholar
  9. K. C. Tan, C. Y. Cheong, and C. K. Goh, “Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation,” European Journal of Operational Research, vol. 177, no. 2, pp. 813–839, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. D. Bertsimas, P. Chervi, and M. Peterson, “Computational approaches to stochastic vehicle routing problems,” Transportation Science, vol. 29, no. 4, pp. 342–352, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. W.-H. Yang, K. Mathur, and R. H. Ballou, “Stochastic vehicle routing problem with restocking,” Transportation Science, vol. 34, no. 1, pp. 99–112, 2000. View at Google Scholar · View at Zentralblatt MATH
  12. L. Bianchi, M. Birattari, M. Chiarandini et al., “Hybrid metaheuristics for the vehicle routing problem with stochastic demands,” Journal of Mathematical Modelling and Algorithms, vol. 5, no. 1, pp. 91–110, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. N. Secomandi, “Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands,” Computers & Operations Research, vol. 27, no. 11-12, pp. 1201–1225, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. N. Secomandi, “A rollout policy for the vehicle routing problem with stochastic demands,” Operations Research, vol. 49, no. 5, pp. 796–802, 2001. View at Publisher · View at Google Scholar
  15. M. Gendreau, G. Laporte, and R. Séguin, “An exact algorithm for the vehicle routing problem with stochastic demands and customers,” Transportation Sciences, vol. 29, no. 2, pp. 143–155, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. M. Gendreau, G. Laporte, and R. Séguin, “A tabu search heuristic for the vehicle routing problem with stochastic demands and customers,” Operations Research, vol. 44, no. 3, pp. 469–477, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. D. Teodorović and G. Pavković, “A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand,” Transportation Planning and Technology, vol. 16, no. 4, pp. 261–273, 1992. View at Publisher · View at Google Scholar
  18. S. K. Isleyen and O. F. Baykoc, “An efficiently novel model for vehicle routing problems with stochastic demands,” Asia-Pacific Journal of Operational Research. In press.
  19. M. Dror and P. Trudeau, “Stochastic vehicle routing with modified savings algorithm,” European Journal of Operational Research, vol. 23, no. 2, pp. 228–235, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. D. J. Bertsimas and D. Simchi-Levi, “A new generation of vehicle routing research: robust algorithms, addressing uncertainty,” Operations Research, vol. 44, no. 2, pp. 286–304, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. A. S. Kenyon and D. P. Morton, “A survey on stochastic location and routing problems,” Central European Journal of Operations Research, vol. 9, no. 4, pp. 277–328, 2001. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. O. Martin, S. W. Otto, and E. W. Felten, “Large-step Markov chains for the TSP incorporating local search heuristics,” Operations Research Letters, vol. 11, no. 4, pp. 219–224, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. H. R. Lourenço, O. C. Martin, and T. Stützle, “A beginner's introduction to iterated local search,” in Proceedings of the 4th Metaheuristics International Conference (MIC '01), vol. 2, pp. 545–550, Porto, Portugal, July 2001.
  24. R. K. Congram, C. N. Potts, and S. L. van de Velde, “An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem,” INFORMS Journal on Computing, vol. 14, no. 1, pp. 52–67, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  25. T. Stützle, “Applying iterated local search to the permutation flow shop problem,” FG Intellektik, TU Darmstadt, Darmstadt, Germany, 1998. View at Google Scholar
  26. Y. Yang, S. Kreipl, and M. Pinedo, “Heuristics for minimizing total weighted tardiness in flexible flow shops,” Journal of Scheduling, vol. 3, no. 2, pp. 89–108, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. E. Balas and A. Vazacopoulos, “Guided local search with shifting bottleneck for job shop scheduling,” Management Science, vol. 44, no. 2, pp. 262–275, 1998. View at Google Scholar · View at Zentralblatt MATH
  28. T. Stützle, “Iterated local search for the quadratic assignment problem,” European Journal of Operational Research, vol. 174, no. 3, pp. 1519–1539, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. H. R. Lourenço, O. C. Martin, and T. Stützle, “Iterated local search,” in Handbook of Metaheuristics, vol. 57 of International Series in Operations Research & Management Science, pp. 321–353, Kluwer Academic Publishers, Boston, Mass, USA, 2003. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. L. Bianchi, J. Knowles, and N. Bowler, “Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms,” European Journal of Operational Research, vol. 162, no. 1, pp. 206–219, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet