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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A meta-heuristic for capacitated green vehicle routing problem


    Contributors:

    Published in:

    Publication date :

    2017-06-28


    Size :

    19 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem

    Faiz, Alfian / Subiyanto, Subiyanto / Arief, Ulfah Mediaty | BASE | 2018

    Free access

    Reoptimization Heuristic for the Capacitated Vehicle Routing Problem

    Rodrigo Linfati / John Willmer Escobar | DOAJ | 2018

    Free access

    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

    AbdElAziz, Moh. M. / A. El-Ghareeb, Haitham / Ksasy, M. S. M. | BASE | 2014

    Free access


    Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows

    Yuliza, Evi / Puspita, Fitri Maya / Supadi, Siti Suzlin | BASE | 2021

    Free access