Abstract The capacitated green vehicle routing problem is considered in this paper as a new variant of the vehicle routing problem. In this problem, alternative fuel-powered vehicles (AFVs) are used for distributing products. AFVs are assumed to have low fuel tank capacity. Therefore, during their distribution process, AFVs are required to visit alternative fuel stations (AFSs) for refueling. The design of the vehicle routes for AFVs becomes difficult due to the limited loading capacity, the low fuel tank capacity and the scarce availability of AFSs. Two solution methods, the two-phase heuristic algorithm and the meta-heuristic based on ant colony system, are proposed to solve the problem. The numerical experiment is performed on the randomly generated problem instances to evaluate the performance of the proposed algorithms.
A meta-heuristic for capacitated green vehicle routing problem
Annals of Operations Research ; 269 , 1 ; 753-771
28.06.2017
19 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem
BASE | 2018
|Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem
BASE | 2014
|Ant Colony System with Saving Heuristic for Capacitated Vehicle Routing Problem
BASE | 2019
|Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows
BASE | 2021
|