Extremal Optimisation with a Penalty Approach for the Multidimensional Knapsack Problem
The extremal optimisation (EO) meta-heuristic is a recent form of search that is suitable for combinatorial optimisation problems. EO has been applied to problems such as graph partitioning, spin glass, and graph colouring. However, only a relatively small amount of work has been done on other combinatorial problems particularly those having constraints. This paper examines the issue of satisfying constraints with a penalty approach using the multidimensional knapsack problem. An EO model is presented which finds solutions through the analysis of the number of overloaded constraints. This approach allows the solution state move between feasible and infeasible spaces. The results show that the new algorithm is able to obtain optimal results for small problems and finds competitive solutions for large problems.
Unable to display preview. Download preview PDF.
- 1.Boettcher, S., Percus, A.: Evolutionary strategies for extremal optimization: Methods derived from co-evolution. In: Proceedings of GECCO 1999 (1999)Google Scholar
- 5.Boettcher, S., Percus, A.: Extremal optimization: An evolutionary local-search algorithm. In: 8th INFORMS Computer Society Conference (2003)Google Scholar
- 6.Randall, M., Lewis, A.: An extended extremal optimisation model for parallel architectures. In: 2nd International Conference on e-Science and Grid Computing (2006)Google Scholar
- 9.Hendtlass, T., Moser, I., Randall, M.: Dynamic problems and nature inspired meta-heuristics. In: 2nd IEEE International Conference on e-Science and Grid Computing (2006)Google Scholar
- 10.Chen, M.R., Lu, Y.Z., Luo, Q.: A novel hybrid algorithm with marriage of particle swarm optimization and extremal optimization. Optimization Online (2007)Google Scholar
- 11.Chen, Y.W., Lu, Y.Z., Yang, G.K.: Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling. International Journal of Advanced Manufacturing Technology (2007)Google Scholar
- 13.Gottlieb, J.: Permutation-based evolutionary algorithms for multidimensional knapsack problems. In: 2000 ACM symposium on applied computing, pp. 408–414 (2000)Google Scholar
- 14.Raidl, G.R.: An improved genetic algorithm for the multiconstrained 0-1 knapsack problem (1998)Google Scholar
- 15.Vasquez, M., Hao, J.: A hybrid approach for the 0-1 multidimensional knapsack problem. In: International Joint Conference on Artif. Intell., pp. 328–333 (2001)Google Scholar
- 21.Uyar, S., Eryiğit, G.: Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach. In: Proceedings of GECCO 2005, pp. 1257–1264 (2005)Google Scholar