A metaheuristic for the vehicle-routeing problem with soft time windows

This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints. A tabu search solution method is developed, which utilizes a mixed neighbourhood structure and an advanced recovery procedure to generate high-quality solutions. Computational resul...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society 2004-12, Vol.55 (12), p.1298-1310
Main Authors: Chiang, W-C, Russell, R A
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Business and Management
Cost control
Customer services
Datasets
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Heuristics
Logistics
Management
metaheuristics
Neighborhoods
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Scheduling
Taboos
Tabu search
Theoretical Paper
Theoretical Papers
Time windows
Travel time
Vehicle operation
vehicle routeing
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-c455t-f91caa57eab7cf2f9395a6bcca7ec19698c4cbcfa8b1c0701ffa99eef499e5653
cites cdi_FETCH-LOGICAL-c455t-f91caa57eab7cf2f9395a6bcca7ec19698c4cbcfa8b1c0701ffa99eef499e5653
container_end_page 1310
container_issue 12
container_start_page 1298
container_title The Journal of the Operational Research Society
container_volume 55
creator Chiang, W-C
Russell, R A
description This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints. A tabu search solution method is developed, which utilizes a mixed neighbourhood structure and an advanced recovery procedure to generate high-quality solutions. Computational results on test problems from the literature are reported. The metaheuristic achieves solutions that compare favourably with previously reported results.
doi_str_mv 10.1057/palgrave.jors.2601791
format article
fullrecord <record><control><sourceid>jstor_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_16291141</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>4101849</jstor_id><sourcerecordid>4101849</sourcerecordid><originalsourceid>FETCH-LOGICAL-c455t-f91caa57eab7cf2f9395a6bcca7ec19698c4cbcfa8b1c0701ffa99eef499e5653</originalsourceid><addsrcrecordid>eNqFUU1r3DAQFaWFbtP8gwZMoUdvJNuSV7eG0KaFQC7JWYyV0a4W29qO5Cz599HiTfbWXCTE-5g3T4xdCL4UXLaXO-jXBE-43AaKy0px0WrxgS1E06pS14p_ZAsuFC-lWlWf2ZcYt5xzzYVesJurYsAEG5zIx-Rt4QIVaYPFE2687bGkMCX047rYUeh6HIq9T5siBpeK5AfMz_Ex7ONX9slBH_H8eJ-xh9-_7q__lLd3N3-vr25L20iZSqeFBZAtQtdaVzldawmqsxZatEIrvbKN7ayDVScsb7lwDrRGdE0-pZL1Gfs---Y4_yaMyWzDRGMeaapaNIe9VCbJmWQpxEjozI78APRsBDeHysxrZeZQmTlWlnU_juYQLfSOYLQ-nsSq0kI0B56aeTFD4xrpFOK9ARezcIQ0Eb45n_BvM76NKdAb3AguVo3O8M8Z9mP-pgH2gfpHk-C5D_Qatv5_ghfoma6H</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>231400096</pqid></control><display><type>article</type><title>A metaheuristic for the vehicle-routeing problem with soft time windows</title><source>ABI/INFORM Global</source><source>Taylor and Francis Science and Technology Collection</source><source>JSTOR</source><creator>Chiang, W-C ; Russell, R A</creator><creatorcontrib>Chiang, W-C ; Russell, R A</creatorcontrib><description>This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints. A tabu search solution method is developed, which utilizes a mixed neighbourhood structure and an advanced recovery procedure to generate high-quality solutions. Computational results on test problems from the literature are reported. The metaheuristic achieves solutions that compare favourably with previously reported results.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/palgrave.jors.2601791</identifier><identifier>CODEN: JORSDZ</identifier><language>eng</language><publisher>London: Taylor &amp; Francis</publisher><subject>Algorithms ; Applied sciences ; Business and Management ; Cost control ; Customer services ; Datasets ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Heuristic ; Heuristics ; Logistics ; Management ; metaheuristics ; Neighborhoods ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Operations Research/Decision Theory ; Scheduling ; Taboos ; Tabu search ; Theoretical Paper ; Theoretical Papers ; Time windows ; Travel time ; Vehicle operation ; vehicle routeing ; Vehicles</subject><ispartof>The Journal of the Operational Research Society, 2004-12, Vol.55 (12), p.1298-1310</ispartof><rights>Copyright © 2004, Palgrave Macmillan Ltd 2004</rights><rights>Copyright 2004 Operational Research Society Ltd</rights><rights>Palgrave Macmillan Ltd 2004</rights><rights>2005 INIST-CNRS</rights><rights>Copyright (c) 2004 Palgrave Macmillan Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c455t-f91caa57eab7cf2f9395a6bcca7ec19698c4cbcfa8b1c0701ffa99eef499e5653</citedby><cites>FETCH-LOGICAL-c455t-f91caa57eab7cf2f9395a6bcca7ec19698c4cbcfa8b1c0701ffa99eef499e5653</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/231400096/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/231400096?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,44363,58238,58471,74895</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16291141$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Chiang, W-C</creatorcontrib><creatorcontrib>Russell, R A</creatorcontrib><title>A metaheuristic for the vehicle-routeing problem with soft time windows</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints. A tabu search solution method is developed, which utilizes a mixed neighbourhood structure and an advanced recovery procedure to generate high-quality solutions. Computational results on test problems from the literature are reported. The metaheuristic achieves solutions that compare favourably with previously reported results.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Business and Management</subject><subject>Cost control</subject><subject>Customer services</subject><subject>Datasets</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Logistics</subject><subject>Management</subject><subject>metaheuristics</subject><subject>Neighborhoods</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Scheduling</subject><subject>Taboos</subject><subject>Tabu search</subject><subject>Theoretical Paper</subject><subject>Theoretical Papers</subject><subject>Time windows</subject><subject>Travel time</subject><subject>Vehicle operation</subject><subject>vehicle routeing</subject><subject>Vehicles</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNqFUU1r3DAQFaWFbtP8gwZMoUdvJNuSV7eG0KaFQC7JWYyV0a4W29qO5Cz599HiTfbWXCTE-5g3T4xdCL4UXLaXO-jXBE-43AaKy0px0WrxgS1E06pS14p_ZAsuFC-lWlWf2ZcYt5xzzYVesJurYsAEG5zIx-Rt4QIVaYPFE2687bGkMCX047rYUeh6HIq9T5siBpeK5AfMz_Ex7ONX9slBH_H8eJ-xh9-_7q__lLd3N3-vr25L20iZSqeFBZAtQtdaVzldawmqsxZatEIrvbKN7ayDVScsb7lwDrRGdE0-pZL1Gfs---Y4_yaMyWzDRGMeaapaNIe9VCbJmWQpxEjozI78APRsBDeHysxrZeZQmTlWlnU_juYQLfSOYLQ-nsSq0kI0B56aeTFD4xrpFOK9ARezcIQ0Eb45n_BvM76NKdAb3AguVo3O8M8Z9mP-pgH2gfpHk-C5D_Qatv5_ghfoma6H</recordid><startdate>20041201</startdate><enddate>20041201</enddate><creator>Chiang, W-C</creator><creator>Russell, R A</creator><general>Taylor &amp; Francis</general><general>Palgrave Macmillan Press</general><general>Palgrave Macmillan UK</general><general>Palgrave</general><general>Taylor &amp; Francis Ltd</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>U9A</scope></search><sort><creationdate>20041201</creationdate><title>A metaheuristic for the vehicle-routeing problem with soft time windows</title><author>Chiang, W-C ; Russell, R A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c455t-f91caa57eab7cf2f9395a6bcca7ec19698c4cbcfa8b1c0701ffa99eef499e5653</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Business and Management</topic><topic>Cost control</topic><topic>Customer services</topic><topic>Datasets</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Logistics</topic><topic>Management</topic><topic>metaheuristics</topic><topic>Neighborhoods</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Scheduling</topic><topic>Taboos</topic><topic>Tabu search</topic><topic>Theoretical Paper</topic><topic>Theoretical Papers</topic><topic>Time windows</topic><topic>Travel time</topic><topic>Vehicle operation</topic><topic>vehicle routeing</topic><topic>Vehicles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chiang, W-C</creatorcontrib><creatorcontrib>Russell, R A</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Global News &amp; ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Career &amp; Technical Education Database</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Health &amp; Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Databases</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>PML(ProQuest Medical Library)</collection><collection>ProQuest Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chiang, W-C</au><au>Russell, R A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A metaheuristic for the vehicle-routeing problem with soft time windows</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>2004-12-01</date><risdate>2004</risdate><volume>55</volume><issue>12</issue><spage>1298</spage><epage>1310</epage><pages>1298-1310</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>JORSDZ</coden><abstract>This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints. A tabu search solution method is developed, which utilizes a mixed neighbourhood structure and an advanced recovery procedure to generate high-quality solutions. Computational results on test problems from the literature are reported. The metaheuristic achieves solutions that compare favourably with previously reported results.</abstract><cop>London</cop><pub>Taylor &amp; Francis</pub><doi>10.1057/palgrave.jors.2601791</doi><tpages>13</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0160-5682
ispartof The Journal of the Operational Research Society, 2004-12, Vol.55 (12), p.1298-1310
issn 0160-5682
1476-9360
language eng
recordid cdi_pascalfrancis_primary_16291141
source ABI/INFORM Global; Taylor and Francis Science and Technology Collection; JSTOR
subjects Algorithms
Applied sciences
Business and Management
Cost control
Customer services
Datasets
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Heuristics
Logistics
Management
metaheuristics
Neighborhoods
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Scheduling
Taboos
Tabu search
Theoretical Paper
Theoretical Papers
Time windows
Travel time
Vehicle operation
vehicle routeing
Vehicles
title A metaheuristic for the vehicle-routeing problem with soft time windows
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T23%3A16%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20metaheuristic%20for%20the%20vehicle-routeing%20problem%20with%20soft%20time%20windows&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Chiang,%20W-C&rft.date=2004-12-01&rft.volume=55&rft.issue=12&rft.spage=1298&rft.epage=1310&rft.pages=1298-1310&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=JORSDZ&rft_id=info:doi/10.1057/palgrave.jors.2601791&rft_dat=%3Cjstor_pasca%3E4101849%3C/jstor_pasca%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c455t-f91caa57eab7cf2f9395a6bcca7ec19698c4cbcfa8b1c0701ffa99eef499e5653%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=231400096&rft_id=info:pmid/&rft_jstor_id=4101849&rfr_iscdi=true