Title of article :
Beam-ACOforthetravellingsalesmanproblemwithtimewindows$
Author/Authors :
Manuel Lo´ pez-Iba´n?ez ، نويسنده , , ChristianBlum ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
The travellingsalesmanproblemwithtimewindowsisadifficultoptimizationproblemthatarises,for
example,inlogistics.Thispaperdealswiththeminimizationofthetravel-cost.Forsolvingthis
problem,thispaperproposesaBeam-ACOalgorithm,whichisahybridmethodcombiningantcolony
optimizationwithbeamsearch.Ingeneral,Beam-ACOalgorithmsheavilyrelyonaccurateand
computationallyinexpensiveboundinginformationfordifferentiatingbetweenpartialsolutions.This
work usesstochasticsamplingasausefulalternative.Anextensiveexperimentalevaluationonseven
benchmarksetsfromtheliteratureshowsthattheproposedBeam-ACOalgorithmiscurrentlyastate-
of-the-arttechniqueforthetravellingsalesmanproblemwithtimewindowswhentravel-cost
optimizationisconcerned.
Keywords :
Ant colony optimization , Travelling salesman problem with time windows , Hybridization
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
