The Two-Echelon Vehicle Routing Problem with Transshipment Nodes and Occasional Drivers: Formulation and Adaptive Large Neighborhood Search Heuristic

Table 2

Final parameters in the proposed ALNS algorithm.

Symbol	Explanation	Final value
	Initial score of destroy and repair operators	50
	Perturbation factor	0.2
	Minimum number of customers and/or TNs to be removed	1
	Maximum number of customers and/or TNs to be removed	0.4 |N|
	Number of iterations without improvement before returning to the best-found solution	1000
	Number of iterations without improvement before implementing the satellite removal	100
	Time budget for 2EVRP	60 s (small instance), 900 s (large instance)
	Time budget for 2EVRP-TN-OD	60 s (small instance), 120 s (medium instance), 300 s (large instance)