GRASP algorithms for the robust railway network design problem
This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competin...
Gespeichert in:
| Veröffentlicht in: | Journal of heuristics 2013-04, Vol.19 (2), p.399-422 |
|---|---|
| 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 | 422 |
|---|---|
| container_issue | 2 |
| container_start_page | 399 |
| container_title | Journal of heuristics |
| container_volume | 19 |
| creator | García-Archilla, Bosco Lozano, Antonio J. Mesa, Juan A. Perea, Federico |
| description | This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems. |
| doi_str_mv | 10.1007/s10732-011-9185-z |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1319485757</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2927059541</sourcerecordid><originalsourceid>FETCH-LOGICAL-c425t-56413b70913f4db49413de557cac09fa0f79ae21742fa3770a12a98f6fafb65e3</originalsourceid><addsrcrecordid>eNp1kE1LAzEQhoMoWKs_wFvAc3Qm2TSbi1CKVqGg-HEO2W3Sbt3u1mRLaX-9KevBi6eZYd4PeAi5RrhFAHUXEZTgDBCZxlyywwkZoFScaaHVadpFjgy5wHNyEeMKAHQuxYDcT9_G76_U1os2VN1yHalvA-2Wjoa22MaOBlvVO7unjet2bfiicxerRUM36V279SU587aO7up3Dsnn48PH5InNXqbPk_GMlRmXHZOjDEWhQKPw2bzIdDrnTkpV2hK0t-CVto6jyri3QimwyK3O_chbX4ykE0Ny0-em3u-ti51ZtdvQpEqDAnWWSyVVUmGvKkMbY3DebEK1tmFvEMwRk-kxmYTJHDGZQ_Lw3hOTtlm48Cf5X9MP7wFqag</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1319485757</pqid></control><display><type>article</type><title>GRASP algorithms for the robust railway network design problem</title><source>SpringerLink Journals - AutoHoldings</source><creator>García-Archilla, Bosco ; Lozano, Antonio J. ; Mesa, Juan A. ; Perea, Federico</creator><creatorcontrib>García-Archilla, Bosco ; Lozano, Antonio J. ; Mesa, Juan A. ; Perea, Federico</creatorcontrib><description>This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems.</description><identifier>ISSN: 1381-1231</identifier><identifier>EISSN: 1572-9397</identifier><identifier>DOI: 10.1007/s10732-011-9185-z</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithms ; Artificial Intelligence ; Calculus of Variations and Optimal Control; Optimization ; Cost control ; Design ; Expected utility ; Heuristic ; Infrastructure ; Linear programming ; Management Science ; Mathematics ; Mathematics and Statistics ; Operations Research ; Operations Research/Decision Theory ; Railway networks ; Studies ; Travel ; Utility functions</subject><ispartof>Journal of heuristics, 2013-04, Vol.19 (2), p.399-422</ispartof><rights>Springer Science+Business Media, LLC 2011</rights><rights>Springer Science+Business Media New York 2013</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c425t-56413b70913f4db49413de557cac09fa0f79ae21742fa3770a12a98f6fafb65e3</citedby><cites>FETCH-LOGICAL-c425t-56413b70913f4db49413de557cac09fa0f79ae21742fa3770a12a98f6fafb65e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10732-011-9185-z$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10732-011-9185-z$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>García-Archilla, Bosco</creatorcontrib><creatorcontrib>Lozano, Antonio J.</creatorcontrib><creatorcontrib>Mesa, Juan A.</creatorcontrib><creatorcontrib>Perea, Federico</creatorcontrib><title>GRASP algorithms for the robust railway network design problem</title><title>Journal of heuristics</title><addtitle>J Heuristics</addtitle><description>This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Cost control</subject><subject>Design</subject><subject>Expected utility</subject><subject>Heuristic</subject><subject>Infrastructure</subject><subject>Linear programming</subject><subject>Management Science</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Operations Research</subject><subject>Operations Research/Decision Theory</subject><subject>Railway networks</subject><subject>Studies</subject><subject>Travel</subject><subject>Utility functions</subject><issn>1381-1231</issn><issn>1572-9397</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kE1LAzEQhoMoWKs_wFvAc3Qm2TSbi1CKVqGg-HEO2W3Sbt3u1mRLaX-9KevBi6eZYd4PeAi5RrhFAHUXEZTgDBCZxlyywwkZoFScaaHVadpFjgy5wHNyEeMKAHQuxYDcT9_G76_U1os2VN1yHalvA-2Wjoa22MaOBlvVO7unjet2bfiicxerRUM36V279SU587aO7up3Dsnn48PH5InNXqbPk_GMlRmXHZOjDEWhQKPw2bzIdDrnTkpV2hK0t-CVto6jyri3QimwyK3O_chbX4ykE0Ny0-em3u-ti51ZtdvQpEqDAnWWSyVVUmGvKkMbY3DebEK1tmFvEMwRk-kxmYTJHDGZQ_Lw3hOTtlm48Cf5X9MP7wFqag</recordid><startdate>20130401</startdate><enddate>20130401</enddate><creator>García-Archilla, Bosco</creator><creator>Lozano, Antonio J.</creator><creator>Mesa, Juan A.</creator><creator>Perea, Federico</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20130401</creationdate><title>GRASP algorithms for the robust railway network design problem</title><author>García-Archilla, Bosco ; Lozano, Antonio J. ; Mesa, Juan A. ; Perea, Federico</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c425t-56413b70913f4db49413de557cac09fa0f79ae21742fa3770a12a98f6fafb65e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Cost control</topic><topic>Design</topic><topic>Expected utility</topic><topic>Heuristic</topic><topic>Infrastructure</topic><topic>Linear programming</topic><topic>Management Science</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Operations Research</topic><topic>Operations Research/Decision Theory</topic><topic>Railway networks</topic><topic>Studies</topic><topic>Travel</topic><topic>Utility functions</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>García-Archilla, Bosco</creatorcontrib><creatorcontrib>Lozano, Antonio J.</creatorcontrib><creatorcontrib>Mesa, Juan A.</creatorcontrib><creatorcontrib>Perea, Federico</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of heuristics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>García-Archilla, Bosco</au><au>Lozano, Antonio J.</au><au>Mesa, Juan A.</au><au>Perea, Federico</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>GRASP algorithms for the robust railway network design problem</atitle><jtitle>Journal of heuristics</jtitle><stitle>J Heuristics</stitle><date>2013-04-01</date><risdate>2013</risdate><volume>19</volume><issue>2</issue><spage>399</spage><epage>422</epage><pages>399-422</pages><issn>1381-1231</issn><eissn>1572-9397</eissn><abstract>This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s10732-011-9185-z</doi><tpages>24</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1381-1231 |
| ispartof | Journal of heuristics, 2013-04, Vol.19 (2), p.399-422 |
| issn | 1381-1231 1572-9397 |
| language | eng |
| recordid | cdi_proquest_journals_1319485757 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Artificial Intelligence Calculus of Variations and Optimal Control Optimization Cost control Design Expected utility Heuristic Infrastructure Linear programming Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Railway networks Studies Travel Utility functions |
| title | GRASP algorithms for the robust railway network design problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T20%3A53%3A28IST&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=GRASP%20algorithms%20for%20the%20robust%20railway%20network%20design%20problem&rft.jtitle=Journal%20of%20heuristics&rft.au=Garc%C3%ADa-Archilla,%20Bosco&rft.date=2013-04-01&rft.volume=19&rft.issue=2&rft.spage=399&rft.epage=422&rft.pages=399-422&rft.issn=1381-1231&rft.eissn=1572-9397&rft_id=info:doi/10.1007/s10732-011-9185-z&rft_dat=%3Cproquest_cross%3E2927059541%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=1319485757&rft_id=info:pmid/&rfr_iscdi=true |