Research Article
Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem
Table 1
The performance comparison of CPLEX and local branching based method.
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Notes: The ID ‘10-1’ means there are 10 customers in this instance, and ‘1’ is the index of the instance. Objective value and CPU time for CPLEX are denoted by ZC and TC. Objective value and CPU time for local ranching based method are denoted by ZL and TL, and GAPL = (ZL - ZC) / ZC. |