Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries

► This paper studies the FSMVRPTWSD. ► The FSMVRPTW considers time windows and a heterogeneous fleet. ► In the VRPSD customers can be served by more than one vehicle. ► We propose a scatter search approach to solve the FSMVRPTWSD. ► Our algorithm is competitive with the best results found in the lit...

Full description

Saved in:
Bibliographic Details
Published in:Computers & industrial engineering 2013-02, Vol.64 (2), p.589-601
Main Authors: Belfiore, Patrícia, Yoshizaki, Hugo T.Y.
Format: Article
Language:English
Subjects:
Customer services
Deliveries
Heuristic
Heuristics
Routing
Scatter search
Studies
Transportation problem (Operations research)
Vehicle routing and scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c325t-adba00aed41b4e6a0c4d96be1dd9032c9022e68326f38253333e0ef4d284abcc3
cites cdi_FETCH-LOGICAL-c325t-adba00aed41b4e6a0c4d96be1dd9032c9022e68326f38253333e0ef4d284abcc3
container_end_page 601
container_issue 2
container_start_page 589
container_title Computers & industrial engineering
container_volume 64
creator Belfiore, Patrícia
Yoshizaki, Hugo T.Y.
description ► This paper studies the FSMVRPTWSD. ► The FSMVRPTW considers time windows and a heterogeneous fleet. ► In the VRPSD customers can be served by more than one vehicle. ► We propose a scatter search approach to solve the FSMVRPTWSD. ► Our algorithm is competitive with the best results found in the literature. This paper proposes a scatter-search (SS) approach to solve the Fleet Size and Mixed Vehicle Routing Problem with Time Windows and Split Deliveries (FSMVRPTWSD). In the Vehicle Routing Problem with Split Deliveries (VRPSD), each customer can be served by more than one vehicle, as opposed to the classical VRP in which each customer is served only once. In the FSMVRPTW, the customers must be serviced within their time windows with minimal costs using a heterogeneous fleet. Experimental testing and benchmark examples are used to assess the merit of our proposed procedure. The results show that the proposed heuristics are competitive with the best results found in the literature.
doi_str_mv 10.1016/j.cie.2012.11.007
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1283471546</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0360835212002859</els_id><sourcerecordid>2880898911</sourcerecordid><originalsourceid>FETCH-LOGICAL-c325t-adba00aed41b4e6a0c4d96be1dd9032c9022e68326f38253333e0ef4d284abcc3</originalsourceid><addsrcrecordid>eNp9kE1PwzAMhiMEEmPwA7hF4tziJG3XihOagCFN4gLnKE1cmtGPkaTj49eTMc74Yh_ex7YeQi4ZpAxYcb1JtcWUA-MpYynA4ojMWLmoEshzOCYzEAUkpcj5KTnzfgMAWV6xGXlb4eSsD1bTHkM7Gk-b0dHQIm06xEC9_UaqBkN7-0l32FrdIXXjFOzwSrdurDvs6YcNLQ22xzgNZvzwv4TfdjZQg53dobPoz8lJozqPF399Tl7u756Xq2T99PC4vF0nWvA8JMrUCkChyVidYaFAZ6YqamTGVCC4roBzLErBi0aUPBexELDJDC8zVWst5uTqsDe-9z6hD3IzTm6IJyXjpcgWLM-KmGKHlHaj9w4buXW2V-5LMpB7p3Ijo1O5dyoZk9FpZG4ODMb3dxad9DEyaDTWoQ7SjPYf-gfj6IB7</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1283471546</pqid></control><display><type>article</type><title>Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries</title><source>ScienceDirect Freedom Collection</source><creator>Belfiore, Patrícia ; Yoshizaki, Hugo T.Y.</creator><creatorcontrib>Belfiore, Patrícia ; Yoshizaki, Hugo T.Y.</creatorcontrib><description>► This paper studies the FSMVRPTWSD. ► The FSMVRPTW considers time windows and a heterogeneous fleet. ► In the VRPSD customers can be served by more than one vehicle. ► We propose a scatter search approach to solve the FSMVRPTWSD. ► Our algorithm is competitive with the best results found in the literature. This paper proposes a scatter-search (SS) approach to solve the Fleet Size and Mixed Vehicle Routing Problem with Time Windows and Split Deliveries (FSMVRPTWSD). In the Vehicle Routing Problem with Split Deliveries (VRPSD), each customer can be served by more than one vehicle, as opposed to the classical VRP in which each customer is served only once. In the FSMVRPTW, the customers must be serviced within their time windows with minimal costs using a heterogeneous fleet. Experimental testing and benchmark examples are used to assess the merit of our proposed procedure. The results show that the proposed heuristics are competitive with the best results found in the literature.</description><identifier>ISSN: 0360-8352</identifier><identifier>EISSN: 1879-0550</identifier><identifier>DOI: 10.1016/j.cie.2012.11.007</identifier><identifier>CODEN: CINDDL</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Customer services ; Deliveries ; Heuristic ; Heuristics ; Routing ; Scatter search ; Studies ; Transportation problem (Operations research) ; Vehicle routing and scheduling</subject><ispartof>Computers &amp; industrial engineering, 2013-02, Vol.64 (2), p.589-601</ispartof><rights>2012 Elsevier Ltd</rights><rights>Copyright Pergamon Press Inc. Feb 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c325t-adba00aed41b4e6a0c4d96be1dd9032c9022e68326f38253333e0ef4d284abcc3</citedby><cites>FETCH-LOGICAL-c325t-adba00aed41b4e6a0c4d96be1dd9032c9022e68326f38253333e0ef4d284abcc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27900,27901</link.rule.ids></links><search><creatorcontrib>Belfiore, Patrícia</creatorcontrib><creatorcontrib>Yoshizaki, Hugo T.Y.</creatorcontrib><title>Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries</title><title>Computers &amp; industrial engineering</title><description>► This paper studies the FSMVRPTWSD. ► The FSMVRPTW considers time windows and a heterogeneous fleet. ► In the VRPSD customers can be served by more than one vehicle. ► We propose a scatter search approach to solve the FSMVRPTWSD. ► Our algorithm is competitive with the best results found in the literature. This paper proposes a scatter-search (SS) approach to solve the Fleet Size and Mixed Vehicle Routing Problem with Time Windows and Split Deliveries (FSMVRPTWSD). In the Vehicle Routing Problem with Split Deliveries (VRPSD), each customer can be served by more than one vehicle, as opposed to the classical VRP in which each customer is served only once. In the FSMVRPTW, the customers must be serviced within their time windows with minimal costs using a heterogeneous fleet. Experimental testing and benchmark examples are used to assess the merit of our proposed procedure. The results show that the proposed heuristics are competitive with the best results found in the literature.</description><subject>Customer services</subject><subject>Deliveries</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Routing</subject><subject>Scatter search</subject><subject>Studies</subject><subject>Transportation problem (Operations research)</subject><subject>Vehicle routing and scheduling</subject><issn>0360-8352</issn><issn>1879-0550</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9kE1PwzAMhiMEEmPwA7hF4tziJG3XihOagCFN4gLnKE1cmtGPkaTj49eTMc74Yh_ex7YeQi4ZpAxYcb1JtcWUA-MpYynA4ojMWLmoEshzOCYzEAUkpcj5KTnzfgMAWV6xGXlb4eSsD1bTHkM7Gk-b0dHQIm06xEC9_UaqBkN7-0l32FrdIXXjFOzwSrdurDvs6YcNLQ22xzgNZvzwv4TfdjZQg53dobPoz8lJozqPF399Tl7u756Xq2T99PC4vF0nWvA8JMrUCkChyVidYaFAZ6YqamTGVCC4roBzLErBi0aUPBexELDJDC8zVWst5uTqsDe-9z6hD3IzTm6IJyXjpcgWLM-KmGKHlHaj9w4buXW2V-5LMpB7p3Ijo1O5dyoZk9FpZG4ODMb3dxad9DEyaDTWoQ7SjPYf-gfj6IB7</recordid><startdate>20130201</startdate><enddate>20130201</enddate><creator>Belfiore, Patrícia</creator><creator>Yoshizaki, Hugo T.Y.</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130201</creationdate><title>Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries</title><author>Belfiore, Patrícia ; Yoshizaki, Hugo T.Y.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c325t-adba00aed41b4e6a0c4d96be1dd9032c9022e68326f38253333e0ef4d284abcc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Customer services</topic><topic>Deliveries</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Routing</topic><topic>Scatter search</topic><topic>Studies</topic><topic>Transportation problem (Operations research)</topic><topic>Vehicle routing and scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Belfiore, Patrícia</creatorcontrib><creatorcontrib>Yoshizaki, Hugo T.Y.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology 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>Computers &amp; industrial engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Belfiore, Patrícia</au><au>Yoshizaki, Hugo T.Y.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries</atitle><jtitle>Computers &amp; industrial engineering</jtitle><date>2013-02-01</date><risdate>2013</risdate><volume>64</volume><issue>2</issue><spage>589</spage><epage>601</epage><pages>589-601</pages><issn>0360-8352</issn><eissn>1879-0550</eissn><coden>CINDDL</coden><abstract>► This paper studies the FSMVRPTWSD. ► The FSMVRPTW considers time windows and a heterogeneous fleet. ► In the VRPSD customers can be served by more than one vehicle. ► We propose a scatter search approach to solve the FSMVRPTWSD. ► Our algorithm is competitive with the best results found in the literature. This paper proposes a scatter-search (SS) approach to solve the Fleet Size and Mixed Vehicle Routing Problem with Time Windows and Split Deliveries (FSMVRPTWSD). In the Vehicle Routing Problem with Split Deliveries (VRPSD), each customer can be served by more than one vehicle, as opposed to the classical VRP in which each customer is served only once. In the FSMVRPTW, the customers must be serviced within their time windows with minimal costs using a heterogeneous fleet. Experimental testing and benchmark examples are used to assess the merit of our proposed procedure. The results show that the proposed heuristics are competitive with the best results found in the literature.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cie.2012.11.007</doi><tpages>13</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0360-8352
ispartof Computers & industrial engineering, 2013-02, Vol.64 (2), p.589-601
issn 0360-8352
1879-0550
language eng
recordid cdi_proquest_journals_1283471546
source ScienceDirect Freedom Collection
subjects Customer services
Deliveries
Heuristic
Heuristics
Routing
Scatter search
Studies
Transportation problem (Operations research)
Vehicle routing and scheduling
title Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-25T12%3A39%3A32IST&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=Heuristic%20methods%20for%20the%20fleet%20size%20and%20mix%20vehicle%20routing%20problem%20with%20time%20windows%20and%20split%20deliveries&rft.jtitle=Computers%20&%20industrial%20engineering&rft.au=Belfiore,%20Patr%C3%ADcia&rft.date=2013-02-01&rft.volume=64&rft.issue=2&rft.spage=589&rft.epage=601&rft.pages=589-601&rft.issn=0360-8352&rft.eissn=1879-0550&rft.coden=CINDDL&rft_id=info:doi/10.1016/j.cie.2012.11.007&rft_dat=%3Cproquest_cross%3E2880898911%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c325t-adba00aed41b4e6a0c4d96be1dd9032c9022e68326f38253333e0ef4d284abcc3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1283471546&rft_id=info:pmid/&rfr_iscdi=true