A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
This paper presents a heuristic, which concentrates on solving a large-scale static dial-a-ride problem bearing complex constraints. In this heuristic, a properly organized local search strategy and a diversification strategy are used to improve initial solutions. Then the improved solutions can be...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2006-10, Vol.174 (2), p.1117-1139 |
|---|---|
| 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 | 1139 |
|---|---|
| container_issue | 2 |
| container_start_page | 1117 |
| container_title | European journal of operational research |
| container_volume | 174 |
| creator | Xiang, Zhihai Chu, Chengbin Chen, Haoxun |
| description | This paper presents a heuristic, which concentrates on solving a large-scale static dial-a-ride problem bearing complex constraints. In this heuristic, a properly organized local search strategy and a diversification strategy are used to improve initial solutions. Then the improved solutions can be refined further by an intensification strategy. The performance of this heuristic was evaluated by intensive computational tests on some randomly generated instances. Small gaps to the lower bounds from the column generation method were obtained in very short time for instances with no more than 200 requests. Although the result is not sensitive to the initial solution, the computational time can be greatly reduced if some effort is spent to construct a good initial solution. With this good initial solution, larger instances up to 2000 requests were solved in less than 10
hours on a popular personal computer. |
| doi_str_mv | 10.1016/j.ejor.2004.09.060 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_02476070v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221705003346</els_id><sourcerecordid>1151409921</sourcerecordid><originalsourceid>FETCH-LOGICAL-c515t-d0d40d9c625bd01615cdf2628b12f77e2845c224d6369e04e2cc3b357a28174a3</originalsourceid><addsrcrecordid>eNp9kcGL1DAUxosoOK7-A56C4MFD68trm7TgZVjUFUa86DlkktedlE5bk87g_ve-0mW9GUheSH7f48uXLHsroZAg1ce-oH6KBQJUBbQFKHiW7WSjMVeNgufZDkqtc0SpX2avUuoBQNay3mVmLzqbFnGiSwxpCU50UxRpGq5hvBdWDDbeU56cHUikxa6AD3bIbR6DJzHH6TjQWVxGT1G46TwP9IfrmJZow7ik19mLzg6J3jzWm-zXl88_b-_yw4-v3273h9yxjSX34CvwrVNYHz0_SNbOd6iwOUrstCZsqtohVl6VqiWoCJ0rj2WtLTZSV7a8yT5sfU92MHMMZxsfzGSDudsfzHoGWGkFGq6S2Xcby-5_Xygtpp8ucWR7BqGSDbYaGMINcnFKKVL31FWCWTM3vVkzN2vmBlrDmbPo-yaKNJN7UhAPRimZqykt--X1gSdLFZewbnnO66WU2khZtua0nLnf-0endv2CLtrRhfTPiW5blBKZ-7RxxBFfA0WTXKDRkQ-R3GL8FP5n-y_ciq_L</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204182970</pqid></control><display><type>article</type><title>A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints</title><source>RePEc</source><source>Access via ScienceDirect (Elsevier)</source><creator>Xiang, Zhihai ; Chu, Chengbin ; Chen, Haoxun</creator><creatorcontrib>Xiang, Zhihai ; Chu, Chengbin ; Chen, Haoxun</creatorcontrib><description>This paper presents a heuristic, which concentrates on solving a large-scale static dial-a-ride problem bearing complex constraints. In this heuristic, a properly organized local search strategy and a diversification strategy are used to improve initial solutions. Then the improved solutions can be refined further by an intensification strategy. The performance of this heuristic was evaluated by intensive computational tests on some randomly generated instances. Small gaps to the lower bounds from the column generation method were obtained in very short time for instances with no more than 200 requests. Although the result is not sensitive to the initial solution, the computational time can be greatly reduced if some effort is spent to construct a good initial solution. With this good initial solution, larger instances up to 2000 requests were solved in less than 10
hours on a popular personal computer.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2004.09.060</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Computer Science ; Dial-a-ride problem ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Heuristic ; Heuristics ; Operational research and scientific management ; Operational research. Management science ; Operations Research ; Route optimization ; Studies ; Transportation ; Vehicle routing problem</subject><ispartof>European journal of operational research, 2006-10, Vol.174 (2), p.1117-1139</ispartof><rights>2005 Elsevier B.V.</rights><rights>2006 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Oct 16, 2006</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c515t-d0d40d9c625bd01615cdf2628b12f77e2845c224d6369e04e2cc3b357a28174a3</citedby><cites>FETCH-LOGICAL-c515t-d0d40d9c625bd01615cdf2628b12f77e2845c224d6369e04e2cc3b357a28174a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ejor.2004.09.060$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,780,784,885,3550,4008,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17992112$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a174_3ay_3a2006_3ai_3a2_3ap_3a1117-1139.htm$$DView record in RePEc$$Hfree_for_read</backlink><backlink>$$Uhttps://utt.hal.science/hal-02476070$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Xiang, Zhihai</creatorcontrib><creatorcontrib>Chu, Chengbin</creatorcontrib><creatorcontrib>Chen, Haoxun</creatorcontrib><title>A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints</title><title>European journal of operational research</title><description>This paper presents a heuristic, which concentrates on solving a large-scale static dial-a-ride problem bearing complex constraints. In this heuristic, a properly organized local search strategy and a diversification strategy are used to improve initial solutions. Then the improved solutions can be refined further by an intensification strategy. The performance of this heuristic was evaluated by intensive computational tests on some randomly generated instances. Small gaps to the lower bounds from the column generation method were obtained in very short time for instances with no more than 200 requests. Although the result is not sensitive to the initial solution, the computational time can be greatly reduced if some effort is spent to construct a good initial solution. With this good initial solution, larger instances up to 2000 requests were solved in less than 10
hours on a popular personal computer.</description><subject>Applied sciences</subject><subject>Computer Science</subject><subject>Dial-a-ride problem</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations Research</subject><subject>Route optimization</subject><subject>Studies</subject><subject>Transportation</subject><subject>Vehicle routing problem</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9kcGL1DAUxosoOK7-A56C4MFD68trm7TgZVjUFUa86DlkktedlE5bk87g_ve-0mW9GUheSH7f48uXLHsroZAg1ce-oH6KBQJUBbQFKHiW7WSjMVeNgufZDkqtc0SpX2avUuoBQNay3mVmLzqbFnGiSwxpCU50UxRpGq5hvBdWDDbeU56cHUikxa6AD3bIbR6DJzHH6TjQWVxGT1G46TwP9IfrmJZow7ik19mLzg6J3jzWm-zXl88_b-_yw4-v3273h9yxjSX34CvwrVNYHz0_SNbOd6iwOUrstCZsqtohVl6VqiWoCJ0rj2WtLTZSV7a8yT5sfU92MHMMZxsfzGSDudsfzHoGWGkFGq6S2Xcby-5_Xygtpp8ucWR7BqGSDbYaGMINcnFKKVL31FWCWTM3vVkzN2vmBlrDmbPo-yaKNJN7UhAPRimZqykt--X1gSdLFZewbnnO66WU2khZtua0nLnf-0endv2CLtrRhfTPiW5blBKZ-7RxxBFfA0WTXKDRkQ-R3GL8FP5n-y_ciq_L</recordid><startdate>20061016</startdate><enddate>20061016</enddate><creator>Xiang, Zhihai</creator><creator>Chu, Chengbin</creator><creator>Chen, Haoxun</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope></search><sort><creationdate>20061016</creationdate><title>A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints</title><author>Xiang, Zhihai ; Chu, Chengbin ; Chen, Haoxun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c515t-d0d40d9c625bd01615cdf2628b12f77e2845c224d6369e04e2cc3b357a28174a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer Science</topic><topic>Dial-a-ride problem</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations Research</topic><topic>Route optimization</topic><topic>Studies</topic><topic>Transportation</topic><topic>Vehicle routing problem</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Xiang, Zhihai</creatorcontrib><creatorcontrib>Chu, Chengbin</creatorcontrib><creatorcontrib>Chen, Haoxun</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering 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><collection>Hyper Article en Ligne (HAL)</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Xiang, Zhihai</au><au>Chu, Chengbin</au><au>Chen, Haoxun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints</atitle><jtitle>European journal of operational research</jtitle><date>2006-10-16</date><risdate>2006</risdate><volume>174</volume><issue>2</issue><spage>1117</spage><epage>1139</epage><pages>1117-1139</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>This paper presents a heuristic, which concentrates on solving a large-scale static dial-a-ride problem bearing complex constraints. In this heuristic, a properly organized local search strategy and a diversification strategy are used to improve initial solutions. Then the improved solutions can be refined further by an intensification strategy. The performance of this heuristic was evaluated by intensive computational tests on some randomly generated instances. Small gaps to the lower bounds from the column generation method were obtained in very short time for instances with no more than 200 requests. Although the result is not sensitive to the initial solution, the computational time can be greatly reduced if some effort is spent to construct a good initial solution. With this good initial solution, larger instances up to 2000 requests were solved in less than 10
hours on a popular personal computer.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2004.09.060</doi><tpages>23</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2006-10, Vol.174 (2), p.1117-1139 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_02476070v1 |
| source | RePEc; Access via ScienceDirect (Elsevier) |
| subjects | Applied sciences Computer Science Dial-a-ride problem Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Heuristics Operational research and scientific management Operational research. Management science Operations Research Route optimization Studies Transportation Vehicle routing problem |
| title | A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T19%3A43%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20fast%20heuristic%20for%20solving%20a%20large-scale%20static%20dial-a-ride%20problem%20under%20complex%20constraints&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Xiang,%20Zhihai&rft.date=2006-10-16&rft.volume=174&rft.issue=2&rft.spage=1117&rft.epage=1139&rft.pages=1117-1139&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2004.09.060&rft_dat=%3Cproquest_hal_p%3E1151409921%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204182970&rft_id=info:pmid/&rft_els_id=S0377221705003346&rfr_iscdi=true |