The auction algorithm for shortest path in the dynamic traffic network
|
| Title | The auction algorithm for shortest path in the dynamic traffic network |
| Authors | |
| Abstract | Through modifying Auction Algorithm for the static shortest path, a new searching algorithm based on dynamic travel time was proposed. Taking the deviation between the searching in the static traffic network and the dynamic travel time related to the actual traffic into consideration, the searching of shortest paths in the dynamic network was chose. Firstly, the general spatial traffic network was enlarged to time-space network based on the definite expanding principles. Through this enlargement, the problem of searching dynamic shortest paths can be translated into the general shortest path problem. This translation can supply a basis for using the static shortest path searching methods in the dynamic traffic network. Then the new auction algorithm used for searching dynamic shortest paths was proposed that was concise without the help of the time-space network. Finally, the applicability of the new algorithm’s was proved by a simple example. |
| Publisher | World Science Publisher |
| Date | 2012-10-23 |
| Source | 2167-6380 |
| Rights | Copyright NoticeProposed Creative Commons Copyright Notices1. Proposed Policy for Journals That Offer Open AccessAuthors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work´s authorship and initial publication in this journal.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal´s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).Proposed Policy for Journals That Offer Delayed Open AccessAuthors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work´s authorship and initial publication in this journal.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal´s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access). |