![](bg4.png)
Technical Report Cahiers du GERAD G-99-13, École
des Hautes Études Commerciales de Montréal.
Cordeau J. F., Laporte G., 2003. A tabu search heuristic
for the static multi-vehicle dial-a-ride problem.
Transportation Research Part B: Methodological, 37:
579-594.
Desrochers, M., Desrosiers, J., Solomon M. M., 1992. A
New Optimization Algorithm for the Vehicle Routing
Problem with Time Windows. Operations Research,
40: 342.354.
Joubert J. W., 2003. An initial heuristic for the vehicle
routing and scheduling problem. MEng thesis,
University of Pretoria, Pretoria.
Julstrom, B.A., 1995. Very greedy Crossover in a Genetic
Algorithm for the TSP. Proceedings of the 1995 ACM
symposium on applied computing: 324-328.
Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M.
M., and Soumis, F., 1999. 2-Path Cuts for the Vehicle
Routing Problem with Time Windows. Transportation
Science, Vol. 33 (1), 101-116.
Lau, H. C., Sim, M., Teo, K. M. 2003. Vehicle routing
problem with time windows and a limited number of
vehicles. European Journal of Operational Research,
148: 559-569.
Lawler, E. L., Lenstra, J. K., Rinnooy, K., Shmoys, D. B.,
1985. The traveling Salesman Problem: A guided tour
of combinatorial optimization. Willey – Interscience
Publication.
Reinelt, G., 1991. TSPLIB – A traveling salesman
problem library. ORSA Journal on Computing, 3: 376
– 384.
Rochat, Y. And Taillard, E. D. 1995 Probabilistic
Diversification and Intensification in Local Search for
Vehicle Routing. Journal of Heuristics 1, 147-167.
Solomon, M. M., 1987. Algorithms for the vehicle routing
and scheduling problems with time windows.
INFORMS Operations Research, 35: 254-265.
Solomon, M. M., 2005. VRPTW Bechmark Problems.
http://web.cba.neu.edu/~msolomon/problems.htm.
APPENDIX
Below are the routes of the solution to the C101
problem. In each route the sequence of customer
locations (X and Y) are shown. Note that the first
and last location of each route is exactly the same,
and corresponds to the central depot (which is a
requirement of VRPTW problems).
Route 1: [40, 50] [33, 35] [33, 32] [35, 32] [35, 30]
[32, 30] [30, 30] [30, 32] [28, 30] [25, 30] [26, 32]
[25, 35] [28, 35] [30 35] [40, 50]
Route 2: [40, 50] [42, 65] [42, 66] [40, 66] [38, 68]
[35, 66] [35, 69] [38, 70] [40, 69] [42, 68] [45, 70]
[45, 68] [45, 65] [40, 50]
Route 3: [40, 50] [45, 35] [47, 35] [45, 30] [48, 30]
[50, 30] [53, 30] [53, 35] [50, 35] [50, 40] [48, 40]
[47, 40] [40, 50]
Route 4: [40, 50] [30, 50] [25, 50] [25, 52] [23, 52]
[20, 50] [20, 55] [23, 55] [25, 55] [28, 55] [28, 52]
[30, 52] [40, 50]
Route 5: [40, 50] [60, 60] [63, 58] [65, 60] [68, 60]
[70, 58] [75, 55] [72, 55] [66, 55] [65, 55] [60, 55]
[40, 50]
Route 6: [40, 50] [58, 75] [60, 80] [62, 80] [65, 82]
[67, 85] [65, 85] [60, 85] [55, 85] [55, 80] [40, 50]
Route 7: [40, 50] [85, 25] [87, 30] [88, 30] [92, 30]
[95, 30] [95, 35] [90, 35] [88, 35] [85, 35] [40, 50]
Route 8: [40, 50] [10, 40] [8, 40] [10, 35] [5, 35]
[2, 40] [0, 40] [0, 45] [5, 45] [8, 45] [40, 50]
Route 9: [40, 50] [42, 15] [42, 10] [44, 5] [40, 5]
[38, 5] [35, 5] [38, 15] [40, 15] [40, 50]
Route 10: [40, 50] [22, 75] [20, 80] [25, 85] [22, 85]
[20, 85] [15, 80] [15, 75] [18, 75] [40, 50]
AMethodologicalProposaltoEliminateAmbiguitiesintheComparisonofVehicleRoutingProblemSolvingTechniques
313