An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm
The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for u...
Gespeichert in:
| Veröffentlicht in: | PloS one 2016-10, Vol.11 (10), p.e0164780-e0164780 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | e0164780 |
|---|---|
| container_issue | 10 |
| container_start_page | e0164780 |
| container_title | PloS one |
| container_volume | 11 |
| creator | Lu, Guangquan Xiong, Ying Ding, Chuan Wang, Yunpeng |
| description | The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical links will be given priority in repair according to the basic concept of the greedy algorithm. In this study, the link whose restoration produces the ratio of the system-wide travel time of the current network to the worst network is the minimum. We define such a link as the critical link for the current network. We will re-evaluate the importance of damaged links after each repair process is completed. That is, the critical link ranking will be changed along with the repair process because of the interaction among links. We repair the most critical link for the specific network state based on the greedy algorithm to obtain the optimal schedule. The algorithm can still quickly obtain an optimal schedule even if the scale of the road network is large because the greedy algorithm can reduce computational complexity. We prove that the problem can obtain the optimal solution using the greedy algorithm in theory. The algorithm is also demonstrated in the Sioux Falls network. The problem discussed in this paper is highly significant in dealing with urban road network restoration. |
| doi_str_mv | 10.1371/journal.pone.0164780 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_1830874599</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A471896218</galeid><doaj_id>oai_doaj_org_article_2a624705e837429f8b5f0020b762ea23</doaj_id><sourcerecordid>A471896218</sourcerecordid><originalsourceid>FETCH-LOGICAL-c725t-349910f37597f1fc3935e0a08451fdb4213f4e4fa61df82337effc68a7447d1b3</originalsourceid><addsrcrecordid>eNqNk99v0zAQxyMEYqPwHyCwhITgocW_EjsvSGWCUWmiUsd4tZzk3KS4cbETYP897ppNDdrD5Adb589973znS5KXBM8IE-TDxvW-1Xa2cy3MMMm4kPhRckpyRqcZxezx0fkkeRbCBuOUySx7mpxQITIpGD1NlvMWLXdds9UWXZY1VL0FZJxHV77QLVo5XaFv0P1x_idawU43Hn3SASrkWtTVgM49QHWN5nbtfNPV2-fJE6NtgBfDPkmuvnz-fvZ1erE8X5zNL6aloGk3ZTzPCTZMpLkwxJQsZylgjSVPiakKTgkzHLjRGamMpIwJMKbMpBaci4oUbJK8PujurAtqqEVQRDIsBU_zPBKLA1E5vVE7H5_or5XTjboxOL9W2ndNaUFRnVEucAqSCU5zI4vUYExxITIKOkafJB-HaH2xhaqEtvPajkTHN21Tq7X7rVIck8lkFHg3CHj3q4fQqW0TSrBWt-D6m7wFw4xx8RA0TWnsJI7om__Q-wsxUGsd39q0xsUUy72omnNBZJ5Rss9wdg8VVwXbpox_zDTRPnJ4P3KITAd_u7XuQ1CLy9XD2eWPMfv2iK1B264OzvZd49owBvkBLL0LwYO56wfBaj8it9VQ-xFRw4hEt1fHvbxzup0J9g8zqAgy</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1830874599</pqid></control><display><type>article</type><title>An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm</title><source>MEDLINE</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Public Library of Science (PLoS)</source><source>PubMed Central</source><source>Free Full-Text Journals in Chemistry</source><creator>Lu, Guangquan ; Xiong, Ying ; Ding, Chuan ; Wang, Yunpeng</creator><contributor>Gao, Zhong-Ke</contributor><creatorcontrib>Lu, Guangquan ; Xiong, Ying ; Ding, Chuan ; Wang, Yunpeng ; Gao, Zhong-Ke</creatorcontrib><description>The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical links will be given priority in repair according to the basic concept of the greedy algorithm. In this study, the link whose restoration produces the ratio of the system-wide travel time of the current network to the worst network is the minimum. We define such a link as the critical link for the current network. We will re-evaluate the importance of damaged links after each repair process is completed. That is, the critical link ranking will be changed along with the repair process because of the interaction among links. We repair the most critical link for the specific network state based on the greedy algorithm to obtain the optimal schedule. The algorithm can still quickly obtain an optimal schedule even if the scale of the road network is large because the greedy algorithm can reduce computational complexity. We prove that the problem can obtain the optimal solution using the greedy algorithm in theory. The algorithm is also demonstrated in the Sioux Falls network. The problem discussed in this paper is highly significant in dealing with urban road network restoration.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0164780</identifier><identifier>PMID: 27768732</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Algorithms ; Collaboration ; Computer and Information Sciences ; Computer applications ; Damage assessment ; Disasters ; Earth Sciences ; Earthquakes ; Engineering and Technology ; Evacuations & rescues ; Flood damage ; Genetic algorithms ; Greedy algorithms ; Laboratories ; Links ; Medicine and Health Sciences ; Native North Americans ; Physical Sciences ; Rainstorms ; Repair ; Research and Analysis Methods ; Restoration ; Roads ; Roads & highways ; Scheduling ; Science ; Seismic engineering ; Traffic accidents & safety ; Traffic congestion ; Transportation ; Transportation planning ; Travel time ; Traveltime ; Urban areas ; Weather ; Weather conditions</subject><ispartof>PloS one, 2016-10, Vol.11 (10), p.e0164780-e0164780</ispartof><rights>COPYRIGHT 2016 Public Library of Science</rights><rights>2016 Lu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2016 Lu et al 2016 Lu et al</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c725t-349910f37597f1fc3935e0a08451fdb4213f4e4fa61df82337effc68a7447d1b3</citedby><cites>FETCH-LOGICAL-c725t-349910f37597f1fc3935e0a08451fdb4213f4e4fa61df82337effc68a7447d1b3</cites><orcidid>0000-0001-9560-8585</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC5074568/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC5074568/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,314,723,776,780,860,881,2095,2914,23846,27903,27904,53770,53772,79347,79348</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/27768732$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Gao, Zhong-Ke</contributor><creatorcontrib>Lu, Guangquan</creatorcontrib><creatorcontrib>Xiong, Ying</creatorcontrib><creatorcontrib>Ding, Chuan</creatorcontrib><creatorcontrib>Wang, Yunpeng</creatorcontrib><title>An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical links will be given priority in repair according to the basic concept of the greedy algorithm. In this study, the link whose restoration produces the ratio of the system-wide travel time of the current network to the worst network is the minimum. We define such a link as the critical link for the current network. We will re-evaluate the importance of damaged links after each repair process is completed. That is, the critical link ranking will be changed along with the repair process because of the interaction among links. We repair the most critical link for the specific network state based on the greedy algorithm to obtain the optimal schedule. The algorithm can still quickly obtain an optimal schedule even if the scale of the road network is large because the greedy algorithm can reduce computational complexity. We prove that the problem can obtain the optimal solution using the greedy algorithm in theory. The algorithm is also demonstrated in the Sioux Falls network. The problem discussed in this paper is highly significant in dealing with urban road network restoration.</description><subject>Algorithms</subject><subject>Collaboration</subject><subject>Computer and Information Sciences</subject><subject>Computer applications</subject><subject>Damage assessment</subject><subject>Disasters</subject><subject>Earth Sciences</subject><subject>Earthquakes</subject><subject>Engineering and Technology</subject><subject>Evacuations & rescues</subject><subject>Flood damage</subject><subject>Genetic algorithms</subject><subject>Greedy algorithms</subject><subject>Laboratories</subject><subject>Links</subject><subject>Medicine and Health Sciences</subject><subject>Native North Americans</subject><subject>Physical Sciences</subject><subject>Rainstorms</subject><subject>Repair</subject><subject>Research and Analysis Methods</subject><subject>Restoration</subject><subject>Roads</subject><subject>Roads & highways</subject><subject>Scheduling</subject><subject>Science</subject><subject>Seismic engineering</subject><subject>Traffic accidents & safety</subject><subject>Traffic congestion</subject><subject>Transportation</subject><subject>Transportation planning</subject><subject>Travel time</subject><subject>Traveltime</subject><subject>Urban areas</subject><subject>Weather</subject><subject>Weather conditions</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>DOA</sourceid><recordid>eNqNk99v0zAQxyMEYqPwHyCwhITgocW_EjsvSGWCUWmiUsd4tZzk3KS4cbETYP897ppNDdrD5Adb589973znS5KXBM8IE-TDxvW-1Xa2cy3MMMm4kPhRckpyRqcZxezx0fkkeRbCBuOUySx7mpxQITIpGD1NlvMWLXdds9UWXZY1VL0FZJxHV77QLVo5XaFv0P1x_idawU43Hn3SASrkWtTVgM49QHWN5nbtfNPV2-fJE6NtgBfDPkmuvnz-fvZ1erE8X5zNL6aloGk3ZTzPCTZMpLkwxJQsZylgjSVPiakKTgkzHLjRGamMpIwJMKbMpBaci4oUbJK8PujurAtqqEVQRDIsBU_zPBKLA1E5vVE7H5_or5XTjboxOL9W2ndNaUFRnVEucAqSCU5zI4vUYExxITIKOkafJB-HaH2xhaqEtvPajkTHN21Tq7X7rVIck8lkFHg3CHj3q4fQqW0TSrBWt-D6m7wFw4xx8RA0TWnsJI7om__Q-wsxUGsd39q0xsUUy72omnNBZJ5Rss9wdg8VVwXbpox_zDTRPnJ4P3KITAd_u7XuQ1CLy9XD2eWPMfv2iK1B264OzvZd49owBvkBLL0LwYO56wfBaj8it9VQ-xFRw4hEt1fHvbxzup0J9g8zqAgy</recordid><startdate>20161021</startdate><enddate>20161021</enddate><creator>Lu, Guangquan</creator><creator>Xiong, Ying</creator><creator>Ding, Chuan</creator><creator>Wang, Yunpeng</creator><general>Public Library of Science</general><general>Public Library of Science (PLoS)</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0001-9560-8585</orcidid></search><sort><creationdate>20161021</creationdate><title>An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm</title><author>Lu, Guangquan ; Xiong, Ying ; Ding, Chuan ; Wang, Yunpeng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c725t-349910f37597f1fc3935e0a08451fdb4213f4e4fa61df82337effc68a7447d1b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Collaboration</topic><topic>Computer and Information Sciences</topic><topic>Computer applications</topic><topic>Damage assessment</topic><topic>Disasters</topic><topic>Earth Sciences</topic><topic>Earthquakes</topic><topic>Engineering and Technology</topic><topic>Evacuations & rescues</topic><topic>Flood damage</topic><topic>Genetic algorithms</topic><topic>Greedy algorithms</topic><topic>Laboratories</topic><topic>Links</topic><topic>Medicine and Health Sciences</topic><topic>Native North Americans</topic><topic>Physical Sciences</topic><topic>Rainstorms</topic><topic>Repair</topic><topic>Research and Analysis Methods</topic><topic>Restoration</topic><topic>Roads</topic><topic>Roads & highways</topic><topic>Scheduling</topic><topic>Science</topic><topic>Seismic engineering</topic><topic>Traffic accidents & safety</topic><topic>Traffic congestion</topic><topic>Transportation</topic><topic>Transportation planning</topic><topic>Travel time</topic><topic>Traveltime</topic><topic>Urban areas</topic><topic>Weather</topic><topic>Weather conditions</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lu, Guangquan</creatorcontrib><creatorcontrib>Xiong, Ying</creatorcontrib><creatorcontrib>Ding, Chuan</creatorcontrib><creatorcontrib>Wang, Yunpeng</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Opposing Viewpoints</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing & Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological & Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>Materials Science Database</collection><collection>Nursing & Allied Health Database (Alumni Edition)</collection><collection>Meteorological & Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Nursing & Allied Health Premium</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lu, Guangquan</au><au>Xiong, Ying</au><au>Ding, Chuan</au><au>Wang, Yunpeng</au><au>Gao, Zhong-Ke</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2016-10-21</date><risdate>2016</risdate><volume>11</volume><issue>10</issue><spage>e0164780</spage><epage>e0164780</epage><pages>e0164780-e0164780</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical links will be given priority in repair according to the basic concept of the greedy algorithm. In this study, the link whose restoration produces the ratio of the system-wide travel time of the current network to the worst network is the minimum. We define such a link as the critical link for the current network. We will re-evaluate the importance of damaged links after each repair process is completed. That is, the critical link ranking will be changed along with the repair process because of the interaction among links. We repair the most critical link for the specific network state based on the greedy algorithm to obtain the optimal schedule. The algorithm can still quickly obtain an optimal schedule even if the scale of the road network is large because the greedy algorithm can reduce computational complexity. We prove that the problem can obtain the optimal solution using the greedy algorithm in theory. The algorithm is also demonstrated in the Sioux Falls network. The problem discussed in this paper is highly significant in dealing with urban road network restoration.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>27768732</pmid><doi>10.1371/journal.pone.0164780</doi><tpages>e0164780</tpages><orcidid>https://orcid.org/0000-0001-9560-8585</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1932-6203 |
| ispartof | PloS one, 2016-10, Vol.11 (10), p.e0164780-e0164780 |
| issn | 1932-6203 1932-6203 |
| language | eng |
| recordid | cdi_plos_journals_1830874599 |
| source | MEDLINE; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Public Library of Science (PLoS); PubMed Central; Free Full-Text Journals in Chemistry |
| subjects | Algorithms Collaboration Computer and Information Sciences Computer applications Damage assessment Disasters Earth Sciences Earthquakes Engineering and Technology Evacuations & rescues Flood damage Genetic algorithms Greedy algorithms Laboratories Links Medicine and Health Sciences Native North Americans Physical Sciences Rainstorms Repair Research and Analysis Methods Restoration Roads Roads & highways Scheduling Science Seismic engineering Traffic accidents & safety Traffic congestion Transportation Transportation planning Travel time Traveltime Urban areas Weather Weather conditions |
| title | An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T08%3A42%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Optimal%20Schedule%20for%20Urban%20Road%20Network%20Repair%20Based%20on%20the%20Greedy%20Algorithm&rft.jtitle=PloS%20one&rft.au=Lu,%20Guangquan&rft.date=2016-10-21&rft.volume=11&rft.issue=10&rft.spage=e0164780&rft.epage=e0164780&rft.pages=e0164780-e0164780&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0164780&rft_dat=%3Cgale_plos_%3EA471896218%3C/gale_plos_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1830874599&rft_id=info:pmid/27768732&rft_galeid=A471896218&rft_doaj_id=oai_doaj_org_article_2a624705e837429f8b5f0020b762ea23&rfr_iscdi=true |