{"title":"针对装箱问题的一种可变邻域混合和谐搜索算法","authors":"M. Castelli, L. Vanneschi","doi":"10.1109/NABIC.2014.6921849","DOIUrl":null,"url":null,"abstract":"This paper proposes a hybrid Harmony Search algorithm for the bin-packing problem. The bin-packing problem is a well-known NP-Hard optimization problem. The proposed algorithm (called BPHS) combines a harmony search algorithm, that employs a tournament selection in the generation of new candidate solutions, with a variable neighbourhood search to improve the exploitation ability of the algorithm. The BPHS algorithm has been successfully applied to different instances of the bin-packing problem and it is able to find optimal or near-optimal solutions.","PeriodicalId":209716,"journal":{"name":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A hybrid Harmony search algorithm with variable neighbourhood search for the bin-packing problem\",\"authors\":\"M. Castelli, L. Vanneschi\",\"doi\":\"10.1109/NABIC.2014.6921849\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a hybrid Harmony Search algorithm for the bin-packing problem. The bin-packing problem is a well-known NP-Hard optimization problem. The proposed algorithm (called BPHS) combines a harmony search algorithm, that employs a tournament selection in the generation of new candidate solutions, with a variable neighbourhood search to improve the exploitation ability of the algorithm. The BPHS algorithm has been successfully applied to different instances of the bin-packing problem and it is able to find optimal or near-optimal solutions.\",\"PeriodicalId\":209716,\"journal\":{\"name\":\"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NABIC.2014.6921849\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NABIC.2014.6921849","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hybrid Harmony search algorithm with variable neighbourhood search for the bin-packing problem
This paper proposes a hybrid Harmony Search algorithm for the bin-packing problem. The bin-packing problem is a well-known NP-Hard optimization problem. The proposed algorithm (called BPHS) combines a harmony search algorithm, that employs a tournament selection in the generation of new candidate solutions, with a variable neighbourhood search to improve the exploitation ability of the algorithm. The BPHS algorithm has been successfully applied to different instances of the bin-packing problem and it is able to find optimal or near-optimal solutions.