Research Article

Time-Dependent Electric Vehicle Routing Problem with Time Windows and Path Flexibility

Table 8

Experiment results.

TNMIAMINOFV (km)RT (min)AAOS (km)RAOS (km)

13003016722.351644.641.8
601630.23.86
901631.64.85
200301608.72.11635.0041.5
601646.12.21
901650.23.68
100301740.80.761705.47295.6
601816.21.58
901559.41.85

10300301520.67.641530.822.8
601528.510.2
901543.412.21
ā€‰3015374.121546.2317.8
601554.85.32
901546.95.93
200301548.41.561584.0755.5
601603.92.08
901599.93.11

Note: TN: thread number; MIA: maximum iterations of the algorithm; MIN: maximum iterations in the neighborhood; OFV: objective function value; RT: running time; AAOS: average of the approximate optimal solutions; and RAOS: range of the approximate optimal solutions.