Abstract
This paper proposes a new cost function based on distance and load of the vehicle for the Capacitated Vehicle Routing Problem. The vehicle-routing problem with this new load-based cost objective is called the Energy Minimizing Vehicle Routing Problem (EMVRP). Integer linear programming formulations with O(n 2) binary variables and O(n 2) constraints are developed for the collection and delivery cases, separately. The proposed models are tested and illustrated by classical Capacitated Vehicle Routing Problem (CVRP) instances from the literature using CPLEX 8.0.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research 52, 723–738 (2004)
Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L.: Handbooks in Operations Research and Management Science: Network routing. North-Holland, Amsterdam (1995)
Bianco, L., Mingozzi, A., Ricciardelli, S.: The traveling salesman problem with cumulative costs. Networks 23, 81–91 (1993)
Bodin, L.D.: Twenty years of routing and scheduling. Operations Research 38(4), 571–579 (1990)
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Management Science 6, 80–91 (1959)
Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.P.: A classification scheme for vehicle routing and scheduling problems. European Journal of Operational Research 46, 322–332 (1990)
Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290 (1994)
Golden, B.L., Assad, A.A.: Vehicle Routing: Methods and Studies. North-Holland, Amsterdam (1988)
Gouveia, L.: A result on projection for the vehicle routing problem. European Journal of Operational Research 85, 610–624 (1995)
Gouveia, L., VoB, S.: A classification of formulations for the (time-dependent) traveling salesman problem. European Journal of Operational Research 83, 69–82 (1995)
Kara, İ.: Flow based Integer programming formulations for the distance constrained vehicle routing problem. Technical report 2006/01, Başkent University Faculty of Engineering, Ankara, Turkey (2006)
Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59, 345–358 (1992)
Laporte, G., Osman, I.H.: Routing problems: A bibliography. Annals of Operations Research 61, 227–262 (1995)
Letchford, A.N., Salazar-Gonzalez, J-J.: Projection results for vehicle routing. Mathematical Programming, Ser. B 105, 251–274 (2006)
Lucena, A.: Time-dependent traveling salesman problem-The deliveryman case. Networks 20, 753–763 (1990)
Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM (2002)
Toth, P., Vigo, D.: An overview of vehicle routing problems. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 1–26. SIAM (2002)
Toth, P., Vigo, D.: The Granular Tabu Search and its application to the vehicle routing problem. INFORMS Journal on Computing 15(4), 333–346 (2003)
Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22, 263–282 (1992)
Walker, K.M.: Applied Mechanics for Engineering Technology, 6th edn. Prentice Hall, Englewood Cliffs (2000)
Yaman, H.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Mathematical Programming, Ser. A 106, 365–390 (2006)
Goodyear web site: http://www.goodyear.com/truck/pdf/commercialtiresystems/FuelEcon.pdf
VRPLIB: http://www.or.deis.unibo.it/research_pages/ORinstances/VRPLIB/VRPLIB.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kara, İ., Kara, B.Y., Yetis, M.K. (2007). Energy Minimizing Vehicle Routing Problem. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-73556-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73555-7
Online ISBN: 978-3-540-73556-4
eBook Packages: Computer ScienceComputer Science (R0)