solving job-shop scheduling problems by genetic algorithms based on building block hypothesis

solving job-shop scheduling problems by genetic algorithms based on building block hypothesis

ID:10976215

大小:37.50 KB

页数:10页

时间:2018-07-09

solving job-shop scheduling problems by genetic algorithms based on building block hypothesis_第1页
solving job-shop scheduling problems by genetic algorithms based on building block hypothesis_第2页
solving job-shop scheduling problems by genetic algorithms based on building block hypothesis_第3页
solving job-shop scheduling problems by genetic algorithms based on building block hypothesis_第4页
solving job-shop scheduling problems by genetic algorithms based on building block hypothesis_第5页
资源描述:

《solving job-shop scheduling problems by genetic algorithms based on building block hypothesis》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、SolvingJob-ShopSchedulingProblemsbyGeneticAlgorithmsBasedonBuildingBlockHypothesisInternati0nalJournalofP1antEngineeringandManagementVo1.11No.2June2006SolvingJob.ShopSchedulingProblemsbyGeneticAlgorithmsBasedonBuildingBlockHypothesisCHENGRong.CHENYou-ping,LIZhi—ga

2、ng'1.CollegeofEngineeringandTechnology,ShenzhenUniversity,Shenzhen518060,P.R.China2.SchoolofMaterialsScience&Engineering,HuazhongUniversityofScienceandTechnology,Wuhan430070,P.R.China/nthispaper.wepropose口ngeneticalgorithmforjob—shopschedulingproblems(JSP)?met

3、hodusestheoperation—basedrepresentation,basedonschematheoremandbuildingblockhypothesis.口删crossoverisproposed:Byselectingshort,loworderhighlyfitschemastogenet—icoperator,thecrossovercanexchangemeaningfulorderinginformationofparentseffectivelyandcansearchtheglobalop

4、timization.SimulationresultsonMTbenchmarkproblemcodedbyC++showthatourgeneticoperatorsareverypowerfulandsuitabletojob—shopschedulingproblemsandOUI"methodoutpeoCo几thepreviousGA—basedapproaches.Keywords:job—shopscheduling,geneticalgorithm,schematheorem,buildingblockh

5、ypothesis1IntroductionJob..shopschedulingproblem(JSP)areknownasoneofthemostdifficultorderingproblems.Severalgeneticalgorithm(GA)approacheshavebeentriedtoJSP,,',,.AlthoughtheGAenablesUStoobtaingood—qualitysolutionsquicklyandeasilycomparedtoothersearchtechniques,the

6、restillexistperformancegapsbetweenGA—basedapproachesandotherspecializedexacttechniques.Inthispaper,thecrossoverisconsideredasamainsearchoperator.ToapplyGAsuccessfullytoJSP,thefollowingcriteriashouldbesatisfied引:(1)completeness,anysolutionshouldhaveitsencoding;(2)s

7、oundness,anycodeproducedbygeneticoperatorsshouldhaveitscorrespondingsolution;(3)non—redundancy.codesandsolutionshouldbeonetoone;(4)characteristics—preserving,childrenshouldinheritusefulcharacteristicsfromparents.Inthispaper,weuseoperation—basedrepresenta—tionasenc

8、odingandintroduceanimprovedpartialschedulingexchangecrossoverbasedonschematheoremandbuildingblockhypothesisascrossoveroperator,byselectingshort,loworder

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。