StudiesonMetaheuristicsforContinuousGlobalOptimizationProblemsAbdel-RahmanHedarA.Ahmed
MetaheuristicsforThe Bus-Driver Scheduling ProblemHelena Ramalhinho Lourenço*Universitat Pompeu Fabra, SpainJ...
Real-CodedEstimationofDistributionAlgorithmToponKumarPaul GraduateHitoshiIba SchoolofFrontierSciences,TheUniversityofTokyoHongo7-3-1,Bunkyo-ku,Tokyo113-8656,Japan{topon,iba}@miv.t.u-tokyo.ac.jpAbstra...
...31;oUniversitat Pompeu Fabra, Barcelona, Spainhelena.ramalhinho@econ.upf.es AbstractRecently hybrid metaheuristics have been design to find solutions for combinatorial optimisation problems. We focus on hybrid proc...
...erasetofinstancesfromthreeclassesoftheproblem.Resultsarecomparedwithrecentresultsobtainedwithseveralmetaheuristicsusingthesamelocalsearchroutine(orneighborhoodde nition),andareferencerandomrestartlocalsearchalgorit...
...ristics.Keywords:PickupandDeliveryProblemwithTimeWindows,LargeNeighborhoodSearch,SimulatedAnnealing,MetaheuristicsIntroductionIntheconsideredvariantofthepickupanddeliveryproblemwithtimewindows(PDPTW),wearegivenanum...
...dyarepresented.Ó2005ElsevierB.V.Allrightsreserved.Keywords:Arti cialintelligence;Manufacturing;Metaheuristics;Production1.IntroductionAnassemblylineismadeupofanumberofworkstations,m,arrangedinseriesandinparall...
...,whichisapoint-to-pointmethod,againstpopulation-basedmethods.Keywords:Constrainedglobaloptimization,Metaheuristics,Simulatedanneal-ing,FilterSet,Approximatedescentdirection1IntroductionSimulatedAnnealing(SA)isoneof...
...utperformingpreviousmetaheuristicapproachesinmostcases.KeywordsMinimumweightvertexcoverproblem·Metaheuristics·Reactivetabusearch·Simulatedannealing1IntroductionTheminimumweightvertexcoverproblem(MWVC...
...thosereportedintheliteratureforothercontinuousoptimizationmethods:otherant-relatedapproachesandothermetaheuristicsinitiallydevelopedforcombinatorialoptimizationandlateradaptedtohandlethecontinuouscase.Wediscusshowo...
...sultof9instancesandtoequalanother49.Keywords:VehicleRoutingProblemwithSimultaneousPickupandDelivery;Metaheuristics;IteratedLocalSearch;GENIUS;VariableNeighborhoodDescent;Reverselogistics.Referencetothispapershouldb...
...解、近似解或满意解,这些方法大体上归结为三类,即精确算法(exactalgorithms)、经典启发式算法(classicalalgorithms)和现代启发式算法(modernalgorithms,metaheuristics)。有关精确算法如文献[1]中应用的最小K-树法(minimumK2trees),结合分支定界(branchandbound)的算法技巧来求解问题,这类方法对一些适当规模的问题求解是可行的。经典启发式...