A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem

Table 2

SA neighborhood structure.

Neighborhood structure	Description
swap	Performed by selecting a random customer in a route and another customer from another route to swap their positions
insertion	Conducted by randomly choosing a customer in a route and another customer from a different route. Then, the first chosen customer is deleted and inserted into the front of the second chosen customer from another route
insert_AFS	An AFS node is inserted into the infeasible route to make it a feasible one. This is a way to remedy infeasible routes due to fuel capacity
delete_AFS	Performed when the removal of an AFS node can reduce the cost incurred in the system while preserving the feasibility of the route