Antonin Ponsich, Ma. Guadalupe Castillo Tapia, C. Coello
{"title":"用差分进化求解置换问题:在作业车间调度问题中的应用","authors":"Antonin Ponsich, Ma. Guadalupe Castillo Tapia, C. Coello","doi":"10.1109/ISDA.2009.49","DOIUrl":null,"url":null,"abstract":"This study addresses the solution of Jobshop Scheduling Problems using Differential Evolution (DE). The issue of representing permutations through real numbers constitutes the key issue for developing an efficient implementation. Several techniques are empirically validated on problem instances traditionally adopted in the specialized literature. We also present a simple hybridization of DE with tabu search, which produces significant performance gains.","PeriodicalId":330324,"journal":{"name":"2009 Ninth International Conference on Intelligent Systems Design and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Solving Permutation Problems with Differential Evolution: An Application to the Jobshop Scheduling Problem\",\"authors\":\"Antonin Ponsich, Ma. Guadalupe Castillo Tapia, C. Coello\",\"doi\":\"10.1109/ISDA.2009.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study addresses the solution of Jobshop Scheduling Problems using Differential Evolution (DE). The issue of representing permutations through real numbers constitutes the key issue for developing an efficient implementation. Several techniques are empirically validated on problem instances traditionally adopted in the specialized literature. We also present a simple hybridization of DE with tabu search, which produces significant performance gains.\",\"PeriodicalId\":330324,\"journal\":{\"name\":\"2009 Ninth International Conference on Intelligent Systems Design and Applications\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Ninth International Conference on Intelligent Systems Design and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISDA.2009.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Ninth International Conference on Intelligent Systems Design and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2009.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving Permutation Problems with Differential Evolution: An Application to the Jobshop Scheduling Problem
This study addresses the solution of Jobshop Scheduling Problems using Differential Evolution (DE). The issue of representing permutations through real numbers constitutes the key issue for developing an efficient implementation. Several techniques are empirically validated on problem instances traditionally adopted in the specialized literature. We also present a simple hybridization of DE with tabu search, which produces significant performance gains.