Three new heuristic algorithms for the fleet size a nd mix green vehicle routing problem

88 Three new heuristic algorithms for the fleet size a nd mix green vehicle routing problem Mahdi Alinaghian 1 *, mohsn zamani 1 1 Department of Industrial and Systems Engineering, I sfahan University of Technology, Isfahan, Iran alinaghian@cc.iut.ac.ir, m.zamani9978@gmail.com Abstract In recent years, great efforts have been made to re duce greenhouse gas emissions by vehicles. Petroleum products produce green house ga s 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 wide ly used routing branches.In this problem, there are vehicles with different capaciti es and there is the possibility of choosingvehicles of different types. In this paper, Fleet Size and Mix Vehicle Routing Problem is death(?)consideringthe reduction of fuel consumption. Since this problem is NP- hard, three novel heuristic methods entitled GROS-I , GROS-II, GGTare presented for the problem. In order to evaluate the proposed heuristi cs a number of small, medium and large problems are solved. The results show that proposed algorithms have good performances.