| Article ID: | iaor20001571 |
| Country: | France |
| Volume: | 31 |
| Issue: | 2 |
| Start Page Number: | 117 |
| End Page Number: | 131 |
| Publication Date: | Jan 1997 |
| Journal: | RAIRO Operations Research |
| Authors: | Haouari Mohamed, Dejax P. |
| Keywords: | programming: linear, networks: path, programming: branch and bound |
We solve the time dependent shortest path problem. This problem consists in finding a minimum weight path through a network with respect to time windows constraints, and time varying costs and travelling times. Two issues of this problem are studied: without and with a knapsack type constraint. We show an important application of this problem for the design of an optimal column generation based algorithm for a time dependent vehicle routing problem.