Energy minimizing vehicle routing problem
Date
2007
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Lecture Notes in Computer Science
Print ISSN
0302-9743
Electronic ISSN
Publisher
Springer
Volume
4616
Issue
Pages
62 - 71
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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(n2) 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.