An improving dynamic programming algorithm to solve the shortest path problem with time windows

Nora Touati Moungla (1) , Lucas Létocart (2) , Anass Nagih (3)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 LIPN - Laboratoire d'Informatique de Paris-Nord
3 LITA - Laboratoire d'Informatique Théorique et Appliquée

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.

Domaines: Mathématique discrète [cs.DM]

Nora Touati Moungla, Lucas Létocart, Anass Nagih. An improving dynamic programming algorithm to solve the shortest path problem with time windows. International Symposium on Combinatorial Optimization, Mar 2010, Tunisia. pp.931-938. ⟨hal-00522297⟩