A route-neighborhood-based metaheuristic for vehicle routing problem with time windows

In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW). Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route constr...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1999-11, Vol.118 (3), p.485-504
Main Authors: Liu, Fuh-Hwa Franklin, Shen, Sheng-Yuan
Format: Article
Language:English
Subjects:
Heuristic
Metaheuristics
Neighborhood
Neighborhoods
Operations research
Routing
Studies
Time windows
Vehicles
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-c456t-39f3cdefabd34ba8a817d22f87cd7d35393a0b95c42e6dc2efac1d29a42f2e263
cites cdi_FETCH-LOGICAL-c456t-39f3cdefabd34ba8a817d22f87cd7d35393a0b95c42e6dc2efac1d29a42f2e263
container_end_page 504
container_issue 3
container_start_page 485
container_title European journal of operational research
container_volume 118
creator Liu, Fuh-Hwa Franklin
Shen, Sheng-Yuan
description In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW). Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality. Valuable information extracted from the previous parallel construction runs is used to enhance the performance of parallel construction. In addition, when there are only a few unrouted customers left, we design a special procedure for handling them. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, and in particular very promising for solving problems of large size.
doi_str_mv 10.1016/S0377-2217(98)00315-4
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204145720</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221798003154</els_id><sourcerecordid>51684718</sourcerecordid><originalsourceid>FETCH-LOGICAL-c456t-39f3cdefabd34ba8a817d22f87cd7d35393a0b95c42e6dc2efac1d29a42f2e263</originalsourceid><addsrcrecordid>eNqFUE1rGzEQFSWBukl_QmHpKT1sq89d6RRMSNuQQA9JexVaaTYr4105ktbB_76yHXzNwJuZw3tvhofQF4K_E0yaH4-YtW1NKWmvlPyGMSOi5h_QgsiW1o1s8BlanCgf0aeUVhhjIohYoH_LKoY5Qz2Bfx66EIcQXN2ZBK4aIZsB5uhT9rbqQ6y2MHi7hoPET8_VJoZuDWP16vNQZT9C2SYXXtMlOu_NOsHnt3mB_v68fbr5XT_8-XV3s3yoLRdNrpnqmXXQm84x3hlpJGkdpb1srWsdE0wxgzslLKfQOEsL0xJHleG0p0AbdoG-Hn3LJy8zpKxXYY5TOakp5oSLluJCEkeSjSGlCL3eRD-auNME632C-pCg3sejldSHBDUvuvujLsIG7EkEpVYhQtJbzQwhsvTdflNKleELWMGmgEuhBeZ6yGNxuz66Qclj6yHqZD1MFpyPYLN2wb_zz3_gX5Nu</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204145720</pqid></control><display><type>article</type><title>A route-neighborhood-based metaheuristic for vehicle routing problem with time windows</title><source>ScienceDirect Freedom Collection 2022-2024</source><creator>Liu, Fuh-Hwa Franklin ; Shen, Sheng-Yuan</creator><creatorcontrib>Liu, Fuh-Hwa Franklin ; Shen, Sheng-Yuan</creatorcontrib><description>In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW). Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality. Valuable information extracted from the previous parallel construction runs is used to enhance the performance of parallel construction. In addition, when there are only a few unrouted customers left, we design a special procedure for handling them. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, and in particular very promising for solving problems of large size.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(98)00315-4</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Heuristic ; Metaheuristics ; Neighborhood ; Neighborhoods ; Operations research ; Routing ; Studies ; Time windows ; Vehicles</subject><ispartof>European journal of operational research, 1999-11, Vol.118 (3), p.485-504</ispartof><rights>1999 Elsevier Science B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Nov 1, 1999</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c456t-39f3cdefabd34ba8a817d22f87cd7d35393a0b95c42e6dc2efac1d29a42f2e263</citedby><cites>FETCH-LOGICAL-c456t-39f3cdefabd34ba8a817d22f87cd7d35393a0b95c42e6dc2efac1d29a42f2e263</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,783,787,27936,27937</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a118_3ay_3a1999_3ai_3a3_3ap_3a485-504.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Liu, Fuh-Hwa Franklin</creatorcontrib><creatorcontrib>Shen, Sheng-Yuan</creatorcontrib><title>A route-neighborhood-based metaheuristic for vehicle routing problem with time windows</title><title>European journal of operational research</title><description>In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW). Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality. Valuable information extracted from the previous parallel construction runs is used to enhance the performance of parallel construction. In addition, when there are only a few unrouted customers left, we design a special procedure for handling them. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, and in particular very promising for solving problems of large size.</description><subject>Heuristic</subject><subject>Metaheuristics</subject><subject>Neighborhood</subject><subject>Neighborhoods</subject><subject>Operations research</subject><subject>Routing</subject><subject>Studies</subject><subject>Time windows</subject><subject>Vehicles</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><recordid>eNqFUE1rGzEQFSWBukl_QmHpKT1sq89d6RRMSNuQQA9JexVaaTYr4105ktbB_76yHXzNwJuZw3tvhofQF4K_E0yaH4-YtW1NKWmvlPyGMSOi5h_QgsiW1o1s8BlanCgf0aeUVhhjIohYoH_LKoY5Qz2Bfx66EIcQXN2ZBK4aIZsB5uhT9rbqQ6y2MHi7hoPET8_VJoZuDWP16vNQZT9C2SYXXtMlOu_NOsHnt3mB_v68fbr5XT_8-XV3s3yoLRdNrpnqmXXQm84x3hlpJGkdpb1srWsdE0wxgzslLKfQOEsL0xJHleG0p0AbdoG-Hn3LJy8zpKxXYY5TOakp5oSLluJCEkeSjSGlCL3eRD-auNME632C-pCg3sejldSHBDUvuvujLsIG7EkEpVYhQtJbzQwhsvTdflNKleELWMGmgEuhBeZ6yGNxuz66Qclj6yHqZD1MFpyPYLN2wb_zz3_gX5Nu</recordid><startdate>19991101</startdate><enddate>19991101</enddate><creator>Liu, Fuh-Hwa Franklin</creator><creator>Shen, Sheng-Yuan</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><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>19991101</creationdate><title>A route-neighborhood-based metaheuristic for vehicle routing problem with time windows</title><author>Liu, Fuh-Hwa Franklin ; Shen, Sheng-Yuan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c456t-39f3cdefabd34ba8a817d22f87cd7d35393a0b95c42e6dc2efac1d29a42f2e263</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Heuristic</topic><topic>Metaheuristics</topic><topic>Neighborhood</topic><topic>Neighborhoods</topic><topic>Operations research</topic><topic>Routing</topic><topic>Studies</topic><topic>Time windows</topic><topic>Vehicles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Fuh-Hwa Franklin</creatorcontrib><creatorcontrib>Shen, Sheng-Yuan</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; 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>Liu, Fuh-Hwa Franklin</au><au>Shen, Sheng-Yuan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A route-neighborhood-based metaheuristic for vehicle routing problem with time windows</atitle><jtitle>European journal of operational research</jtitle><date>1999-11-01</date><risdate>1999</risdate><volume>118</volume><issue>3</issue><spage>485</spage><epage>504</epage><pages>485-504</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW). Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality. Valuable information extracted from the previous parallel construction runs is used to enhance the performance of parallel construction. In addition, when there are only a few unrouted customers left, we design a special procedure for handling them. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, and in particular very promising for solving problems of large size.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(98)00315-4</doi><tpages>20</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 1999-11, Vol.118 (3), p.485-504
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_journals_204145720
source ScienceDirect Freedom Collection 2022-2024
subjects Heuristic
Metaheuristics
Neighborhood
Neighborhoods
Operations research
Routing
Studies
Time windows
Vehicles
title A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-11-13T07%3A40%3A19IST&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%20route-neighborhood-based%20metaheuristic%20for%20vehicle%20routing%20problem%20with%20time%20windows&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Liu,%20Fuh-Hwa%20Franklin&rft.date=1999-11-01&rft.volume=118&rft.issue=3&rft.spage=485&rft.epage=504&rft.pages=485-504&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(98)00315-4&rft_dat=%3Cproquest_cross%3E51684718%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c456t-39f3cdefabd34ba8a817d22f87cd7d35393a0b95c42e6dc2efac1d29a42f2e263%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=204145720&rft_id=info:pmid/&rfr_iscdi=true