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

Robust Optimisation Approach for Vehicle Routing Problems with Uncertainty

1School of Mechatronics Engineering and Automation, Shanghai University, Shanghai 200072, China
2School of Transportation and Vehicle Engineering, Shandong University of Technology, Zibo 255049, China

Received 15 November 2014; Accepted 19 March 2015

Academic Editor: Babak Shotorban

Copyright © 2015 Liang Sun and Bing Wang. 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. T.-M. Choi, K. Govindan, and L. Ma, “Logistics systems optimization under competition,” Mathematical Problems in Engineering, vol. 2015, Article ID 106142, 3 pages, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  2. X. Duan, S. Song, and J. Zhao, “Emergency vehicle dispatching and redistribution in highway network based on bilevel programming,” Mathematical Problems in Engineering, vol. 2015, Article ID 731492, 12 pages, 2015. View at Publisher · View at Google Scholar
  3. L. Berbotto, S. Garcia, and F. J. Nogales, “A randomized granular tabu search heuristic for the split delivery vehicle routing problem,” Annals of Operations Research, vol. 222, no. 1, pp. 153–173, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. C. Archetti, M. G. Speranza, and A. Hertz, “A tabu search algorithm for the split delivery vehicle routing problem,” Transportation Science, vol. 40, no. 1, pp. 64–73, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Chen, B. Golden, and E. Wasil, “The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results,” Networks, vol. 49, no. 4, pp. 318–329, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. J. C. Goodson, J. W. Ohlmann, and B. . Thomas, “Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand,” European Journal of Operational Research, vol. 217, no. 2, pp. 312–323, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. C. Novoa and R. Storer, “An approximate dynamic programming approach for the vehicle routing problem with stochastic demands,” European Journal of Operational Research, vol. 196, no. 2, pp. 509–515, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. A. L. Erera, J. C. Morales, and M. Savelsbergh, “The vehicle routing problem with stochastic demand and duration constraints,” Transportation Science, vol. 44, no. 4, pp. 474–492, 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. I. Sungur, F. Ordóñez, and M. Dessouky, “A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty,” IIE Transactions, vol. 40, no. 5, pp. 509–523, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. G. F. List, B. Wood, L. K. Nozick et al., “Robust optimization for fleet planning under uncertainty,” Transportation Research Part E: Logistics and Transportation Review, vol. 39, no. 3, pp. 209–227, 2003. View at Publisher · View at Google Scholar · View at Scopus
  11. R. Montemanni, J. Barta, M. Mastrolilli, and L. M. Gambardella, “The robust traveling salesman problem with interval data,” Transportation Science, vol. 41, no. 3, pp. 366–381, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. C. E. Gounaris, W. Wiesemann, and C. A. Floudas, “The robust capacitated vehicle routing problem under demand uncertainty,” Operations Research, vol. 61, no. 3, pp. 677–693, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. C. Lee, K. Lee, and S. Park, “Robust vehicle routing problem with deadlines and travel time/demand uncertainty,” Journal of the Operational Research Society, vol. 63, no. 9, pp. 1294–1306, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. J. M. Mulvey, R. J. Vanderbei, and S. A. Zenios, “Robust optimization of large-scale systems,” Operations Research, vol. 43, no. 2, pp. 264–281, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  15. T. Yao, S. R. Mandala, and B. D. Chung, “Evacuation transportation planning under uncertainty: a robust optimization approach,” Networks and Spatial Economics, vol. 9, no. 2, pp. 171–189, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. A. L. Erera, J. C. Morales, and M. Savelsbergh, “Robust optimization for empty repositioning problems,” Operations Research, vol. 57, no. 2, pp. 468–483, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. B. D. Chung, Robust and dynamic models for supply chain and transportation networks [Ph.D. dissertation], The Pennsylvania State University, 2010.
  18. B. D. Chung, T. Yao, C. Xie, and A. Thorsen, “Robust optimization model for a dynamic network design problem under demand uncertainty,” Networks and Spatial Economics, vol. 11, no. 2, pp. 371–389, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. M. Najafi, K. Eshghi, and W. Dullaert, “A multi-objective robust optimization model for logistics planning in the earthquake response phase,” Transportation Research Part E: Logistics and Transportation Review, vol. 49, no. 1, pp. 217–249, 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Agra, M. Christiansen, R. Figueiredo, L. M. Hvattum, M. Poss, and C. Requejo, “The robust vehicle routing problem with time windows,” Computers & Operations Research, vol. 40, no. 3, pp. 856–866, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. J. M. Mulvey and A. Ruszczyński, “A new scenario decomposition method for large-scale stochastic optimization,” Operations Research, vol. 43, no. 3, pp. 477–490, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  22. M. Naumann, L. Suhl, and S. Kramkowski, “A stochastic programming approach for robust vehicle scheduling in public bus transport,” Procedia—Social and Behavioral Sciences, vol. 20, pp. 826–835, 2011. View at Publisher · View at Google Scholar
  23. S. Yan and C.-H. Tang, “An integrated framework for intercity bus scheduling under stochastic bus travel times,” Transportation Science, vol. 42, no. 3, pp. 318–335, 2008. View at Publisher · View at Google Scholar · View at Scopus
  24. S. Yang, S. Rui, and H. Shiwe, “Robust optimization for transit timetable design under stochastic demands,” System Engineering Theory and Practice, vol. 31, no. 5, pp. 986–992, 2011. View at Google Scholar · View at Scopus
  25. H. Markowitz, “Portfolio selection,” The Journal of Finance, vol. 7, no. 1, pp. 77–91, 1952. View at Publisher · View at Google Scholar
  26. Y. Yan, Q. Meng, S. Wang, and X. Guo, “Robust optimization model of schedule design for a fixed bus route,” Transportation Research Part C: Emerging Technologies, vol. 25, pp. 113–121, 2012. View at Publisher · View at Google Scholar · View at Scopus
  27. I. Sungur, Y. Ren, F. Ordóñez, M. Dessouky, and H. Zhong, “A model and algorithm for the courier delivery problem with uncertainty,” Transportation Science, vol. 44, no. 2, pp. 193–205, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. L. Sun and X. Y. Wang, “A robust optimization model based on conditional expectation for vehicle routing problem with stochastic demands,” International Journal of Applied Mathematics and Statistics, vol. 41, no. 11, pp. 157–162, 2013. View at Google Scholar · View at Scopus
  29. H. Nazif and L. S. Lee, “Optimised crossover genetic algorithm for capacitated vehicle routing problem,” Applied Mathematical Modelling, vol. 36, no. 5, pp. 2110–2117, 2012. View at Publisher · View at Google Scholar · View at Scopus