We develop a solution approach to solve the green vehicle routing problem.
•
We propose a simulated annealing heuristic to improve the quality of solutions.
•
We present a new formulation having fewer variable and constraints.
•
We evaluate the algorithm in terms of the several performance criterions.
•
Our algorithm is able to optimally solve 22 of 40 benchmark instances.