Name
Title | ||
|---|---|---|
Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows |
Abstract | ||
|---|---|---|
We consider a widespread branch-and-price approach to solve the multiple depot vehicle scheduling problem with time windows. We describe a dynamic time window reduction technique to speed up this approach. The time windows are transferred from nodes to arcs in order to take advantage of dual information and to tighten as much as possible the time variable domains. The performance of the proposed technique is evaluated through computational experiments on randomly generated instances involving several depots and up to 900 tasks. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cor.2008.08.010 | Computers & OR |
Keywords | Field | DocType |
dual information,time variable domain,proposed technique,multiple depot vehicle scheduling,time windows,computational experiment,dynamic time window reduction,dynamic window reduction,widespread branch-and-price approach | Column generation,Mathematical optimization,Branch and bound,Job shop scheduling,Branch and price,Real-time computing,Depot,Mathematics,Speedup | Journal |
Volume | Issue | ISSN |
36 | 7 | Computers and Operations Research |
Citations | PageRank | References |
12 | 0.72 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahmed Hadjar | 1 | 111 | 4.75 |
| François Soumis | 2 | 821 | 97.64 |