1 |
Dumas, Y., Desrosiers, J., Gelinas, E. and Solomon, M. M. (1995), An optimal algorithm for the traveling salesman problem with time windows, Operations Research, 43(2), 367-371
DOI
ScienceOn
|
2 |
Langevin, A., Desrochers, M., Desrosiers, J., Gelinas, S. and Soumis, F. (1993), A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows, Networks, 23, 631-640
DOI
ScienceOn
|
3 |
Nanry, W. P. and Barnes, J. W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B, 34, 107-121
DOI
ScienceOn
|
4 |
Solomon, M. M. (1987), Algorithms for the vehicle routing and scheduling problem with time window constraints, Operations Research, 35(2), 254-265
DOI
ScienceOn
|
5 |
Or, I. (1976), Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Blood Banking.Ph.D. Dissertation, Dept. of Industrial Engineering and Management Sciences, Northwestern University
|
6 |
Calvo, R. W. (2000), A new heuristic for the traveling salesman problem with time windows, Transportation Science, 34(1), 113-124
DOI
ScienceOn
|
7 |
Carlton, W. B. and Barnes, J. W. (1996), Solving the traveling salesman problem with time windows using tabu search, IIE Transactions, 28, 617-629
DOI
|
8 |
Savelsbergh, M. W. P. (1985), Local search in routing problems with time windows, Annals of Operations Research, 4, 285-305
DOI
|
9 |
Gendreau, M., Hertz, A. and Laporte, G. (1992), New insertion and postoptimization procedures for the traveling salesman problem, Operations Research, 40(6), 1086-1094
DOI
|
10 |
Gendreau, M., Hertz, A. and Laporte, G. and Stan, M. (1998), A generalized insertion heuristic for the traveling salesman problem with time windows, Operations Research, 46(3), 330-335
DOI
ScienceOn
|
11 |
Potvin, J. Y. and Bengio, S. (1996), The vehicle routing problem with time windows. II. genetic search, INFORMS Journal on Computing, 8, 165-172
DOI
ScienceOn
|
12 |
Ohlmann, J. W. and Thomas, B. W. (2006), A compressed annealing approach to the traveling salesman problem with time windows, INFORMS Journal on Computing (to appear)
|
13 |
Taillard, E. D., Badeau, P., Gendreau, M., Guertin, F. and Potvin, J. Y. (1997), A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Science, 31(1),170-186
|