Energy minimizing vehicle routing problem

Simple item page
dc.citation.epage71
dc.citation.spage62
dc.citation.volumeNumber4616
dc.contributor.authorKara, İ.
dc.contributor.authorKara, Bahar Y.
dc.contributor.authorYetiş, M. K.
dc.coverage.spatialXi’an, China
dc.date.accessioned2016-02-08T11:42:47Z
dc.date.available2016-02-08T11:42:47Z
dc.date.issued2007
dc.departmentDepartment of Industrial Engineering
dc.descriptionDate of Conference: 14-16 August 2007
dc.descriptionConference Name: 1st International Conference on Combinatorial Optimization and Applications, COCOA 2007
dc.description.abstractThis 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.
dc.identifier.doi10.1007/978-3-540-73556-4_9
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27042
dc.language.isoEnglish
dc.publisherSpringer
dc.relation.isversionofhttps://doi.org/10.1007/978-3-540-73556-4_9
dc.source.titleLecture Notes in Computer Science
dc.subjectCapacitated vehicle routing problem
dc.subjectEnergy minimizing vehicle routing problem
dc.subjectInteger programming
dc.subjectBinary sequences
dc.subjectDecision trees
dc.subjectEnergy management
dc.titleEnergy minimizing vehicle routing problem
dc.typeConference Paper

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Energy minimizing vehicle routing problem.pdf
Size:
308.22 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering