{"title":"求解二次三维分配问题的混合PSO-TS方法","authors":"Imène Ait Abderrahim, Lakhdar Loukil","doi":"10.1109/EDIS.2017.8284041","DOIUrl":null,"url":null,"abstract":"The quadratic three-dimensional assignment problem (Q3AP) is a generalization of the well-known quadratic assignment problem (QAP). Unlike QAP which has been extensively studied by the combinatorial optimization community, few works have been devoted to the resolution of the Q3AP which is proved to be an NP-hard problem. In this paper, a particle swarm optimization algorithm hybridized with a tabu search is presented to solve the quadratic three-dimensional assignment problem.","PeriodicalId":401258,"journal":{"name":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Hybrid PSO-TS approach for solving the quadratic three-dimensional assignment problem\",\"authors\":\"Imène Ait Abderrahim, Lakhdar Loukil\",\"doi\":\"10.1109/EDIS.2017.8284041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The quadratic three-dimensional assignment problem (Q3AP) is a generalization of the well-known quadratic assignment problem (QAP). Unlike QAP which has been extensively studied by the combinatorial optimization community, few works have been devoted to the resolution of the Q3AP which is proved to be an NP-hard problem. In this paper, a particle swarm optimization algorithm hybridized with a tabu search is presented to solve the quadratic three-dimensional assignment problem.\",\"PeriodicalId\":401258,\"journal\":{\"name\":\"2017 First International Conference on Embedded & Distributed Systems (EDiS)\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 First International Conference on Embedded & Distributed Systems (EDiS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDIS.2017.8284041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 First International Conference on Embedded & Distributed Systems (EDiS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDIS.2017.8284041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hybrid PSO-TS approach for solving the quadratic three-dimensional assignment problem
The quadratic three-dimensional assignment problem (Q3AP) is a generalization of the well-known quadratic assignment problem (QAP). Unlike QAP which has been extensively studied by the combinatorial optimization community, few works have been devoted to the resolution of the Q3AP which is proved to be an NP-hard problem. In this paper, a particle swarm optimization algorithm hybridized with a tabu search is presented to solve the quadratic three-dimensional assignment problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
