A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem

Table 1

Summary of GVRP research.

No.	Aspect of review	Kara et al. [22]	Kuo [14]	Xiao et al. [18]	Erdoğan and Miller-Hooks [12]	Schneider et al. [23]	This research (2014)
1	Topic	Energy minimization	Fuel consumption	Fuel consumption	Using AFV & AFS	Using electrical vehicle	Using AFV & AFS
2	Objective	Minimize energy and distance	Minimize fuel consumption	Minimize fuel cost	Minimize distance	Minimize distance	Minimize distance
3	Decision variable	Traveling decision from vertex i to j and the weight of the vehicle if it goes from i to j	Traveling decision from vertex i to j	Traveling decision from vertex i to j and the weight of the (cargo) vehicle if it goes from i to j	Traveling decision from vertex i to j, fuel level, time	Traveling decision from vertex i to j, time, remaining, cargo, battery capacity	Traveling decision from vertex i to j, fuel level, time, capacity
4	Method/ solver	CPLEX 8.0	Simulated Annealing	Simulated Annealing	MCWS & DBCA	VNS/TS	Simulated Annealing
5	Number of depot	Single	Single	Single	Single	Single, multiple	Single
6	Capacity of vehicle	Available	Available	Available	Not available	Available	Available
7	Demand	Available	Available	Available	Not available	Available	Available