Three New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem

In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capacities and there is the possibility of choosing vehicles of different types. In this paper, Fleet Size and Mix Vehicle Routing Problem is death considering the reduction of fuel consumption. Since this problem is NP-hard, three novel heuristic methods entitled GROS-I,GROS-II, GGT are presented for the problem. In order to evaluate the proposed heuristics a number of small, medium and large problems are solved. The results show that proposed algorithms have good performance.