Energy minimizing vehicle routing problem

Files

Energy minimizing vehicle routing problem.pdf (308.22 KB)

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

Conference Paper

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
Usage Stats
7
views
159
downloads

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.

Course

Other identifiers

Book Title

Keywords

Capacitated vehicle routing problem, Energy minimizing vehicle routing problem, Integer programming, Binary sequences, Decision trees, Energy management

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/27042

Published Version (Please cite this version)

https://doi.org/10.1007/978-3-540-73556-4_9

Collections

Scholarly Publications - Industrial Engineering