E. S. Solano Charris, J. Montoya-Torres, Carlos D. Paternina-Arboleda
{"title":"Multi-criteria optimization evolving artificial ants as a computational intelligence technique","authors":"E. S. Solano Charris, J. Montoya-Torres, Carlos D. Paternina-Arboleda","doi":"10.1109/ICICISYS.2009.5358313","DOIUrl":null,"url":null,"abstract":"This paper presents the application Ant Colony Optimization (ACO) to slve multi-criteria combinatorial optimization problems. The proposed decision support technique is validated on the Hybrid Flowshop Scheduling Problem with minimization of both the makespan and the total completion time of jobs. This problem is considered to be strongly NP-hard and has been little studied literature. Our algorithm is compared against other well-known heuristics from the literature adapted to solve this problem and experimental results show that our algorithm outperforms them.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICISYS.2009.5358313","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper presents the application Ant Colony Optimization (ACO) to slve multi-criteria combinatorial optimization problems. The proposed decision support technique is validated on the Hybrid Flowshop Scheduling Problem with minimization of both the makespan and the total completion time of jobs. This problem is considered to be strongly NP-hard and has been little studied literature. Our algorithm is compared against other well-known heuristics from the literature adapted to solve this problem and experimental results show that our algorithm outperforms them.