MERGING OPTIMALITY CONDITIONS WITH GENETIC ALGORITHM OPERATORS TO SOLVE SINGLE MACHINE TOTAL WEIGHTED TARDINESS PROBLEM

在线阅读 下载PDF 导出详情
摘要 Inthispaper,aconstrainedgeneticalgorithm(CGA)isproposedtosolvethesinglemachinetotalweightedtardinessproblem.TheproposedCGAincorporatesdominancerulesfortheproblemunderconsiderationintotheGAoperators.ThisincorporationshouldenabletheproposedCGAtoobtainclosetooptimalsolutionswithmuchlessdeviationandmuchlesscomputationaleffortthantheconventionalGA(UGA).SeveralexperimentswereperformedtocomparethequalityofsolutionsobtainedbythethreeversionsofboththeCGAandtheUGAwiththeresultsobtainedbyadynamicprogrammingapproach.ThecomputationalresultsshowedthattheCGAwasbetterthantheUGAinbothqualityofsolutionsobtainedandtheCPUtimeneededtoobtaintheclosetooptimalsolutions.ThethreeversionsoftheCGAreducedthepercentagedeviationby15.6%,61.95%,and25%respectivelyandobtainedclosetooptimalsolutionswith59%lowerCPUtimethanwhatthethreeversionsoftheUGAdemanded.TheCGAperformedbetterthantheUGAintermsofqualityofsolutionsandcomputationaleffortwhenthepopulationsizeandthenumberofgenerationsaresmaller.
机构地区 不详
出版日期 2005年02月12日(中国期刊网平台首次上网日期,不代表论文的发表时间)