Corpus ID: 17386284

A Bi-directional Resource-bounded Dynamic Programming Approach for the Traveling Salesman Problem with Time Windows

@inproceedings{Li2009ABR,
  title={A Bi-directional Resource-bounded Dynamic Programming Approach for the Traveling Salesman Problem with Time Windows},
  author={Jing-Quan Li},
  year={2009}
}
This paper presents a bi-directional resource-bounded label correcting algorithm for the traveling salesman problem with time windows, in which the objective is to minimize travel times. Label extensions and dominance start simultaneously in both forward and backward directions: the forward direction from the starting depot and the backward direction from the terminating depot. The resultant label extension process scans much smaller the space than in single directional dynamic programming… Expand
2 Citations

References

SHOWING 1-10 OF 23 REFERENCES
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
2-Path Cuts for the Vehicle Routing Problem with Time Windows
A New Heuristic for the Traveling Salesman Problem with Time Windows
  • R. W. Calvo
  • Mathematics, Computer Science
  • Transp. Sci.
  • 2000
An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows
New dynamic programming algorithms for the resource constrained elementary shortest path problem
An algorithm for the resource constrained shortest path problem
...
1
2
3
...