Name
Title | ||
|---|---|---|
An improving dynamic programming algorithm to solve the shortest path problem with time windows |
Abstract | ||
|---|---|---|
An efficient use of dynamic programming requires a substantial reduction of the number of labels. We propose in this paper an efficient way of reducing the number of labels saved and dominance computing time. Our approach is validated by experiments on shortest path problem with time windows instances. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.endm.2010.05.118 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
shortest path problem with time windows,dynamic programming,dynamic programming algorithm,shortest path problem | Canadian traveller problem,Mathematical optimization,Shortest path problem,Algorithm,Constrained Shortest Path First,Shortest job next,Shortest Path Faster Algorithm,Longest path problem,Mathematics,K shortest path routing,Euclidean shortest path | Journal |
Volume | ISSN | Citations |
36 | Electronic Notes in Discrete Mathematics | 3 |
PageRank | References | Authors |
0.42 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nora Touati Moungla | 1 | 10 | 2.93 |
| Lucas Létocart | 2 | 115 | 12.37 |
| Anass Nagih | 3 | 71 | 10.55 |