Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem
Authors:
- Zhi-Gang RenZRZhi-Gang Ren
- Zu-Ren FengZFZu-Ren Feng
- Ai-Min ZhangAZAi-Min Zhang
- 1 January 2012
- journal article
- Published by Elsevier in Information Sciences
- Vol. 182 (1) , 15-29
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- An efficient hybrid algorithm for resource-constrained project schedulingInformation Sciences, 2010
- A column generation method for the multiple-choice multi-dimensional knapsack problemComputational Optimization and Applications, 2008
- Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hullsComputers & Operations Research, 2006
- Heuristic algorithms for the multiple-choice multidimensional knapsack problemJournal of the Operational Research Society, 2004
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 2004
- The Hyper-Cube Framework for Ant Colony OptimizationIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2004
- Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem2001
- A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 1998
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996