Title of article
An antcolonyoptimizationmetaheuristicformachine–partcell formation problems
Author/Authors
Xiangyong Li and Minzhong Wang ، نويسنده , , M.F.Baki، نويسنده , , Y.P.Aneja ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
11
From page
2071
To page
2081
Abstract
In thispaperweproposeanantcolonyoptimizationmetaheuristic(ACO-CF)tosolvethemachine–part
cell formationproblem.ACO-CFisa MAX2MIN ant system,whichisimplementedinthehyper-cube
frameworktoautomaticallyscaletheobjectivefunctionsofmachine–partcellformationproblems.As
an intensificationstrategy,weintegrateaniterativelylocalsearchintoACO-CF.Basedonthe
assignmentofthemachinesorparts,thelocalsearchcanoptimallyreassignpartsormachinestocells.
We carryoutaseriesofexperimentstoinvestigatetheperformanceofACO-CFonsomestandard
benchmarkproblems.ThecomparisonstudybetweenACO-CFandothermethodsproposedinthe
literatureindicatesthatACO-CFisoneofthebestapproachesforsolvingthemachine–partcell
formationproblem.
Keywords
Cell formation problem , Iteratively local search , Ant colony optimization , Metaheuristic
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927811
Link To Document