Research Article
Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem
Table 2
sensitivity analysis on workload differential.
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Notes: ‘K’ is the number of drivers; ‘’ denotes the average workload of each driver on a day, which is obtained by the function . denotes the value of maximal workload differential among drivers which is the input parameter to solve the problem. Here, . ‘gap’ is calculated by the function gap= (ZL’- ZL)/ZL’; ZL and TL are the objective value and CPU time of local branching which do not consider small workload differential, respectively; and ZL’ and TL’ are the objective value and CPU time of local branching which consider small workload differential, respectively. |