Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls

IIE Transactions (Institute of Industrial Engineers)

Volumn 35, Issue 3, 2003, Pages 191-205

  Cheung, Raymond K ^a   Hang, Darren D ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b Jeppesen Systems AB   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CARGO HANDLING; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; FREIGHT TRANSPORTATION; HEURISTIC METHODS; INTEGER PROGRAMMING;

BACKHAULS; LABEL MATCHING; MULTI ATTRIBUTE TECHNIQUE; TIME WINDOWS; VEHICLE ROUTING PROBLEM;

MOTOR TRANSPORTATION;

EID: 0037337796     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170304371     Document Type: Article

References (15)

1. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993) Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ.
2. Balas, E. (1989) The prize collecting traveling salesman problem. Networks 19, 621-636.
3. Bertsekas, D.P. (1990) The auction algorithm for assignment and other network flow problems: a tutorial. Interfaces, 20(4), 133-149.
4. Desrochers, M., Desrosiers, J. and Solomon, M.M. (1992) A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40 342-354.
5. Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F. (1995) Time constrained routing and scheduling, in Handbooks in Operations Research and Management Science 8: Network Routing, Ball, M.O., Magnanti, T.L., Monma, C.L. and Nemhauser, G.L. (eds), North-Holland, Amsterdam, The Netherlands, pp. 35-139.
6. Dror, M. (1994) Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research, 42 977-978.
7. Duhamel, C. and Potvin, J.Y. (1997) A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transportation Science, 31, 49-59
8. Dumas, Y., Desrosiers, J. and Soumis, F. (1991) The pickup and delivery problem with time windows. European Journal of Operational Research, 54, 7-22.
9. Gelinas, S., Desrochers, M., Desrosiers, J. and Solomon, M.M. (1995) A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research, 61, 91-109.
10. Ioachim, I., Gelinas, S., Soumis, F. and Desrosiers, J. (1998) A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks, 31, 193-204.
11. Kohl, N., Desrosiers, J., Madsen, O.B.G., Solomon, M.M. and Soumis, F. (1992) 2-path cuts for the vehicle routing problem with time windows. Transportation Science, 33, 101-116.
12. Potvin, J.Y., Duhamel, C. and Guertin, F. (1996) A genetic algorithm for vehicle routing with bachhauling. Applied Intelligence, 6, 345-355.
13. Powell, W.B., Snow, W. and Cheung, R.K. (2000) Adaptive labeling algorithms for the dynamic assignment problem. Transportation Science 34, 50-66.
14. Thangiah, S.R., Potvin, J.Y. and Sun, T. (1996) Heuristic approaches to vehicle routing with backhauls and time windows. Computers and Operations Research, 23, 1043-1057.
15. Toth, P. and Vigo, D. (1997) An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31, 372-385.