Title of article
Infeasibilityhandlingingeneticalgorithmusingnesteddomainsfor productionplanning
Author/Authors
MaristelaOliveiraSantos ، نويسنده , , SadaoMassago، نويسنده , , BernardoAlmada-Lobo ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
1113
To page
1122
Abstract
In thispaperwepresentageneticalgorithmwithnewcomponentstotacklecapacitatedlotsizingand
schedulingproblemswithsequencedependentsetupsthatappearinawiderangeofindustries,from
soft drinkbottlingtofoodmanufacturing.
Findingafeasiblesolutiontohighlyconstrainedproblemsisoftenaverydifficulttask.Various
strategieshavebeenappliedtodealwithinfeasiblesolutionsthroughoutthesearch.Weproposeanew
scheme ofclassifyingindividualsbasedonnesteddomainstodeterminethesolutionsaccordingtothe
level ofinfeasibility,whichinourcaserepresentsbandsofadditionalproductionhours(overtime).
Within eachband,individualsarejustdifferentiatedbytheirfitnessfunction.Asiterationsare
conducted, thewidthsofthebandsaredynamicallyadjustedtoimprovetheconvergenceofthe
individuals intothefeasibledomain.
The numericalexperimentsonhighlycapacitatedinstancesshowtheeffectivenessofthis
computationaltractableapproachtoguidethesearchtowardthefeasibledomain.Ourapproach
outperformsotherstate-of-the-artapproachesandcommercialsolvers.
Keywords
Capacitated lot sizing and scheduling , Feasible solutions , Genetic algorithms , Nested domains
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927720
Link To Document