Title of article
An improving dynamic programming algorithm to solve the shortest path problem with time windows
Author/Authors
Touati Moungla، نويسنده , , Nora and Létocart، نويسنده , , Lucas and Nagih، نويسنده , , Anass، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
931
To page
938
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.
Keywords
Dynamic programming , Shortest path problem with time windows
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455547
Link To Document