A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions
A Multi-Depot Green Vehicle Routing Problem (MDGVRP) is considered in this paper. In MDGVRP, Alternative Fuel-powered Vehicles (AFVs) start from different depots, serve customers, and, at the end, return to the original depots. The limited fuel tank capacity of AFVs forces them to visit Alternative Fuel Stations (AFS) for refueling. The objective is to minimize the total carbon emissions. A Two-stage Ant Colony System (TSACS) is proposed to find a feasible and acceptable solution for this NP-hard (Non-deterministic polynomial-time) optimization problem. The distinct characteristic of the proposed TSACS is the use of two distinct types of ants for two different purposes. The first type of ant is used to assign customers to depots, while the second type of ant is used to find the routes. The solution for the MDGVRP is useful and beneficial for companies that employ AFVs to deal with the various inconveniences brought by the limited number of AFSs. The numerical experiments confirm the effectiveness of the proposed algorithms in this research.
Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions
A Multi-Depot Green Vehicle Routing Problem (MDGVRP) is considered in this paper. In MDGVRP, Alternative Fuel-powered Vehicles (AFVs) start from different depots, serve customers, and, at the end, return to the original depots. The limited fuel tank capacity of AFVs forces them to visit Alternative Fuel Stations (AFS) for refueling. The objective is to minimize the total carbon emissions. A Two-stage Ant Colony System (TSACS) is proposed to find a feasible and acceptable solution for this NP-hard (Non-deterministic polynomial-time) optimization problem. The distinct characteristic of the proposed TSACS is the use of two distinct types of ants for two different purposes. The first type of ant is used to assign customers to depots, while the second type of ant is used to find the routes. The solution for the MDGVRP is useful and beneficial for companies that employ AFVs to deal with the various inconveniences brought by the limited number of AFSs. The numerical experiments confirm the effectiveness of the proposed algorithms in this research.
Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions
Weiheng Zhang (author) / Yuvraj Gajpal (author) / Srimantoorao. S. Appadoo (author) / Qi Wei (author)
2020
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under ​CC BY-SA 1.0
Solving the Multi-Depot Green Vehicle Routing Problem by a Hybrid Evolutionary Algorithm
| DOAJ | 2020
An Integrated Hub Location and Multi-Depot Vehicle Routing Problem
| British Library Conference Proceedings | 2013
| DOAJ | 2021
Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation
| DOAJ | 2021