Abstract

We present improved dynamic programming algorithms for the vehicle routing problem with time windows, exploiting dominance criteria and state space relaxation to enhance computational efficiency.

Vehicle RoutingDynamic ProgrammingCombinatorial Optimization

BibTeX

@inproceedings{salani2005improved,
  title     = {Improved dynamic programming for the vehicle routing problem with time windows},
  author    = {Salani, Matteo},
  booktitle = {Proceedings of the 16th Mini-EURO Conference and 10th Meeting of EWGT},
  pages     = {559--564},
  year      = {2005}
}