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

Column Generation for a Multitrip Vehicle Routing Problem with Time Windows, Driver Work Hours, and Heterogeneous Fleet

Department of Naval Architecture and Ocean Engineering, University of São Paulo, Avenida Professor Mello Moraes 2231, 05508-030 São Paulo, SP, Brazil

Received 3 December 2012; Revised 29 January 2013; Accepted 4 February 2013

Academic Editor: Rubén Ruiz García

Copyright © 2013 Michel Povlovitsch Seixas and André Bergsten Mendes. 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. R. H. Ballou, Business Logistics/Supply Chain Management, Prentice-Hall, Englewood Cliffs, NJ, USA, 5th edition, 2004.
  2. M. M. Solomon and J. Desrosiers, “Time window constrained routing and scheduling problems,” Transportation Science, vol. 22, no. 1, pp. 1–13, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. M. Desrochers, J. K. Lenstra, M. W. P. Savelsbergh, and F. Soumis, “Vehicle routing with time windows: optimization and approximation,” in Vehicle Routing: Methods and Studies, B. L. Golden and A. A. Assad, Eds., vol. 16 of Studies in Management Science and Systems, pp. 65–84, North-Holland, Amsterdam, The Netherlands, 1988. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. M. Desrochers, J. Desrosiers, and M. Solomon, “A new optimization algorithm for the vehicle routing problem with time windows,” Operations Research, vol. 40, no. 2, pp. 342–354, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. É. D. Taillard, G. Laporte, and M. Gendreau, “Vehicle routeing with multiple use of vehicles,” Journal of the Operational Research Society, vol. 47, no. 8, pp. 1065–1070, 1996. View at Google Scholar · View at Scopus
  6. J. C. S. Brandão and A. Mercer, “The multi-trip vehicle routing problem,” Journal of the Operational Research Society, vol. 49, pp. 799–805, 1998. View at Google Scholar
  7. A. Olivera and O. Viera, “Adaptive memory programming for the vehicle routing problem with multiple trips,” Computers & Operations Research, vol. 34, no. 1, pp. 28–47, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. R. J. Petch and S. Salhi, “A multi-phase constructive heuristic for the vehicle routing problem with multiple trips,” Discrete Applied Mathematics, vol. 133, no. 1–3, pp. 69–92, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. S. Salhi and R. J. Petch, “A GA based heuristic for the vehicle routing problem with multiple trips,” Journal of Mathematical Modelling and Algorithms, vol. 6, no. 4, pp. 591–613, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. N. Azi, M. Gendreau, and J.-Y. Potvin, “An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles,” European Journal of Operational Research, vol. 202, no. 3, pp. 756–763, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. N. Azi, M. Gendreau, and J.-Y. Potvin, “An exact algorithm for a single-vehicle routing problem with time windows and multiple routes,” European Journal of Operational Research, vol. 178, no. 3, pp. 755–766, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. J. F. Cordeau, G. Laporte, and A. Mercier, “A unified tabu search heuristic for vehicle routing problems with time windows,” Journal of the Operational Research Society, vol. 52, no. 8, pp. 928–936, 2001. View at Publisher · View at Google Scholar · View at Scopus
  13. J. F. Cordeau and G. Laporte, “A tabu search heuristic for the static multi-vehicle dial-a-ride problem,” Transportation Research B: Methodological, vol. 37, no. 6, pp. 579–594, 2003. View at Publisher · View at Google Scholar · View at Scopus
  14. A. Ceselli, G. Righini, and M. Salani, “A column generation algorithm for a rich vehicle-routing problem,” Transportation Science, vol. 43, no. 1, pp. 56–69, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, “An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems,” Networks, vol. 44, no. 3, pp. 216–229, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. J. K. Lenstra and A. H. G. Rinnooy Kan, “Complexity of the vehicle routing and scheduling problems,” Networks, vol. 11, no. 2, pp. 221–227, 1981. View at Google Scholar · View at Scopus
  17. O. Bräsy and M. Gendreau, “Vehicle routing with time windows, part II: metaheuristics,” Transportation Science, vol. 39, pp. 119–139, 2005. View at Publisher · View at Google Scholar
  18. M. E. Lübbecke and J. Desrosiers, “Selected topics in column generation,” Operations Research, vol. 53, no. 6, pp. 1007–1023, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. J. Desrosiers and M. E. Lübbecke, “A primer in column generation,” in Column Generation, G. Desaulniers, J. Desrosiers, and M. M. Solomon, Eds., GERAD 25th Anniversary Series, chapter 1, Springer, New York, NY, USA, 2005. View at Google Scholar
  20. L.-M. Rousseau, M. Gendreau, and D. Feillet, “Interior point stabilization for column generation,” Operations Research Letters, vol. 35, no. 5, pp. 660–668, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. O. du Merle, D. Villeneuve, J. Desrosiers, and P. Hansen, “Stabilized column generation,” Discrete Mathematics, vol. 194, no. 1–3, pp. 229–237, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. R. E. Marsten, W. W. Hogan, and J. W. Blankenship, “The BOXSTEP method for large-scale optimization,” Operations Research, vol. 23, no. 3, pp. 389–405, 1975. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. S. Kim, K.-N. Chang, and J.-Y. Lee, “A descent method with linear programming subproblems for nondifferentiable convex optimization,” Mathematical Programming, vol. 71, no. 1, pp. 17–28, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis, “Time constrained routing and scheduling,” in Network Routing, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, Eds., vol. 8 of Handbooks in Operations Research and Management Science, pp. 35–139, North-Holland, Amsterdam, The Netherlands, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. G. Desaulniers, J. Lavigne, and F. Soumis, “Multi-depot vehicle scheduling problems with time windows and waiting costs,” European Journal of Operational Research, vol. 111, no. 3, pp. 479–494, 1998. View at Google Scholar · View at Scopus
  26. G. Desaulniers and D. Villeneuve, “Shortest path problem with time windows and linear waiting costs,” Transportation Science, vol. 34, no. 3, pp. 312–319, 2000. View at Google Scholar · View at Scopus
  27. G. Righini and M. Salani, “Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints,” Discrete Optimization, vol. 3, no. 3, pp. 255–273, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. G. Righini and M. Salani, “New dynamic programming algorithms for the resource constrained elementary shortest path problem,” Networks, vol. 51, no. 3, pp. 155–170, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. M. Desrochers and F. Soumis, “A generalized permanent labelling algorithm for the shortest path problem with time windows,” Information Systems Research, vol. 26, pp. 193–214, 1988. View at Google Scholar
  30. N. Christofides, A. Mingozzi, and P. Toth, “State-space relaxation procedures for the computation of bounds to routing problems,” Networks, vol. 11, no. 2, pp. 145–164, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet