A mathematical programming model for the green mixed fleet vehicle routing problem with realistic energy consumption and partial recharges
A green mixed fleet vehicle routing with realistic energy consumption and partial recharges problem (GMFVRP-REC-PR) is addressed in this paper. This problem involves a fixed number of electric vehicles and internal combustion vehicles to serve a set of customers. The realistic energy consumption whi...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7187 https://ink.library.smu.edu.sg/context/sis_research/article/8190/viewcontent/A_Mathematical_Programming_Model_for_the_Green_Mixed_Fleet_Vehicle_Routing_Problem_with_Realistic_Energy_Consumption_and_Partial_Recharges.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Summary: | A green mixed fleet vehicle routing with realistic energy consumption and partial recharges problem (GMFVRP-REC-PR) is addressed in this paper. This problem involves a fixed number of electric vehicles and internal combustion vehicles to serve a set of customers. The realistic energy consumption which depends on several variables is utilized to calculate the electricity consumption of an electric vehicle and fuel consumption of an internal combustion vehicle. Partial recharging policy is included into the problem to represent the real life scenario. The objective of this problem is to minimize the total travelled distance and the total emission produced by internal combustion vehicles. This is a new variant of problem which is developed from a mixed fleet of electric and internal combustion vehicles, full recharging policy, and operational cost minimization. A mixed integer programming model is then developed to address this problem and commercial software is utilized to solve the model. |
---|