×

zbMATH — the first resource for mathematics

Energy minimizing vehicle routing problem. (English) Zbl 1175.90333
Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 62-71 (2007).
Summary: 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.
For the entire collection see [Zbl 1122.68005].

MSC:
90C27 Combinatorial optimization
90C10 Integer programming
Software:
CPLEX; VRPLIB
PDF BibTeX XML Cite
Full Text: DOI