Best Known Solutions Identified by Heuristics 
 

Problem

NV

Distance

Authors

Problem

NV

Distance

Authors

R101

19

1645.79

H

R201

4

1252.37

HG

R102

17

1486.12

RT 

R202 

3

1191.70

RGP

R103

13

1292.68

LLH

R203

3

939.54

M

R104

9

1007.24

M

R204

2

825.52

BVH

R105

14

1377.11

RT

R205

3

994.42

RGP

R106

12

1251.98

M

R206

3

906.14

SSSD

R107

10

1104.66

S97

R207

2

893.33

BVH

R108

9

960.88

BBB

R208

2

726.75

M

R109

11

1194.73

HG

R209

3

909.16

H

R110

10

1118.59

M

R210

3

939.34

M

R111

10

1096.72

RGP

R211

2

892.71

BVH

R112

9

982.14

GTA

 

 

 

 

C101

10

828.94

RT

C201

3

591.56

RT

C102

10

828.94

RT

C202

3

591.56

RT

C103

10

828.06

RT

C203

3

591.17

RT

C104

10

824.78

RT

C204

3

590.60

RT

C105

10

828.94

RT

C205

3

588.88

RT

C106

10

828.94

RT

C206

3

588.49

RT

C107

10

828.94

RT

C207

3

588.29

RT

C108

10

828.94

RT

C208

3

588.32

RT

C109

10

828.94

RT

 

 

 

 

RC101

14

1696.94

TBGGP

RC201

4

1406.91

M

RC102

12

1554.75

TBGGP

RC202

3

1367.09

CC

RC103

11

1261.67

S98

RC203

3

1049.62

CC

RC104

10

1135.48

CLM

RC204

3

798.41

M

RC105

13

1629.44

BBB

RC205

4

1297.19

M

RC106

11

1424.73

BBB

RC206

3

1146.32

H

RC107

11

1230.48

S97

RC207

3

1061.14

BVH

RC108

10

1139.82

TBGGP

RC208

3

828.14

IKMUY

Legend:

BVH - R. Bent and P. Van Hentenryck, "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Technical Report CS-01-06, Department of Computer Science, Brown University, 2001.

BBB - J. Berger, M. Barkaoui and O. Bräysy, "A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows," Working paper, Defense Research Establishment Valcartier, Canada, 2001.

CC - Z. J. Czech and P. Czarnas, "A Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows," Proc. 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands, Spain, (January 9--11, 2002), 376--383.

CLM - J.-F. Cordeau,  G. Laporte, and A. Mercier, "A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows," Working Paper CRT-00-03, Centre for Research on Transportation, Montreal, Canada, 2000.

GTA - L. M. Gambardella, E. Taillard, and G. Agazzi, "MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows," in New Ideas in Optimization, D. Corne, M. Dorigo and F. Glover (eds), 63-76, McGraw-Hill, London, 1999.

HG - J. Homberger and H. Gehring, "Two Evolutionary Metaheuristics for the Vehicle Routing Problem with Time Windows," INFOR, VOL. 37, 297-318, (1999).

H - J. Homberger, "Verteilt-parallele Metaheuristiken zur Tourenplanung," Gaber, Wiesbaden (2000).

IKMUY - T. Ibaraki, M. Kubo, T. Masuda, T. Uno and M. Yagiura, "Effective Local Search Algorithms for the Vehicle Routing Problem with General Time Windows," Working Paper, Department of Applied Mathematics and Physics, Kyoto University, Japan, 2001.

LLH - H. Li, A. Lim, and J. Huang, "Local Search with Annealing-like Restarts to Solve the VRPTW," Working Paper, Department of Computer Science, National University of Singapore, 2001.

M - D. Mester, "An Evolutionary Strategies Algorithm for Large Scale Vehicle Routing Problem with Capacitate and Time Windows Restrictions," Working Paper, Institute of Evolution, University of Haifa, Israel (2002).

RT - Y. Rochat and E.D. Taillard, "Probabilistic Diversification and Intensification in Local Search for Vehicle Routing," Journal of Heuristics 1, 147-167, (1995).

RGP - L.M. Rousseau, M. Gendreau and G. Pesant, "Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows," Journal of Heuristics, forthcoming.

SSSD - G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt and G. Dueck, "Record Breaking Optimization Results Using the Ruin and Recreate Principle," Journal of Computational Physics 159, 139-171, (2000).

S97 - P. Shaw, "A New Local Search Algorithm Providing High Quality Solutions to Vehicle Routing Problems," Working Paper, University of Strathclyde, Glasgow, Scotland, 1997.

S98 - P. Shaw, "Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems," in Principles and Practice of Constraint Programming - CP98, Lecture Notes in Computer Science, 417-431, M. Maher and J.-F. Puget (eds), Springer-Verlag, New York, 1998.

TBGGP - E. Taillard, P. Badeau, M. Gendreau, F. Geurtin, and J.Y. Potvin, "A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows," Transportation Science, 31, 170-186, (1997).


 

 

Back to Main Page