A new ant colony optimization algorithm for the multidimensional Knapsack problem Export

@article{citeulike:5291376, abstract = {The paper proposes a new ant colony optimization (ACO) approach, called binary ant system (BAS), to multidimensional Knapsack problem (MKP). Different from other ACO-based algorithms applied to MKP, BAS uses a pheromone laying method specially designed for the binary solution structure, and allows the generation of infeasible solutions in the solution construction procedure. A problem specific repair operator is incorporated to repair the infeasible solutions generated in every iteration. Pheromone update rule is designed in such a way that pheromone on the paths can be directly regarded as selecting probability. To avoid premature convergence, the pheromone re-initialization and different pheromone intensification strategy depending on the convergence status of the algorithm are incorporated. Experimental results show the advantages of BAS over other ACO-based approaches for the benchmark problems selected from OR library.}, author = {Kong, M. and Tian, P. and Kao, Y.}, citeulike-article-id = {5291376}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.cor.2006.12.029}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0305054806003236}, day = {08}, doi = {10.1016/j.cor.2006.12.029}, issn = {03050548}, journal = {Computers \& Operations Research}, keywords = {2007, ant-system, metaheuristics, mmkp, optimization}, month = {January}, posted-at = {2009-07-28 15:19:02}, priority = {2}, title = {A new ant colony optimization algorithm for the multidimensional Knapsack problem}, url = {http://dx.doi.org/10.1016/j.cor.2006.12.029}, year = {2007} }

TY - JOUR ID - citeulike:5291376 L3 - citeulike-article-id:5291376 N2 - The paper proposes a new ant colony optimization (ACO) approach, called binary ant system (BAS), to multidimensional Knapsack problem (MKP). Different from other ACO-based algorithms applied to MKP, BAS uses a pheromone laying method specially designed for the binary solution structure, and allows the generation of infeasible solutions in the solution construction procedure. A problem specific repair operator is incorporated to repair the infeasible solutions generated in every iteration. Pheromone update rule is designed in such a way that pheromone on the paths can be directly regarded as selecting probability. To avoid premature convergence, the pheromone re-initialization and different pheromone intensification strategy depending on the convergence status of the algorithm are incorporated. Experimental results show the advantages of BAS over other ACO-based approaches for the benchmark problems selected from OR library. JF - Computers & Operations Research SN - 03050548 TI - A new ant colony optimization algorithm for the multidimensional Knapsack problem KW - 2007 KW - ant-system KW - metaheuristics KW - mmkp KW - optimization AU - Kong, M AU - Tian, P AU - Kao, Y PY - 2007/01/08/ UR - http://dx.doi.org/10.1016/j.cor.2006.12.029 ER -