An exact bidirectional pulse algorithm for the constrained shortest path
A constrained shortest path is a minimum‐cost sequence of arcs on a directed network that satisfies knapsack‐type constraints on the resource consumption over the arcs. We propose an exact method based on a recursive depth‐first search procedure known as the pulse algorithm (PA). One of the key cont...
Gespeichert in:
| Veröffentlicht in: | Networks 2020-09, Vol.76 (2), p.128-146 |
|---|---|
| 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 | 146 |
|---|---|
| container_issue | 2 |
| container_start_page | 128 |
| container_title | Networks |
| container_volume | 76 |
| creator | Cabrera, Nicolás Medaglia, Andrés L. Lozano, Leonardo Duque, Daniel |
| description | A constrained shortest path is a minimum‐cost sequence of arcs on a directed network that satisfies knapsack‐type constraints on the resource consumption over the arcs. We propose an exact method based on a recursive depth‐first search procedure known as the pulse algorithm (PA). One of the key contributions of the proposal lies in a bidirectional search strategy leveraged on parallelism. In addition, we developed a pulse‐based heuristic that quickly finds near‐optimal solutions and shows great potential for column generation (CG) schemes. We present computational experiments over large real‐road networks with up to 6 million nodes and 15 million arcs. We illustrate the use of the bidirectional PA in a CG scheme to solve a multi‐activity shift scheduling problem, where the pricing problem is modeled as a constrained‐shortest path with multiple resource constraints. |
| doi_str_mv | 10.1002/net.21960 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2430273232</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2430273232</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3320-781e8ad80226a6818d6c8ce5792511329a8ba496acddbfb9f803cd71deebdaf73</originalsourceid><addsrcrecordid>eNp1kLFOwzAQhi0EEqUw8AaWmBjSnu0mdsaqKi1SBUuZLcd2iKs0DrYr6NsTCCu64Yb7_rvTh9A9gRkBoPPOphklZQEXaEKg5BkA45doMsxExmCRX6ObGA8AhORETNB22WH7pXTClTMuWJ2c71SL-1MbLVbtuw8uNUdc-4BTY7H2XUxBuc4aHBsfko0J9yo1t-iqVkPm7q9P0dvTer_aZrvXzfNqucs0YxQyLogVygigtFCFIMIUWmib85LmhDBaKlGpRVkobUxVV2UtgGnDibG2MqrmbIoexr198B-n4bo8-FMYXo6SLhhQzuhQU_Q4Ujr4GIOtZR_cUYWzJCB_RMlBlPwVNbDzkf10rT3_D8qX9X5MfAP7n2qG</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2430273232</pqid></control><display><type>article</type><title>An exact bidirectional pulse algorithm for the constrained shortest path</title><source>Wiley Online Library All Journals</source><creator>Cabrera, Nicolás ; Medaglia, Andrés L. ; Lozano, Leonardo ; Duque, Daniel</creator><creatorcontrib>Cabrera, Nicolás ; Medaglia, Andrés L. ; Lozano, Leonardo ; Duque, Daniel</creatorcontrib><description>A constrained shortest path is a minimum‐cost sequence of arcs on a directed network that satisfies knapsack‐type constraints on the resource consumption over the arcs. We propose an exact method based on a recursive depth‐first search procedure known as the pulse algorithm (PA). One of the key contributions of the proposal lies in a bidirectional search strategy leveraged on parallelism. In addition, we developed a pulse‐based heuristic that quickly finds near‐optimal solutions and shows great potential for column generation (CG) schemes. We present computational experiments over large real‐road networks with up to 6 million nodes and 15 million arcs. We illustrate the use of the bidirectional PA in a CG scheme to solve a multi‐activity shift scheduling problem, where the pricing problem is modeled as a constrained‐shortest path with multiple resource constraints.</description><identifier>ISSN: 0028-3045</identifier><identifier>EISSN: 1097-0037</identifier><identifier>DOI: 10.1002/net.21960</identifier><language>eng</language><publisher>Hoboken, USA: John Wiley & Sons, Inc</publisher><subject>Algorithms ; bidirectional search ; constrained shortest path ; Constraints ; large‐scale networks ; Recursive methods ; Roads ; Shortest-path problems</subject><ispartof>Networks, 2020-09, Vol.76 (2), p.128-146</ispartof><rights>2020 Wiley Periodicals LLC.</rights><rights>2020 Wiley Periodicals LLC</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3320-781e8ad80226a6818d6c8ce5792511329a8ba496acddbfb9f803cd71deebdaf73</citedby><cites>FETCH-LOGICAL-c3320-781e8ad80226a6818d6c8ce5792511329a8ba496acddbfb9f803cd71deebdaf73</cites><orcidid>0000-0003-3364-9597 ; 0000-0003-1529-0322</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnet.21960$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnet.21960$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Cabrera, Nicolás</creatorcontrib><creatorcontrib>Medaglia, Andrés L.</creatorcontrib><creatorcontrib>Lozano, Leonardo</creatorcontrib><creatorcontrib>Duque, Daniel</creatorcontrib><title>An exact bidirectional pulse algorithm for the constrained shortest path</title><title>Networks</title><description>A constrained shortest path is a minimum‐cost sequence of arcs on a directed network that satisfies knapsack‐type constraints on the resource consumption over the arcs. We propose an exact method based on a recursive depth‐first search procedure known as the pulse algorithm (PA). One of the key contributions of the proposal lies in a bidirectional search strategy leveraged on parallelism. In addition, we developed a pulse‐based heuristic that quickly finds near‐optimal solutions and shows great potential for column generation (CG) schemes. We present computational experiments over large real‐road networks with up to 6 million nodes and 15 million arcs. We illustrate the use of the bidirectional PA in a CG scheme to solve a multi‐activity shift scheduling problem, where the pricing problem is modeled as a constrained‐shortest path with multiple resource constraints.</description><subject>Algorithms</subject><subject>bidirectional search</subject><subject>constrained shortest path</subject><subject>Constraints</subject><subject>large‐scale networks</subject><subject>Recursive methods</subject><subject>Roads</subject><subject>Shortest-path problems</subject><issn>0028-3045</issn><issn>1097-0037</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp1kLFOwzAQhi0EEqUw8AaWmBjSnu0mdsaqKi1SBUuZLcd2iKs0DrYr6NsTCCu64Yb7_rvTh9A9gRkBoPPOphklZQEXaEKg5BkA45doMsxExmCRX6ObGA8AhORETNB22WH7pXTClTMuWJ2c71SL-1MbLVbtuw8uNUdc-4BTY7H2XUxBuc4aHBsfko0J9yo1t-iqVkPm7q9P0dvTer_aZrvXzfNqucs0YxQyLogVygigtFCFIMIUWmib85LmhDBaKlGpRVkobUxVV2UtgGnDibG2MqrmbIoexr198B-n4bo8-FMYXo6SLhhQzuhQU_Q4Ujr4GIOtZR_cUYWzJCB_RMlBlPwVNbDzkf10rT3_D8qX9X5MfAP7n2qG</recordid><startdate>202009</startdate><enddate>202009</enddate><creator>Cabrera, Nicolás</creator><creator>Medaglia, Andrés L.</creator><creator>Lozano, Leonardo</creator><creator>Duque, Daniel</creator><general>John Wiley & Sons, Inc</general><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-3364-9597</orcidid><orcidid>https://orcid.org/0000-0003-1529-0322</orcidid></search><sort><creationdate>202009</creationdate><title>An exact bidirectional pulse algorithm for the constrained shortest path</title><author>Cabrera, Nicolás ; Medaglia, Andrés L. ; Lozano, Leonardo ; Duque, Daniel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3320-781e8ad80226a6818d6c8ce5792511329a8ba496acddbfb9f803cd71deebdaf73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>bidirectional search</topic><topic>constrained shortest path</topic><topic>Constraints</topic><topic>large‐scale networks</topic><topic>Recursive methods</topic><topic>Roads</topic><topic>Shortest-path problems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cabrera, Nicolás</creatorcontrib><creatorcontrib>Medaglia, Andrés L.</creatorcontrib><creatorcontrib>Lozano, Leonardo</creatorcontrib><creatorcontrib>Duque, Daniel</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cabrera, Nicolás</au><au>Medaglia, Andrés L.</au><au>Lozano, Leonardo</au><au>Duque, Daniel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An exact bidirectional pulse algorithm for the constrained shortest path</atitle><jtitle>Networks</jtitle><date>2020-09</date><risdate>2020</risdate><volume>76</volume><issue>2</issue><spage>128</spage><epage>146</epage><pages>128-146</pages><issn>0028-3045</issn><eissn>1097-0037</eissn><abstract>A constrained shortest path is a minimum‐cost sequence of arcs on a directed network that satisfies knapsack‐type constraints on the resource consumption over the arcs. We propose an exact method based on a recursive depth‐first search procedure known as the pulse algorithm (PA). One of the key contributions of the proposal lies in a bidirectional search strategy leveraged on parallelism. In addition, we developed a pulse‐based heuristic that quickly finds near‐optimal solutions and shows great potential for column generation (CG) schemes. We present computational experiments over large real‐road networks with up to 6 million nodes and 15 million arcs. We illustrate the use of the bidirectional PA in a CG scheme to solve a multi‐activity shift scheduling problem, where the pricing problem is modeled as a constrained‐shortest path with multiple resource constraints.</abstract><cop>Hoboken, USA</cop><pub>John Wiley & Sons, Inc</pub><doi>10.1002/net.21960</doi><tpages>37</tpages><orcidid>https://orcid.org/0000-0003-3364-9597</orcidid><orcidid>https://orcid.org/0000-0003-1529-0322</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0028-3045 |
| ispartof | Networks, 2020-09, Vol.76 (2), p.128-146 |
| issn | 0028-3045 1097-0037 |
| language | eng |
| recordid | cdi_proquest_journals_2430273232 |
| source | Wiley Online Library All Journals |
| subjects | Algorithms bidirectional search constrained shortest path Constraints large‐scale networks Recursive methods Roads Shortest-path problems |
| title | An exact bidirectional pulse algorithm for the constrained shortest path |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T13%3A49%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20exact%20bidirectional%20pulse%20algorithm%20for%20the%20constrained%20shortest%20path&rft.jtitle=Networks&rft.au=Cabrera,%20Nicol%C3%A1s&rft.date=2020-09&rft.volume=76&rft.issue=2&rft.spage=128&rft.epage=146&rft.pages=128-146&rft.issn=0028-3045&rft.eissn=1097-0037&rft_id=info:doi/10.1002/net.21960&rft_dat=%3Cproquest_cross%3E2430273232%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2430273232&rft_id=info:pmid/&rfr_iscdi=true |