Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios
We investigate a dynamic route planning problem in restricted-space evacuation, namely, the Multiobjective Dynamic Route Network Planning (MODRNP) problem. It models the multisource to multidestination evacuation in restricted-space scenarios, with the objectives of minimizing the whole evacuation d...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2018/4295419 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849309111072587776 |
|---|---|
| author | Yi Hong Deying Li Qiang Wu Hua Xu |
| author_facet | Yi Hong Deying Li Qiang Wu Hua Xu |
| author_sort | Yi Hong |
| collection | DOAJ |
| description | We investigate a dynamic route planning problem in restricted-space evacuation, namely, the Multiobjective Dynamic Route Network Planning (MODRNP) problem. It models the multisource to multidestination evacuation in restricted-space scenarios, with the objectives of minimizing the whole evacuation delay and maximizing the evacuation efficiency. We study the problem in 3D scenarios, which can provide intuition vision for the geographic space and contribute to the evacuation plan and implementation. Based on the auxiliary graph transformation, we propose a heuristic algorithm referred to the classical problem, Minimum Weighted Set Cover. We finally conduct extensive experiments to evaluate the performance of the proposed algorithm and give an application instance on a typical kind of restricted-space scenarios. The results indicate that the proposed algorithm outperforms the existing alternatives in terms of the utilization as well as timeliness. |
| format | Article |
| id | doaj-art-0cc761d5fa614b10b42c4df36e5b330f |
| institution | Kabale University |
| issn | 0197-6729 2042-3195 |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-0cc761d5fa614b10b42c4df36e5b330f2025-08-20T03:54:15ZengWileyJournal of Advanced Transportation0197-67292042-31952018-01-01201810.1155/2018/42954194295419Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space ScenariosYi Hong0Deying Li1Qiang Wu2Hua Xu3Information Engineering College, Beijing Institute of Petrochemical Technology, Beijing 102617, ChinaSchool of Information, Renmin University of China, Beijing 100872, ChinaNational Engineering Research Center of Coal Mine Water Hazard Controlling, China University of Mining and Technology, Beijing, Beijing 100083, ChinaInformation Engineering College, Beijing Institute of Petrochemical Technology, Beijing 102617, ChinaWe investigate a dynamic route planning problem in restricted-space evacuation, namely, the Multiobjective Dynamic Route Network Planning (MODRNP) problem. It models the multisource to multidestination evacuation in restricted-space scenarios, with the objectives of minimizing the whole evacuation delay and maximizing the evacuation efficiency. We study the problem in 3D scenarios, which can provide intuition vision for the geographic space and contribute to the evacuation plan and implementation. Based on the auxiliary graph transformation, we propose a heuristic algorithm referred to the classical problem, Minimum Weighted Set Cover. We finally conduct extensive experiments to evaluate the performance of the proposed algorithm and give an application instance on a typical kind of restricted-space scenarios. The results indicate that the proposed algorithm outperforms the existing alternatives in terms of the utilization as well as timeliness.http://dx.doi.org/10.1155/2018/4295419 |
| spellingShingle | Yi Hong Deying Li Qiang Wu Hua Xu Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios Journal of Advanced Transportation |
| title | Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios |
| title_full | Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios |
| title_fullStr | Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios |
| title_full_unstemmed | Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios |
| title_short | Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios |
| title_sort | dynamic route network planning problem for emergency evacuation in restricted space scenarios |
| url | http://dx.doi.org/10.1155/2018/4295419 |
| work_keys_str_mv | AT yihong dynamicroutenetworkplanningproblemforemergencyevacuationinrestrictedspacescenarios AT deyingli dynamicroutenetworkplanningproblemforemergencyevacuationinrestrictedspacescenarios AT qiangwu dynamicroutenetworkplanningproblemforemergencyevacuationinrestrictedspacescenarios AT huaxu dynamicroutenetworkplanningproblemforemergencyevacuationinrestrictedspacescenarios |