An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

Table 4

The values for DC and customers 1–483 of 20 instances.

DC and customers	(m)	Customer	(m)	Customer	(m)	Customer	(m)
0–25	100	126–150	75	251–275	50	376–400	25
26–50	95	151–175	70	276–300	45	401–425	20
51–75	90	176–200	65	301–325	40	426–450	15
76–100	85	201–225	60	326–350	35	451–475	10
101–125	80	226–250	55	351–375	30	476–483	5