Models for the single-vehicle preemptive pickup and delivery problem
In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer...
Gespeichert in:
| Veröffentlicht in: | Journal of combinatorial optimization 2012-02, Vol.23 (2), p.196-223 |
|---|---|
| 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 | 223 |
|---|---|
| container_issue | 2 |
| container_start_page | 196 |
| container_title | Journal of combinatorial optimization |
| container_volume | 23 |
| creator | Kerivin, H. L. M. Lacroix, M. Mahjoub, A. R. |
| description | In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer linear programs for both the unitary and the general versions. We then show that the associated linear relaxations are polynomial-time solvable and present some computational results. |
| doi_str_mv | 10.1007/s10878-010-9349-z |
| format | Article |
| fullrecord | <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_01497105v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_01497105v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c383t-657f6048ceb8ccefd0d2da4800e782137a26cc004dbf1f13509ae62133710b6b3</originalsourceid><addsrcrecordid>eNp9kD1PwzAYhC0EEqXwA9iyMDAYXn_EdsaqfBSpiAVmy3HsNiVNIrut1P56HAUxMvn03j0n-RC6JfBAAORjJKCkwkAAF4wX-HSGJiSXDFOlxHnSTFEsCsgv0VWMGwBImk_Q03tXuSZmvgvZbu2yWLerxuGDW9e2cVkfnNv2u_qQZG2_931m2ipLRLqEY7K7snHba3ThTRPdze87RV8vz5_zBV5-vL7NZ0tsmWI7LHLpBXBlXamsdb6CilaGKwAnFSVMGiqsBeBV6YknLIfCOJEMJgmUomRTdD_2rk2j-1BvTTjqztR6MVvq4QaEFymbH0jKkjFrQxdjcP4PIKCHyfQ4WWJAD5PpU2LuRqY30ZrGB9PaOv6BNOeScTF00zEXk9WuXNCbbh_a9PV_yn8Ak8x7lw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Models for the single-vehicle preemptive pickup and delivery problem</title><source>SpringerLink Journals - AutoHoldings</source><creator>Kerivin, H. L. M. ; Lacroix, M. ; Mahjoub, A. R.</creator><creatorcontrib>Kerivin, H. L. M. ; Lacroix, M. ; Mahjoub, A. R.</creatorcontrib><description>In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer linear programs for both the unitary and the general versions. We then show that the associated linear relaxations are polynomial-time solvable and present some computational results.</description><identifier>ISSN: 1382-6905</identifier><identifier>EISSN: 1573-2886</identifier><identifier>DOI: 10.1007/s10878-010-9349-z</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Applied sciences ; Combinatorics ; Computer Science ; Convex and Discrete Geometry ; Exact sciences and technology ; Logistics ; Mathematical Modeling and Industrial Mathematics ; Mathematical programming ; Mathematics ; Mathematics and Statistics ; Operational research and scientific management ; Operational research. Management science ; Operations Research/Decision Theory ; Optimization ; Theory of Computation</subject><ispartof>Journal of combinatorial optimization, 2012-02, Vol.23 (2), p.196-223</ispartof><rights>Springer Science+Business Media, LLC 2010</rights><rights>2015 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c383t-657f6048ceb8ccefd0d2da4800e782137a26cc004dbf1f13509ae62133710b6b3</citedby><cites>FETCH-LOGICAL-c383t-657f6048ceb8ccefd0d2da4800e782137a26cc004dbf1f13509ae62133710b6b3</cites><orcidid>0000-0001-8385-3890 ; 0000-0002-1694-7640</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10878-010-9349-z$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10878-010-9349-z$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,314,780,784,885,27923,27924,41487,42556,51318</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25473461$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-01497105$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Kerivin, H. L. M.</creatorcontrib><creatorcontrib>Lacroix, M.</creatorcontrib><creatorcontrib>Mahjoub, A. R.</creatorcontrib><title>Models for the single-vehicle preemptive pickup and delivery problem</title><title>Journal of combinatorial optimization</title><addtitle>J Comb Optim</addtitle><description>In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer linear programs for both the unitary and the general versions. We then show that the associated linear relaxations are polynomial-time solvable and present some computational results.</description><subject>Applied sciences</subject><subject>Combinatorics</subject><subject>Computer Science</subject><subject>Convex and Discrete Geometry</subject><subject>Exact sciences and technology</subject><subject>Logistics</subject><subject>Mathematical Modeling and Industrial Mathematics</subject><subject>Mathematical programming</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Theory of Computation</subject><issn>1382-6905</issn><issn>1573-2886</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kD1PwzAYhC0EEqXwA9iyMDAYXn_EdsaqfBSpiAVmy3HsNiVNIrut1P56HAUxMvn03j0n-RC6JfBAAORjJKCkwkAAF4wX-HSGJiSXDFOlxHnSTFEsCsgv0VWMGwBImk_Q03tXuSZmvgvZbu2yWLerxuGDW9e2cVkfnNv2u_qQZG2_931m2ipLRLqEY7K7snHba3ThTRPdze87RV8vz5_zBV5-vL7NZ0tsmWI7LHLpBXBlXamsdb6CilaGKwAnFSVMGiqsBeBV6YknLIfCOJEMJgmUomRTdD_2rk2j-1BvTTjqztR6MVvq4QaEFymbH0jKkjFrQxdjcP4PIKCHyfQ4WWJAD5PpU2LuRqY30ZrGB9PaOv6BNOeScTF00zEXk9WuXNCbbh_a9PV_yn8Ak8x7lw</recordid><startdate>20120201</startdate><enddate>20120201</enddate><creator>Kerivin, H. L. M.</creator><creator>Lacroix, M.</creator><creator>Mahjoub, A. R.</creator><general>Springer US</general><general>Springer</general><general>Springer Verlag</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0001-8385-3890</orcidid><orcidid>https://orcid.org/0000-0002-1694-7640</orcidid></search><sort><creationdate>20120201</creationdate><title>Models for the single-vehicle preemptive pickup and delivery problem</title><author>Kerivin, H. L. M. ; Lacroix, M. ; Mahjoub, A. R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c383t-657f6048ceb8ccefd0d2da4800e782137a26cc004dbf1f13509ae62133710b6b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Applied sciences</topic><topic>Combinatorics</topic><topic>Computer Science</topic><topic>Convex and Discrete Geometry</topic><topic>Exact sciences and technology</topic><topic>Logistics</topic><topic>Mathematical Modeling and Industrial Mathematics</topic><topic>Mathematical programming</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kerivin, H. L. M.</creatorcontrib><creatorcontrib>Lacroix, M.</creatorcontrib><creatorcontrib>Mahjoub, A. R.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Journal of combinatorial optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kerivin, H. L. M.</au><au>Lacroix, M.</au><au>Mahjoub, A. R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Models for the single-vehicle preemptive pickup and delivery problem</atitle><jtitle>Journal of combinatorial optimization</jtitle><stitle>J Comb Optim</stitle><date>2012-02-01</date><risdate>2012</risdate><volume>23</volume><issue>2</issue><spage>196</spage><epage>223</epage><pages>196-223</pages><issn>1382-6905</issn><eissn>1573-2886</eissn><abstract>In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer linear programs for both the unitary and the general versions. We then show that the associated linear relaxations are polynomial-time solvable and present some computational results.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s10878-010-9349-z</doi><tpages>28</tpages><orcidid>https://orcid.org/0000-0001-8385-3890</orcidid><orcidid>https://orcid.org/0000-0002-1694-7640</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1382-6905 |
| ispartof | Journal of combinatorial optimization, 2012-02, Vol.23 (2), p.196-223 |
| issn | 1382-6905 1573-2886 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_01497105v1 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Applied sciences Combinatorics Computer Science Convex and Discrete Geometry Exact sciences and technology Logistics Mathematical Modeling and Industrial Mathematics Mathematical programming Mathematics Mathematics and Statistics Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Theory of Computation |
| title | Models for the single-vehicle preemptive pickup and delivery 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-08T20%3A02%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Models%20for%20the%20single-vehicle%20preemptive%20pickup%20and%20delivery%20problem&rft.jtitle=Journal%20of%20combinatorial%20optimization&rft.au=Kerivin,%20H.%20L.%20M.&rft.date=2012-02-01&rft.volume=23&rft.issue=2&rft.spage=196&rft.epage=223&rft.pages=196-223&rft.issn=1382-6905&rft.eissn=1573-2886&rft_id=info:doi/10.1007/s10878-010-9349-z&rft_dat=%3Chal_cross%3Eoai_HAL_hal_01497105v1%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |