Energy minimizing vehicle routing problem
View/
Date
2007Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Print ISSN
0302-9743
Volume
4616 LNCS
Pages
62 - 71
Language
English
Type
Conference Paper
Metadata
Show full item recordPlease cite this item using this persistent URL
http://hdl.handle.net/11693/27042Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Development of a supervisory controller for residential energy management problems
(2012)In recent years, the infrastructure that supplies energy to residential areas has started to evolve into a multi-source system, just like in automotive industry in which hybrid electric vehicles (HEVs) have been replacing ... -
Concurrent design of energy management and vehicle stability algorithms for a parallel hybrid vehicle using Dynamic Programming
(2012)In this paper, concurrent design of controllers for a vehicle equipped with a parallel hybrid powertrain is studied. Our work focuses on designing the two control algorithms, the energy management and the vehicle stability, ... -
Minimum cost path problem for Plug-in Hybrid Electric Vehicles
(Elsevier Ltd, 2015)We introduce a practically important and theoretically challenging problem: finding the minimum cost path for PHEVs in a road network with refueling and charging stations. We show that this problem is NP-complete and present ...
