Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times
Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time to traverse an arc. Moreover, all the paramete...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
University of Qom
2020-09-01
|
| Series: | مدیریت مهندسی و رایانش نرم |
| Subjects: | |
| Online Access: | https://jemsc.qom.ac.ir/article_1068_c81e51869e8e5eb621be93c818e5df13.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832577579765202944 |
|---|---|
| author | Gholamhasan Shirdel Hasan Rezapour |
| author_facet | Gholamhasan Shirdel Hasan Rezapour |
| author_sort | Gholamhasan Shirdel |
| collection | DOAJ |
| description | Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time to traverse an arc. Moreover, all the parameters in the network can be time-dependent. In this paper, the speed-up technique on time-varying shortest path problems is studied. First of all, the time-varying shortest path problem is explained. The problem is to find the shortest paths from a specific vertex (which is called a source) to other vertices, so that the total cost of the path is minimized and the total travel times and waiting times reach a maximum value of T, where T is a given positive integer. Then the speed-up technique is explained for a shortest path problem. |
| format | Article |
| id | doaj-art-4ca5a7900c5a4f1685b4e638d50b8907 |
| institution | Kabale University |
| issn | 2538-6239 2538-2675 |
| language | fas |
| publishDate | 2020-09-01 |
| publisher | University of Qom |
| record_format | Article |
| series | مدیریت مهندسی و رایانش نرم |
| spelling | doaj-art-4ca5a7900c5a4f1685b4e638d50b89072025-01-30T20:17:43ZfasUniversity of Qomمدیریت مهندسی و رایانش نرم2538-62392538-26752020-09-016292110.22091/jemsc.2018.1688.10491068Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting TimesGholamhasan Shirdel0Hasan Rezapour1Associate Prof., Department of Mathematics, Faculty of Basic Sciences, University of Qom, Qom, Iran.Ph.D, Applied Mathematics, Faculty of Basic Sciences, University of Qom, Qom, Iran.Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time to traverse an arc. Moreover, all the parameters in the network can be time-dependent. In this paper, the speed-up technique on time-varying shortest path problems is studied. First of all, the time-varying shortest path problem is explained. The problem is to find the shortest paths from a specific vertex (which is called a source) to other vertices, so that the total cost of the path is minimized and the total travel times and waiting times reach a maximum value of T, where T is a given positive integer. Then the speed-up technique is explained for a shortest path problem.https://jemsc.qom.ac.ir/article_1068_c81e51869e8e5eb621be93c818e5df13.pdfspeed-up techniquestime-varying shortest path |
| spellingShingle | Gholamhasan Shirdel Hasan Rezapour Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times مدیریت مهندسی و رایانش نرم speed-up techniques time-varying shortest path |
| title | Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times |
| title_full | Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times |
| title_fullStr | Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times |
| title_full_unstemmed | Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times |
| title_short | Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times |
| title_sort | speed up technique in time varying shortest path problems with arbitrary waiting times |
| topic | speed-up techniques time-varying shortest path |
| url | https://jemsc.qom.ac.ir/article_1068_c81e51869e8e5eb621be93c818e5df13.pdf |
| work_keys_str_mv | AT gholamhasanshirdel speeduptechniqueintimevaryingshortestpathproblemswitharbitrarywaitingtimes AT hasanrezapour speeduptechniqueintimevaryingshortestpathproblemswitharbitrarywaitingtimes |