Bridging the Gap Between Theory and Practice in the Vehicle Routing Research

Abstract

Research studying effective planning and optimization in the vehicle routing field has increased tremendously in the last few decades. Advances in technology and computational power have encouraged researchers to consider various vehicle routing problem types and constraints, and to experiment with new algorithmic techniques that can be applied for the automation of vehicle planning. Despite this, research in the vehicle routing domain is often accused of being too idealistic. Given the difficulty of solving vehicle routing problems, many simplifying assumption are being incorporated into problem solving techniques, in order to make the solution approach more manageable. In this paper we discuss some real life constraints that the research community should be aware of when addressing vehicle routing problems. We highlight how theoretical research in this area can be integrated into commercially applicable software. An overview of future trends in scientific research tackling this issue is also provided. This paper tries to give an insight into how developing richer vehicle routing models can help in realistic settings to improve logistic planning.

Keywords

• Vehicle Routing; Intelligent Systems; Intelligent Transportation Systems; Decision Support Systems; Optimization.

Original Research Paper

Öz

References

1. “Roadmap to a single European transport area -towards a competitive and resource efficient transport system,” Europian Commission- Mobility & Transport,” European Commission White Paper, 2011.
2. A. Hoff, H. Andersson, M. Christiansen, G. Hasle, and A. Løkketangen, “Industrial aspects and literature survey: Fleet composition and routing,” SINTEF, Tech. Rep. A7029, 2008.
3. R. Hall and J. Partyka, “On the road to mobility – 2008 survey of vehicle routing software spotlights critical supply chain management role,” ORMS TODAY, Feb. 2008.
4. B. Eksioglu, A. V. Vural, and A. Reisman, "The vehicle routing problem: A taxonomic review," Computers & Industrial Engineering, vol. 57, pp. 1472-1483, 2009.
5. G. B. Dantzig and D. R. Fulkerson, "Minimizing the number of tankers to meet a fixed schedule," Naval Research Logistics Quarterly, vol. 1, pp. 217-222, 1954.
6. G. B. Dantzig and J. H. Ramser, "The Truck Dispatching Problem," Management Science, vol. 6, pp. 80-91, 1959.
7. G. Hasle, K.-A. Lie, and E. Quak, "Geometric Modelling, Numerical Simulation, and Optimization," ed: Springer, 2007, pp. 397–435.
8. R. Hall, "On the road to integration," OR MS TODAY, vol. 33, p. 50, 2006.

9. G. u. Clarke and J. W. Wright, "Scheduling of vehicles from a central depot to a number of delivery points," Operations Research, vol. 12, pp. 568-581, 1964.
10. M. M. Solomon, "Algorithms for the vehicle routing and scheduling problems with time window constraints," Operations Research, vol. 35, pp. 254-265, 1987.
11. J.-Y. Potvin and J.-M. Rousseau, "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows," European Journal of Operational Research, vol. 66, pp. 331-340, 1993.
12. S. Lin, "Computer solutions of the traveling salesman problem," Bell System Technical Journal, vol. 44, pp. 2245-2269, 1965.
13. P. Hansen and N. Mladenović, "Variable neighborhood search: Principles and applications," European Journal of Operational Research, vol. 130, pp. 449-467, 2001.
14. Bräysy and M. Gendreau, "Vehicle routing problem with time windows, part I: Route construction and local search algorithms," Transportation Science, vol. 39, pp. 104-118, 2005.
15. S. Ropke and D. Pisinger, "An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows," Transportation Science, vol. 40, pp. 455-472, 2006.
16. “Vehicle routing software survey,” ORMS TODAY, vol. 39, no.1, Feb. 2012.