| Article ID: | iaor20127311 |
| Volume: | 6 |
| Issue: | 8 |
| Start Page Number: | 1935 |
| End Page Number: | 1943 |
| Publication Date: | Dec 2012 |
| Journal: | Optimization Letters |
| Authors: | Li Jianping, Zhang Tongquan, Yin Ying |
| Keywords: | networks: path |
‘Time is life’ is popular now, considering of some optimization models with time windows is necessary. In this paper, we propose a new type of time windows which is left‐side time windows, and then consider the shortest path problems with left‐side time windows as well as the shortest path problems with multi‐left‐side time windows. The objectives of these problems are not simply the sum of their weights on such paths, but their travelling cycles which make one day as their travelling time unit. The optimal algorithms are presented for both the shortest path problem with single left‐side time windows and the shortest path problem with multi‐left‐side time windows.