A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
This article describes a tabu search heuristic for the vehicle routing problem with backhauls and time windows. In this problem, the set of customers is partitioned into two subsets: linehaul customers where a given quantity of goods is delivered from a central depot, and backhaul customers where a...
Gespeichert in:
| Veröffentlicht in: | Transportation Science 1997-02, Vol.31 (1), p.49-59 |
|---|---|
| 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 | 59 |
|---|---|
| container_issue | 1 |
| container_start_page | 49 |
| container_title | Transportation Science |
| container_volume | 31 |
| creator | Duhamel, Christophe Potvin, Jean-Yves Rousseau, Jean-Marc |
| description | This article describes a tabu search heuristic for the vehicle routing problem with backhauls and time windows. In this problem, the set of customers is partitioned into two subsets: linehaul customers where a given quantity of goods is delivered from a central depot, and backhaul customers where a given quantity of goods is collected and transported to the depot. Mixed routes with both linehaul and backhaul customers are constructed. A variant of this problem is examined where linehauls must precede bachhauls on each route. Furthermore, the time of beginning of service at each customer location must occur within a particular time interval. Computational results are reported on a standard set of test problems, and comparisons are made with other heuristic approaches and with optimal solutions. |
| doi_str_mv | 10.1287/trsc.31.1.49 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_hal_p</sourceid><recordid>TN_cdi_proquest_miscellaneous_839060587</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>25768751</jstor_id><sourcerecordid>25768751</sourcerecordid><originalsourceid>FETCH-LOGICAL-c418t-a3f9a19398c5a0be74aa3e1f5c6e17a3574f4ef1c900233e00f1bd3e226ff3e3</originalsourceid><addsrcrecordid>eNqFkM2P0zAQxSMEEmXhxhXJBySElhRPbMfJsaxYilQJBBV7tKbueOMlH7u2Q8V_T6qUcuQ00szvvZl5WfYS-BKKSr9PIdqlgCUsZf0oW4AqylxJqR9nC84l5FAq9TR7FuMd56A0qEV2s2Jb3I3sO2GwDVvTGHxM3jI3BJYaYj-o8bYl9m0Yk-9v2dcw7Frq2MGnhn1A-7PBsY0M-z3b-o7Yje_3wyE-z544bCO9ONWLbHv9cXu1zjdfPn2-Wm1yK6FKOQpXI9SirqxCviMtEQWBU7Yk0CiUlk6SA1tzXghBnDvY7QUVRemcIHGRvZ1tG2zNffAdht9mQG_Wq4059ngBdam0-AUT-2Zm78PwMFJMpvPRUttiT8MYTSVqXnJV6Yl8N5M2DDEGcmdr4OaYtDkmbQQYMLKe8NcnY4wWWxewtz6eNUUpQVXVhL2asbuYhvBvrHRZaXW873Ke-34Kv4v_W3r6pvG3zcEHMn9ladofrT-TfwBNiKPX</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>839060587</pqid></control><display><type>article</type><title>A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows</title><source>Informs</source><source>Business Source Complete</source><source>Jstor Complete Legacy</source><creator>Duhamel, Christophe ; Potvin, Jean-Yves ; Rousseau, Jean-Marc</creator><creatorcontrib>Duhamel, Christophe ; Potvin, Jean-Yves ; Rousseau, Jean-Marc</creatorcontrib><description>This article describes a tabu search heuristic for the vehicle routing problem with backhauls and time windows. In this problem, the set of customers is partitioned into two subsets: linehaul customers where a given quantity of goods is delivered from a central depot, and backhaul customers where a given quantity of goods is collected and transported to the depot. Mixed routes with both linehaul and backhaul customers are constructed. A variant of this problem is examined where linehauls must precede bachhauls on each route. Furthermore, the time of beginning of service at each customer location must occur within a particular time interval. Computational results are reported on a standard set of test problems, and comparisons are made with other heuristic approaches and with optimal solutions.</description><identifier>ISSN: 0041-1655</identifier><identifier>EISSN: 1526-5447</identifier><identifier>DOI: 10.1287/trsc.31.1.49</identifier><identifier>CODEN: TRSCBJ</identifier><language>eng</language><publisher>Linthicum, MD: INFORMS</publisher><subject>Algorithms ; Applied sciences ; Back haul ; Computer Science ; Exact sciences and technology ; Genetic algorithms ; Ground, air and sea transportation, marine construction ; Heuristics ; Operations Research ; Road transportation and traffic ; Scheduling ; Taboos ; Tabu search ; Temporal dimension ; Time windows ; Transport economics ; Transport infrastructure ; Vehicles ; Vertices</subject><ispartof>Transportation Science, 1997-02, Vol.31 (1), p.49-59</ispartof><rights>Copyright © 1997 Institute for Operations Research and Management Science</rights><rights>1997 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-c418t-a3f9a19398c5a0be74aa3e1f5c6e17a3574f4ef1c900233e00f1bd3e226ff3e3</citedby><orcidid>0000-0001-6522-7343</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/25768751$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/trsc.31.1.49$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,777,781,800,882,3679,27905,27906,57998,58231,62595</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2641588$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-02196573$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Duhamel, Christophe</creatorcontrib><creatorcontrib>Potvin, Jean-Yves</creatorcontrib><creatorcontrib>Rousseau, Jean-Marc</creatorcontrib><title>A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows</title><title>Transportation Science</title><description>This article describes a tabu search heuristic for the vehicle routing problem with backhauls and time windows. In this problem, the set of customers is partitioned into two subsets: linehaul customers where a given quantity of goods is delivered from a central depot, and backhaul customers where a given quantity of goods is collected and transported to the depot. Mixed routes with both linehaul and backhaul customers are constructed. A variant of this problem is examined where linehauls must precede bachhauls on each route. Furthermore, the time of beginning of service at each customer location must occur within a particular time interval. Computational results are reported on a standard set of test problems, and comparisons are made with other heuristic approaches and with optimal solutions.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Back haul</subject><subject>Computer Science</subject><subject>Exact sciences and technology</subject><subject>Genetic algorithms</subject><subject>Ground, air and sea transportation, marine construction</subject><subject>Heuristics</subject><subject>Operations Research</subject><subject>Road transportation and traffic</subject><subject>Scheduling</subject><subject>Taboos</subject><subject>Tabu search</subject><subject>Temporal dimension</subject><subject>Time windows</subject><subject>Transport economics</subject><subject>Transport infrastructure</subject><subject>Vehicles</subject><subject>Vertices</subject><issn>0041-1655</issn><issn>1526-5447</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNqFkM2P0zAQxSMEEmXhxhXJBySElhRPbMfJsaxYilQJBBV7tKbueOMlH7u2Q8V_T6qUcuQ00szvvZl5WfYS-BKKSr9PIdqlgCUsZf0oW4AqylxJqR9nC84l5FAq9TR7FuMd56A0qEV2s2Jb3I3sO2GwDVvTGHxM3jI3BJYaYj-o8bYl9m0Yk-9v2dcw7Frq2MGnhn1A-7PBsY0M-z3b-o7Yje_3wyE-z544bCO9ONWLbHv9cXu1zjdfPn2-Wm1yK6FKOQpXI9SirqxCviMtEQWBU7Yk0CiUlk6SA1tzXghBnDvY7QUVRemcIHGRvZ1tG2zNffAdht9mQG_Wq4059ngBdam0-AUT-2Zm78PwMFJMpvPRUttiT8MYTSVqXnJV6Yl8N5M2DDEGcmdr4OaYtDkmbQQYMLKe8NcnY4wWWxewtz6eNUUpQVXVhL2asbuYhvBvrHRZaXW873Ke-34Kv4v_W3r6pvG3zcEHMn9ladofrT-TfwBNiKPX</recordid><startdate>19970201</startdate><enddate>19970201</enddate><creator>Duhamel, Christophe</creator><creator>Potvin, Jean-Yves</creator><creator>Rousseau, Jean-Marc</creator><general>INFORMS</general><general>Transportation Science Section of the Operations Research Society of America</general><general>Institute for Operations Research and the Management Sciences</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8BJ</scope><scope>FQK</scope><scope>JBE</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0001-6522-7343</orcidid></search><sort><creationdate>19970201</creationdate><title>A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows</title><author>Duhamel, Christophe ; Potvin, Jean-Yves ; Rousseau, Jean-Marc</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c418t-a3f9a19398c5a0be74aa3e1f5c6e17a3574f4ef1c900233e00f1bd3e226ff3e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Back haul</topic><topic>Computer Science</topic><topic>Exact sciences and technology</topic><topic>Genetic algorithms</topic><topic>Ground, air and sea transportation, marine construction</topic><topic>Heuristics</topic><topic>Operations Research</topic><topic>Road transportation and traffic</topic><topic>Scheduling</topic><topic>Taboos</topic><topic>Tabu search</topic><topic>Temporal dimension</topic><topic>Time windows</topic><topic>Transport economics</topic><topic>Transport infrastructure</topic><topic>Vehicles</topic><topic>Vertices</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Duhamel, Christophe</creatorcontrib><creatorcontrib>Potvin, Jean-Yves</creatorcontrib><creatorcontrib>Rousseau, Jean-Marc</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>International Bibliography of the Social Sciences</collection><collection>International Bibliography of the Social Sciences</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Transportation Science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Duhamel, Christophe</au><au>Potvin, Jean-Yves</au><au>Rousseau, Jean-Marc</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows</atitle><jtitle>Transportation Science</jtitle><date>1997-02-01</date><risdate>1997</risdate><volume>31</volume><issue>1</issue><spage>49</spage><epage>59</epage><pages>49-59</pages><issn>0041-1655</issn><eissn>1526-5447</eissn><coden>TRSCBJ</coden><abstract>This article describes a tabu search heuristic for the vehicle routing problem with backhauls and time windows. In this problem, the set of customers is partitioned into two subsets: linehaul customers where a given quantity of goods is delivered from a central depot, and backhaul customers where a given quantity of goods is collected and transported to the depot. Mixed routes with both linehaul and backhaul customers are constructed. A variant of this problem is examined where linehauls must precede bachhauls on each route. Furthermore, the time of beginning of service at each customer location must occur within a particular time interval. Computational results are reported on a standard set of test problems, and comparisons are made with other heuristic approaches and with optimal solutions.</abstract><cop>Linthicum, MD</cop><pub>INFORMS</pub><doi>10.1287/trsc.31.1.49</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0001-6522-7343</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0041-1655 |
| ispartof | Transportation Science, 1997-02, Vol.31 (1), p.49-59 |
| issn | 0041-1655 1526-5447 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_839060587 |
| source | Informs; Business Source Complete; Jstor Complete Legacy |
| subjects | Algorithms Applied sciences Back haul Computer Science Exact sciences and technology Genetic algorithms Ground, air and sea transportation, marine construction Heuristics Operations Research Road transportation and traffic Scheduling Taboos Tabu search Temporal dimension Time windows Transport economics Transport infrastructure Vehicles Vertices |
| title | A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T18%3A57%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Tabu%20Search%20Heuristic%20for%20the%20Vehicle%20Routing%20Problem%20with%20Backhauls%20and%20Time%20Windows&rft.jtitle=Transportation%20Science&rft.au=Duhamel,%20Christophe&rft.date=1997-02-01&rft.volume=31&rft.issue=1&rft.spage=49&rft.epage=59&rft.pages=49-59&rft.issn=0041-1655&rft.eissn=1526-5447&rft.coden=TRSCBJ&rft_id=info:doi/10.1287/trsc.31.1.49&rft_dat=%3Cjstor_hal_p%3E25768751%3C/jstor_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=839060587&rft_id=info:pmid/&rft_jstor_id=25768751&rfr_iscdi=true |