A study on carbon emission based heterogeneous vehicle routing

Abstract

We consider the problem of determining a set of vehicle routes starting/ending at the depot while satisfying customer demands and vehicle capacities for a given heterogeneous fleet of vehicles. As an extension of the previous studies, this study considers carbon emission for the objective of minimizing the sum of variable operation costs and carbon emission cost/benefit. As an earlier study on carbon emission based heterogeneous vehicle routing, we develop a mixed integer programming model and suggest two types of meta-heuristics, simulated annealing and tabu search, due to the complexity of the problem. Computational experiments were done on the benchmark instances with certain modifications, and the results are reported.