A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
This work deals with a dynamic dial-a-ride problem with time window constraints. In particular, new unplanned requests for service may arise at a vehicle stop and the driver must decide in real-time whether to accept or reject them. For this problem, we have developed a two-phase insertion algorithm...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2006-12, Vol.175 (3), p.1605-1615 |
|---|---|
| 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 | 1615 |
|---|---|
| container_issue | 3 |
| container_start_page | 1605 |
| container_title | European journal of operational research |
| container_volume | 175 |
| creator | Coslovich, Luca Pesenti, Raffaele Ukovich, Walter |
| description | This work deals with a dynamic dial-a-ride problem with time window constraints. In particular, new unplanned requests for service may arise at a vehicle stop and the driver must decide in real-time whether to accept or reject them.
For this problem, we have developed a two-phase insertion algorithm based on route perturbations: the first phase, which is run off-line when the vehicle moves between two successive stops, aims at creating a feasible neighborhood of the current route; while the second phase, which is run in real-time every time a new request occurs, inserts, when possible, the delivery stop of the new customer in the current route. |
| doi_str_mv | 10.1016/j.ejor.2005.02.038 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204135166</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221705002262</els_id><sourcerecordid>1155388011</sourcerecordid><originalsourceid>FETCH-LOGICAL-c481t-d1afb70f9343347eb9d62fff37da6eb982ab352a0d024ee4e1a4282684a3971f3</originalsourceid><addsrcrecordid>eNp9UcFq3DAQFaWBbtP-QE-i0KMdjWTLNvQSQtMEUnppDj0JrTRiZdaWK3nT7t93lg3prYLRIPTem6cnxj6AqEGAvhprHFOupRBtLWQtVP-KbaDvZKV7LV6zjVBdV0kJ3Rv2tpRRCAEttBv285qvv1O17GxBHueCeY1p5iu63Rx_HZCnwA8z_lnQrei5O5Q1TZgLDylzy_1xtlN03Ee7r2yVo0e-5LTd4_SOXQS7L_j-uV-yx9svP27uqofvX-9vrh8q1_SwVh5s2HYiDKpRqulwO3gtQwiq81bTqZd2q1pphReyQWwQbCN7qfvGqqGDoC7Zx7MuzSXDZTVjOuSZRhopGlAtaE0geQa5nErJGMyS42Tz0YAwpwTNaE4JmlOCRkhDCRLp25mUkZ7_wkBaBMVinoyy0LW0H6mIqqlFKkW1nC41qYGG1uzWifQ-PTu1xdl9yHZ2sfxz0oMehlYQ7vMZhxTbU8Rsios4O_Qx0zcYn-L_bP8FAICg2A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204135166</pqid></control><display><type>article</type><title>A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Coslovich, Luca ; Pesenti, Raffaele ; Ukovich, Walter</creator><creatorcontrib>Coslovich, Luca ; Pesenti, Raffaele ; Ukovich, Walter</creatorcontrib><description>This work deals with a dynamic dial-a-ride problem with time window constraints. In particular, new unplanned requests for service may arise at a vehicle stop and the driver must decide in real-time whether to accept or reject them.
For this problem, we have developed a two-phase insertion algorithm based on route perturbations: the first phase, which is run off-line when the vehicle moves between two successive stops, aims at creating a feasible neighborhood of the current route; while the second phase, which is run in real-time every time a new request occurs, inserts, when possible, the delivery stop of the new customer in the current route.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2005.02.038</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Dial-a-ride ; Dynamic vehicle routing ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Heuristic ; Insertion heuristics ; Operational research and scientific management ; Operational research. Management science ; Real time ; Route optimization ; Studies ; Transportation</subject><ispartof>European journal of operational research, 2006-12, Vol.175 (3), p.1605-1615</ispartof><rights>2005 Elsevier B.V.</rights><rights>2006 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Dec 16, 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c481t-d1afb70f9343347eb9d62fff37da6eb982ab352a0d024ee4e1a4282684a3971f3</citedby><cites>FETCH-LOGICAL-c481t-d1afb70f9343347eb9d62fff37da6eb982ab352a0d024ee4e1a4282684a3971f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0377221705002262$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>309,310,314,776,780,785,786,3536,3993,23910,23911,25119,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18169950$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a175_3ay_3a2006_3ai_3a3_3ap_3a1605-1615.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Coslovich, Luca</creatorcontrib><creatorcontrib>Pesenti, Raffaele</creatorcontrib><creatorcontrib>Ukovich, Walter</creatorcontrib><title>A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem</title><title>European journal of operational research</title><description>This work deals with a dynamic dial-a-ride problem with time window constraints. In particular, new unplanned requests for service may arise at a vehicle stop and the driver must decide in real-time whether to accept or reject them.
For this problem, we have developed a two-phase insertion algorithm based on route perturbations: the first phase, which is run off-line when the vehicle moves between two successive stops, aims at creating a feasible neighborhood of the current route; while the second phase, which is run in real-time every time a new request occurs, inserts, when possible, the delivery stop of the new customer in the current route.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Dial-a-ride</subject><subject>Dynamic vehicle routing</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Heuristic</subject><subject>Insertion heuristics</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Real time</subject><subject>Route optimization</subject><subject>Studies</subject><subject>Transportation</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>eNp9UcFq3DAQFaWBbtP-QE-i0KMdjWTLNvQSQtMEUnppDj0JrTRiZdaWK3nT7t93lg3prYLRIPTem6cnxj6AqEGAvhprHFOupRBtLWQtVP-KbaDvZKV7LV6zjVBdV0kJ3Rv2tpRRCAEttBv285qvv1O17GxBHueCeY1p5iu63Rx_HZCnwA8z_lnQrei5O5Q1TZgLDylzy_1xtlN03Ee7r2yVo0e-5LTd4_SOXQS7L_j-uV-yx9svP27uqofvX-9vrh8q1_SwVh5s2HYiDKpRqulwO3gtQwiq81bTqZd2q1pphReyQWwQbCN7qfvGqqGDoC7Zx7MuzSXDZTVjOuSZRhopGlAtaE0geQa5nErJGMyS42Tz0YAwpwTNaE4JmlOCRkhDCRLp25mUkZ7_wkBaBMVinoyy0LW0H6mIqqlFKkW1nC41qYGG1uzWifQ-PTu1xdl9yHZ2sfxz0oMehlYQ7vMZhxTbU8Rsios4O_Qx0zcYn-L_bP8FAICg2A</recordid><startdate>20061216</startdate><enddate>20061216</enddate><creator>Coslovich, Luca</creator><creator>Pesenti, Raffaele</creator><creator>Ukovich, Walter</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></search><sort><creationdate>20061216</creationdate><title>A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem</title><author>Coslovich, Luca ; Pesenti, Raffaele ; Ukovich, Walter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c481t-d1afb70f9343347eb9d62fff37da6eb982ab352a0d024ee4e1a4282684a3971f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Dial-a-ride</topic><topic>Dynamic vehicle routing</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Heuristic</topic><topic>Insertion heuristics</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Real time</topic><topic>Route optimization</topic><topic>Studies</topic><topic>Transportation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Coslovich, Luca</creatorcontrib><creatorcontrib>Pesenti, Raffaele</creatorcontrib><creatorcontrib>Ukovich, Walter</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><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Coslovich, Luca</au><au>Pesenti, Raffaele</au><au>Ukovich, Walter</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem</atitle><jtitle>European journal of operational research</jtitle><date>2006-12-16</date><risdate>2006</risdate><volume>175</volume><issue>3</issue><spage>1605</spage><epage>1615</epage><pages>1605-1615</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>This work deals with a dynamic dial-a-ride problem with time window constraints. In particular, new unplanned requests for service may arise at a vehicle stop and the driver must decide in real-time whether to accept or reject them.
For this problem, we have developed a two-phase insertion algorithm based on route perturbations: the first phase, which is run off-line when the vehicle moves between two successive stops, aims at creating a feasible neighborhood of the current route; while the second phase, which is run in real-time every time a new request occurs, inserts, when possible, the delivery stop of the new customer in the current route.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2005.02.038</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2006-12, Vol.175 (3), p.1605-1615 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204135166 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Algorithms Applied sciences Dial-a-ride Dynamic vehicle routing Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Insertion heuristics Operational research and scientific management Operational research. Management science Real time Route optimization Studies Transportation |
| title | A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride 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-25T07%3A07%3A34IST&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=A%20two-phase%20insertion%20technique%20of%20unexpected%20customers%20for%20a%20dynamic%20dial-a-ride%20problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Coslovich,%20Luca&rft.date=2006-12-16&rft.volume=175&rft.issue=3&rft.spage=1605&rft.epage=1615&rft.pages=1605-1615&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2005.02.038&rft_dat=%3Cproquest_cross%3E1155388011%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=204135166&rft_id=info:pmid/&rft_els_id=S0377221705002262&rfr_iscdi=true |