A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem

The aim of this study is to describe a new stochastic search metaheuristic algorithm for solving the capacitated Vehicle Routing Problem, termed as the Backtracking Adaptive Threshold Accepting (BATA) algorithm. Our effort focuses on developing an innovative method, which produces reliable and high...

Full description

Saved in:
Bibliographic Details
Published in:Systems analysis, modelling, simulation Vol. 42; no. 5; pp. 631 - 664
Main Authors: Tarantilis, C.D., Kiranoudis, C.T., Vassiliadis, V.S.
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.01.2002
Subjects:
Distribution Management
Local Search
Metaheuristics
Threshold Accepting
Vehicle Routing
ISSN:0232-9298
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The aim of this study is to describe a new stochastic search metaheuristic algorithm for solving the capacitated Vehicle Routing Problem, termed as the Backtracking Adaptive Threshold Accepting (BATA) algorithm. Our effort focuses on developing an innovative method, which produces reliable and high quality solutions in a reasonable amount of time, without requiring substantial parameter tuning. BATA belongs to the class of threshold accepting algorithms. Its main difference over a typical threshold-accepting algorithm is that during the optimization process, the value of the threshold not only is lowered but also raised, or backtracked, depending on the success of the inner loop iterations to provide an acceptable new configuration (set of routes) replacing the previous one. This adaptation of the value of the threshold, plays an important role in finding the high quality solutions demonstrated in computational results presented in this study.
AbstractList The aim of this study is to describe a new stochastic search metaheuristic algorithm for solving the capacitated Vehicle Routing Problem, termed as the Backtracking Adaptive Threshold Accepting (BATA) algorithm. Our effort focuses on developing an innovative method, which produces reliable and high quality solutions in a reasonable amount of time, without requiring substantial parameter tuning. BATA belongs to the class of threshold accepting algorithms. Its main difference over a typical threshold-accepting algorithm is that during the optimization process, the value of the threshold not only is lowered but also raised, or backtracked, depending on the success of the inner loop iterations to provide an acceptable new configuration (set of routes) replacing the previous one. This adaptation of the value of the threshold, plays an important role in finding the high quality solutions demonstrated in computational results presented in this study.
Author Tarantilis, C.D.
Vassiliadis, V.S.
Kiranoudis, C.T.
Author_xml – sequence: 1
  givenname: C.D.
  surname: Tarantilis
  fullname: Tarantilis, C.D.
  organization: Department of Chemical Engineering , National Technical University of Athens
– sequence: 2
  givenname: C.T.
  surname: Kiranoudis
  fullname: Kiranoudis, C.T.
  organization: Department of Chemical Engineering , National Technical University of Athens
– sequence: 3
  givenname: V.S.
  surname: Vassiliadis
  fullname: Vassiliadis, V.S.
  organization: Department of Chemical Engineering , University of Cambridge
BookMark eNp9kMtOwzAQRb0oEm1hwR94yyLUjySOl6HiJVUCoZZt5Dh2Y3DiyjaP_j0pRV0g1M2MNHPujO6dgFHvegXABUZXGBVoxnCOcoYLOgJjRChJOOHFKZiE8IoQwYzjMViV8FrIt-iHYvo1LBuxieZDwWXrVWidbWAppRpmu6VdO29i20HtPIytgi-qNdIq-Ozef4gn72qrujNwooUN6vy3T8Hq9mY5v08Wj3cP83KRSEJYTOqCMJZRTRjJlMxIzlShcc0bpeo8EyzVnBS1ZCRNJZeYUsoQTdNcNAXjvMF0Ci73d6V3IXilq403nfDbCqNql0F1yGBgZ39YaaKIxvWDeWP_VaR7hekHv534dN42VRRb67z2opcmVPTIoyOyA13Fr0i_AVVwgxQ
CitedBy_id crossref_primary_10_1007_s10898_006_9094_0
crossref_primary_10_1016_j_trc_2022_103958
crossref_primary_10_1016_j_amc_2005_09_040
crossref_primary_10_1016_j_compind_2016_07_006
crossref_primary_10_1016_j_engappai_2010_02_002
crossref_primary_10_1016_j_eswa_2015_10_012
crossref_primary_10_1016_S0377_2217_03_00030_4
crossref_primary_10_1016_j_jfoodeng_2004_09_023
crossref_primary_10_1016_j_cor_2018_04_017
crossref_primary_10_1016_S0377_2217_02_00669_0
crossref_primary_10_1007_s00500_019_04072_6
crossref_primary_10_1016_j_cor_2005_10_010
crossref_primary_10_1016_j_eswa_2011_01_116
crossref_primary_10_1016_j_eswa_2012_01_015
crossref_primary_10_1016_j_cor_2004_03_005
crossref_primary_10_1016_j_jfranklin_2005_12_002
crossref_primary_10_1007_BF02941184
crossref_primary_10_1016_j_eswa_2009_06_085
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2002
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2002
DBID AAYXX
CITATION
DOI 10.1080/716067183
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 664
ExternalDocumentID 10_1080_716067183
10087996
GroupedDBID .4S
.7F
.DC
.QJ
0BK
123
29Q
AAGDL
AALDU
AAMIU
AAPUL
AAQRR
ABDBF
ABFIM
ABJNI
ABLIJ
ABPAQ
ABPEM
ABXUL
ABXYU
ACTIO
ACTTO
ACUHS
ADCVX
ADGTB
AEISY
AFBWG
AFION
AFRVT
AGDLA
AGMYJ
AGVKY
AGWUF
AHDZW
AIJEM
AIYEW
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
ALRRR
AQRUH
AQTUD
ARCSS
AVBZW
BLEHA
BWMZZ
CAG
CCCUG
CE4
COF
CS3
CYRSC
DAOYK
DGEBU
EAP
EBS
EDO
EJD
EMK
EPL
EST
ESX
E~A
E~B
H13
IPNFZ
KYCEM
M4Z
OPCYK
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TTHFI
TUROJ
UT5
UU3
ZGOLN
~S~
4.4
5VS
AAYXX
AWYRJ
CITATION
ID FETCH-LOGICAL-c227t-b827753f2725ec5267e8f1b9deeb65a74f928bc7244c9c1333703446ad8799d13
IEDL.DBID TFW
ISSN 0232-9298
IngestDate Sat Nov 29 02:23:04 EST 2025
Tue Nov 18 22:38:51 EST 2025
Mon May 13 12:09:19 EDT 2019
Mon Oct 20 23:50:46 EDT 2025
IsPeerReviewed false
IsScholarly true
Issue 5
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c227t-b827753f2725ec5267e8f1b9deeb65a74f928bc7244c9c1333703446ad8799d13
PageCount 34
ParticipantIDs informaworld_taylorfrancis_310_1080_716067183
crossref_citationtrail_10_1080_716067183
crossref_primary_10_1080_716067183
PublicationCentury 2000
PublicationDate 1/1/2002
2002-01-00
PublicationDateYYYYMMDD 2002-01-01
PublicationDate_xml – month: 01
  year: 2002
  text: 1/1/2002
  day: 01
PublicationDecade 2000
PublicationTitle Systems analysis, modelling, simulation
PublicationYear 2002
Publisher Taylor & Francis Group
Publisher_xml – name: Taylor & Francis Group
SSID ssj0021791
Score 1.5777558
Snippet The aim of this study is to describe a new stochastic search metaheuristic algorithm for solving the capacitated Vehicle Routing Problem, termed as the...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 631
SubjectTerms Distribution Management
Local Search
Metaheuristics
Threshold Accepting
Vehicle Routing
Title A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
URI https://www.tandfonline.com/doi/abs/10.1080/716067183
Volume 42
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  issn: 0232-9298
  databaseCode: TFW
  dateStart: 20020101
  customDbUrl:
  isFulltext: true
  dateEnd: 20031231
  titleUrlDefault: https://www.tandfonline.com
  omitProxy: false
  ssIdentifier: ssj0021791
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFA9jeNCD3-L8IoiHXYJb2i7psYrD09hh091KmiZuOLfRRfHP9yX9oIMh6KWH9tcQ8pL31dffQ-hOioBpzRKSdjQlPhWcCNjMhCmfh6llopQd12yCDQZ8MgmHDRSU_8LYskobQ-ucKMLpanu4RbIuK-LuwcUHHQt7ETQvmHt7HEf91yrMsoSbLrPiUQLGn5d8QvU3N6zQBkdpzbr0D_45r0O0X7iTOMrlf4QaanGM9mokgydoHOEHId9NBhe4gaNUrKyOwyMQ49p-fcKRdMUt9uH8bZnNzPQDw1wxOIf4RU3t0NiWDlnEMO9Ac4rG_afR4zMpmikQSSkzJOGUQWiiKaOBkgHtMcV1NwlTpZJeIJivQ8oTycDcy1BC5OoxywbYEylnIUjNO0PNxXKhzhFOPV_xNEjAMwkBHYDnq3SPUslB8euubqF2ubixLJjGbcOLedwtCEmrlWqh2wq6yuk1toFIXUKxcbkMnTceib0t-PYv-AoWm29z8cehL9GuawfjcjBXqGmyT3WNduSXma2zG7cPfwCkl911
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT8IwFH9BNFEPfhvxszEeuDRCx9buOI0EIxIOoNyWrWuFiEDGNP75vm6wQEJM9LLD9lvTtG_vq2-_B3AjA5trzUMaVTSjNRYIGqAwU65qwo0ME6WspM0meKslej23XQBn_i-MKas0MbTOiCJSXW0-bpOMnpfE3aKPj0oWhXEN1m20r4Yzv1N_zQMtQ7mZ5lYsRtH8izmj0OKrS3ZoiaV0wb7Ud_87sz3YmXmUxMtEYB8KanQA2ws8g4fQ9chdIN-TGC94g3hRMDFqjnRwJ6fmAIp4Mq1vMQ-Hb-N4kPQ_CE6WoH9IXlTfDE1M9ZBBtLMmNEfQrT907ht01k-BSsZ4QkPBOEYnmnFmK2kzhyuhq6EbKRU6dsBr2mUilBwtvnQlBq8WN4SAThAJ7uLGWcdQHI1H6gRIZNWUiOwQnRMX0TY6v0o7jEmBul9XdQnK89X15Yxs3PS8GPrVGSdpvlIluM6hk4xhYxWILm6Rn6TpDJ31HvGtFfjyL_gc5iffyekfh76CzUbnuek3H1tPZ7CVdodJUzLnUEziT3UBG_IrGUzjy1QofwCoMuGf
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1JT8JAFH5BNEYP7kZcJ8YDl4kwXWZ6xKXRaAgHUG5NO50RIgKBavz5vulCICEmeumh_TqZzLy-bV6_B3AlQ4drzSMa1zSjNgsFDVGYKVe28GLDRClrabMJ3myKbtdrlcAp_oUxZZUmhtYZUUSqq83HPY51URF3jS4-6liUxRVYRXfZNYLd9l9ncZZh3ExTKxajaP1FQSg0_-qCGVogKZ0zL_72Pye2A1u5P0kamQDsQkkN92BzjmVwHzoNchPK92SCF7xBGnE4NkqOtHEfp-b4iTRkWt1iHg7eRpN-0vsgOFeC3iF5UT0zNDG1QwbRylrQHEDHv2_fPtC8mwKVjPGERoJxjE0048xR0mEuV0LXIy9WKnKdkNvaYyKSHO299CSGrhY3dIBuGAvu4bZZh1AejobqCEhs2UrEToSuiYdoB11fpV3GpEDNr-u6AtVicQOZU42bjheDoJ4zks5WqgKXM-g449dYBqLzOxQkaTJDZ51HAmsJvvoLfgYLku_k-I9DX8B6684Pnh-bTyewkbaGSfMxp1BOJp_qDNbkV9KfTs5TkfwBImDgUQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Backtracking+Adaptive+Threshold+Accepting+Algorithm+for+the+Vehicle+Routing+Problem&rft.jtitle=Systems+analysis%2C+modelling%2C+simulation&rft.au=Tarantilis%2C+C.D.&rft.au=Kiranoudis%2C+C.T.&rft.au=Vassiliadis%2C+V.S.&rft.date=2002-01-01&rft.issn=0232-9298&rft.volume=42&rft.issue=5&rft.spage=631&rft.epage=664&rft_id=info:doi/10.1080%2F716067183&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_716067183
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0232-9298&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0232-9298&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0232-9298&client=summon