论文信息 - A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem

A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem

A hybrid genetic algorithm based in local search is described. Local optimisation is not explicitly performed but it is embedded in the exploration of a search metaspace. This algorithm is applied to a NP-hard problem. When it is compared with other GA-based approaches and an exact technique (a branch and bound algorithm), this algorithm exhibits a better overall performance in both cases. Then, a coarse-grain parallel version is tested, yielding notably improved results.

Carlos Cotta | José M. Troya | J. M. Troya | C. Cotta

[1] Ron Shonkwiler,et al. Parallel Genetic Algorithms , 1993, ICGA.

[2] R. Storer,et al. New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[3] Eric R. Zieyel. Operations research : applications and algorithms , 1988 .

[4] Nicholas J. Radcliffe,et al. Forma Analysis and Random Respectful Recombination , 1991, ICGA.

[5] Ingo Rechenberg,et al. Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[6] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[7] W. Vent,et al. Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .

[10] D. Wolpert,et al. No Free Lunch Theorems for Search , 1995 .

[11] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .

[12] Thomas Bäck,et al. The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.

[13] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .