《Memetic algorithm for multi-mode resource-constrained project scheduling problems》.pdf

JournalofSystemsEngineeringandElectronics EXCLUSlVELYA1ULABLEVIA Vo1．25，No．4，August2014，PP．609—617 @ IEEE RARY Memeticalgorithm formulti--moderesource。c‘onstrained projectschedulingproblems ShixinLiu，DiChen，andYifanWang CollegeofInformationScienceandEngineering，Northeastem University，Shenyang110819，China Abstract：A memeticalgorithm (MA)foramulti-moderesource- smal1一sizedproblem instancestooptima1inareasonable constrained projectscheduling problem (MRCPSP) is pro- amountoftime．Hence，somereserachershaveproposed posed．W euseanew fitnessfunctionandtwovery effective Io- single．．passormulti．．passheuristicstofindnear．．optimalso．- calsearchproceduresintheproposedMA．Thefitnessfunction lutionsinlimitedcomputationtimef3,6】．Astheproblem makesuseofamechanism called “strategicoscillation”tomake offindingafeasiblesolutionisalreadyNP．completewhen the search process have a higherprobabilitytovisitsolutions thereraeatleasttwononrenewableresources，heuristics arounda “feasibleboundary”．OReoftheIocalsearchprocedures aimsatimprovingtheJowerboundofprojectmakespantobe may failto generate feasiblesolutionswhen theprob— lessthanaknownupperbound．andanotheraimsatimproving lem becomeshighlyresource．constrained．Morerecently． asolution ofanMRCPSP instanceaccepting infeasible solutions some meta—heuristicshavebeen proposedto solvethe