LAUSR

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.