Algorithms for the Hybrid Fleet Vehicle Routing Problem

Fei Peng, Amy M. Cohn, Oleg Gusikhin, David Perner

Abstract

In the classical Vehicle Routing Problem (VRP) literature, as well as in most VRP commercial software packages, it is commonly assumed that all vehicles are identical in their characteristics. In real-world problems however, this is often not true. In many cases, fleets are made up of different vehicle types, which may vary by size, engine/fuel type, and other performance-impacting factors. Even in a homogeneous fleet, vehicles often differ by age and condition, which can greatly impact performance. Our research was specifically motivated by cases where the fleet contains vehicles that not only vary in performance, but this variation is a function of the arc type, such that a given vehicle might have lower cost on some arcs but higher cost on others. We refer to this as the Hybrid Fleet Vehicle Routing Problem (HFVRP). We propose two heuristic methods that take into account the vehicle-specific cost structures. We provide computational results to demonstrate the quality of our solutions, as well as a comparison with a Genetic Algorithm (GA) based method seen in the literature.

References

  1. Armacost, A., Barnhart, C., , and Ware, K. (2002). Composite variable formulations for express shipment service network design. Transportation Science, 35(1).
  2. Baker, B. and Ayechew, M. (2003). A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 30(5):787-800.
  3. Baldacci, R., Bartolini, E., and Laporte, G. (2010). Some applications of the generalized vehicle routing problem. Journal of the Operational Research Society, 61:1072-1077.
  4. Baldacci, R., Battarra, M., and Vigo, D. (2008). Routing a heterogeneous fleet of vehicles. The Vehicle Routing Problem: Latest Advances and New Challenges, 43:3-27.
  5. Baldacci, R. and Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming, Series A, (120):347-380.
  6. Barlatt, A., Cohn, A., Fradkin, Y., Gusikhin, O., and Morford, C. (2009). Using composite variable modeling to achieve realism and tractability in production planning: An example from automotive stamping. IIE Transactions, 41(5):421-436.
  7. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W., and Vance, P. H. (1998). Branch-andprice: Column generation for solving huge integer programs. Operations research, 46(3):316-329.
  8. Campos, V. and Mota, E. (2000). Heuristic procedures for the capacitated vehicle routing problem. Computational Optimization and Applications, 16:265-277.
  9. Choi, E. and Tcha, D.-W. (2007). A column generation approach to the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34:2080- 2095.
  10. Clark, G. and Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4):568-581.
  11. Dantzig, G. B. and Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1):80.
  12. de Oliveira, H. C. B. and Vasconcelos, G. C. (2010). A hybrid search method for the vehicle routing problem with time windows. Ann Oper Res, 180:125-144.
  13. Desrochers, M. and Verhoog, T. W. (1991). A new heuristic for the fleet size and mix vehicle routing problem. Computers and Operations Research, 18(3):263-274.
  14. Golden, B., Addad, A., Levy, L., and Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers and Operations Research, 11(1):49-66.
  15. Gusikhin, O., MacNeille, P., and Cohn, A. (2010). Vehicle routing to minimize mixed-fleet fuel consumption and environmental impact. In Proceedings of 7th International Conference on Informatics in Control, Automation and Robotics, volume 1, pages 285-291, Funchal, Madeira -Portugal.
  16. Hasle, G. and Kloster, O. (2007). Industrial vehicle routing. Geometric Modelling, Numerical Simulation, and Optimization, pages 397-435.
  17. Holland, J. (1975). Adaptation in natural and artificial systems, university of michigan press. Ann Arbor, MI, 1(97):5.
  18. Kim, B.-I., Kim, S., and Sahoo, S. (2006). Waste collection vehicle routing problem with time windows. Computers and Operations Research, 33:3624-3642.
  19. Kolmanovsky, I., McDonough, K., and Gusikhin, O. (2011). Estimation of fuel flow for telematics-enabled adaptive fuel and time efficient vehicle routing. In Proceeding of 11th IEEE International Conference on Intelligent Transportation Systems Telecommunications, pages 139-144, St. Petersburg, Russia.
  20. Kritikos, M. N. and Ioannou, G. (2010). The balanced cargo vehicle routing problem with time windows. International Journal of Production Economics, 123(1):42- 51.
  21. Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4):408-416.
  22. Li, F., Golden, B., and Wasil, E. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34:2734-2742.
  23. Li, X., Tian, P., and Leung, S. C. (2010). Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. International Journal of Production Economics, 125(1):137-145.
  24. Lin, S. et al. (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44(10):2245-2269.
  25. Novoa, C. and Storer, R. (2009). An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operations Research, 196:509-515.
  26. Ochi, L. S., Vianna, D. S., Drummond, L. M. A., and Victor, A. O. (1998). An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet. Lecture Notes in Computer Science, 1391:187-195.
  27. Ralphs, T. K., Kopman, L., Pulleyblank, W. R., and Trotter, L. E. (2003). On the capacitated vehicle routing problem. Mathematical Programming, 94:343-359.
  28. Salhi, S. and Rand, G. K. (1993). Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operations Research, 66:313- 330.
  29. Tahmassebi, T. (1999). Vehicle routing problem (vrp) formulation for continuous-time packing hall design/operations. Computers and Chemical Engineering Supplement, S:1011-1014.
  30. Taillard, Ó. D. (1999). A heuristic column generation method for the heterogeneous fleet vrp. Operations Research - Recherche opérationnelle, 33(1):1-14.
  31. Tarantilis, C., Zachariadis, E., and Kiranoudis, C. (2008). A guided tabu search for the heterogeneous vehicle routing problem. Journal of the Operations Reserach Society, 59:1659-1673.
  32. Toth, P. and Vigo, D., editors (2001). The Vehicle Routing Problem. Society for Industrial and Applied Mathematics (SIAM).
  33. Wassan, N. and Osman, I. (2002). Tabu serach variants for the mix fleet vehicle routing problem. Journal of the Operations Reserach Society, 53:768-782.
Download


Paper Citation


in Harvard Style

Peng F., M. Cohn A., Gusikhin O. and Perner D. (2015). Algorithms for the Hybrid Fleet Vehicle Routing Problem . In Proceedings of the 1st International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS, ISBN 978-989-758-109-0, pages 69-77. DOI: 10.5220/0005422600690077


in Bibtex Style

@conference{vehits15,
author={Fei Peng and Amy M. Cohn and Oleg Gusikhin and David Perner},
title={Algorithms for the Hybrid Fleet Vehicle Routing Problem},
booktitle={Proceedings of the 1st International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS,},
year={2015},
pages={69-77},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005422600690077},
isbn={978-989-758-109-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Vehicle Technology and Intelligent Transport Systems - Volume 1: VEHITS,
TI - Algorithms for the Hybrid Fleet Vehicle Routing Problem
SN - 978-989-758-109-0
AU - Peng F.
AU - M. Cohn A.
AU - Gusikhin O.
AU - Perner D.
PY - 2015
SP - 69
EP - 77
DO - 10.5220/0005422600690077