Vincent C. Li, Yun-Chia Liang, Yu-Yen Sun, You-Shan Chen
{"title":"A scatter search method for the multidimensional knapsack problem with generalized upper bound constraints","authors":"Vincent C. Li, Yun-Chia Liang, Yu-Yen Sun, You-Shan Chen","doi":"10.1080/10170669.2012.743643","DOIUrl":null,"url":null,"abstract":"In this article, a scatter search (SS) heuristic is proposed to solve the multidimensional knapsack problem with generalized upper bound constraints (GUBMKP). The method is organized according to the general structure of SS. We discuss the design and implementation for each of the components of SS. A greedy randomized adaptive search procedure is applied in order to diversify the initial solutions. In order to select diversified solutions to enter the reference set, we propose an algorithm based on the structure of generalized upper bound constraints. Several approaches of combining solutions are proposed to solve the problem. The computational results show the heuristic is competitive compared to the former leading method for the GUBMKP.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Chinese Institute of Industrial Engineers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10170669.2012.743643","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this article, a scatter search (SS) heuristic is proposed to solve the multidimensional knapsack problem with generalized upper bound constraints (GUBMKP). The method is organized according to the general structure of SS. We discuss the design and implementation for each of the components of SS. A greedy randomized adaptive search procedure is applied in order to diversify the initial solutions. In order to select diversified solutions to enter the reference set, we propose an algorithm based on the structure of generalized upper bound constraints. Several approaches of combining solutions are proposed to solve the problem. The computational results show the heuristic is competitive compared to the former leading method for the GUBMKP.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
