A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

Table 1

Column headings for Tables 2–10.

𝐼	Instance ID
𝑛	Number of customers
𝑚	Number of depots
𝑄	Vehicle capacity
𝐷	Maximum duration of a route
𝑐(𝑠^∗)	Previous best known solution cost
𝑐(𝑠^∗∗)	Best known solution found by proposed tabu search algorithm on FL
𝐿min, 𝐿max	Min and max amount limitation for vertexes to be added into the FL base
𝛿𝑖,𝑗	Borderline parameter of the sharing area
Δ𝛿	Updating step of 𝛿𝑖,𝑗
Δ𝑠max	Max difference between optimal vertex and local optimal vertexes in an optimization period
𝑛𝑌	Number of optimization periods
𝑛𝐿	The total number of local optimal vertexes
Ω^′	The total number of candidate links
𝜌^𝑖1	The proportion of customers in FLs to total customers in optimization period 𝑖
𝜌^𝑗2	The proportion of customers in FLs to total customers in local optimal vertex 𝑗
𝜔^𝑖1	The optimal solution value of optimization period 𝑖
𝜔^𝑗2	The value local optimal solution 𝑗