Kara, İ.Kara, Bahar Y.Yetiş, M. K.2016-02-082016-02-0820070302-9743http://hdl.handle.net/11693/27042Date of Conference: 14-16 August 2007Conference Name: 1st International Conference on Combinatorial Optimization and Applications, COCOA 2007This 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.EnglishCapacitated vehicle routing problemEnergy minimizing vehicle routing problemInteger programmingBinary sequencesDecision treesEnergy managementConference Paper10.1007/978-3-540-73556-4_9