Journals
Publish with us
Publishing partnerships
About us
Blog
Mathematical Problems in Engineering
Journal overview
For authors
For reviewers
For editors
Table of Contents
Special Issues
Mathematical Problems in Engineering
/
2015
/
Article
/
Tab 4
/
Research Article
A Hyperheuristic for the Dial-a-Ride Problem with Time Windows
Table 4
Results for DARPTW obtained by using the Simulated Annealing (SA) solver described in [
6
] and a multiagent system with a SA embedded (MOSA) described in [
7
].
SA (Mauri and Lorena [
6
])
MOSA (Zidi et al. [
7
])
Route duration
Ride time
CPU time
Route duration
Ride time
CPU time
Avg.
Best
Avg.
Best
min
Avg.
Best
Avg.
Best
min
pr01
—
831.30
—
241.93
1.00
—
932.73
—
516.19
1.12
pr02
—
1992.34
—
310.17
1.20
—
1825.39
—
731.20
3.29
pr03
—
2404.67
—
894.08
1.46
—
2806.70
—
3546.64
12.30
pr05
—
3920.25
—
899.35
1.79
—
3809.00
—
2785.00
10.56
pr11
—
738.42
—
206.66
0.92
—
1003.77
—
598.13
1.53
pr12
—
1428.44
—
311.95
1.30
—
1366.43
—
811.50
5.62
pr15
—
3654.02
—
855.16
1.95
—
4051.60
—
3001.20
16.20
pr16
—
4318.33
—
1245.66
1.94
—
4512.30
—
2247.00
15.21
pr17
—
1095.67
—
345.10
1.05
—
1397.50
—
933.58
3.60
pr19
—
3315.28
—
1085.18
2.26
—
3312.70
—
2894.00
14.00