Multidimensional knapsack problem: A fitness landscape analysis

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 38, Issue 3, 2008, Pages 604-616

  Tavares, Jorge ^a   Pereira, Francisco B ^b   Costa, Ernesto ^a  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b POLYTECHNIC INSTITUTE OF COIMBRA   (Portugal)

Author keywords

Fitness landscape analysis; Heuristic bias; Local improvement methods; Representation

Indexed keywords

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; MATHEMATICAL OPERATORS; NUMERICAL ANALYSIS;

FITNESS LANDSCAPE ANALYSIS; HEURISTIC BIAS; LOCAL IMPROVEMENT METHODS;

CYBERNETICS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; SIGNAL PROCESSING; THEORETICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; MODELS, THEORETICAL; SIGNAL PROCESSING, COMPUTER-ASSISTED;

EID: 44849142407     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2008.915539     Document Type: Article

References (28)

1. K. Deb, "Introduction to representations," in Evolutionary Computation 1: Basic Algorithms and Operators, T. Bäck, D. B. Fogel, and Z. Michalewicz, Eds. Bristol, U.K.: Inst. Phys. Publishing, 2000, ch. 14, pp. 127-131.
2. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms New York: Springer-Verlag, 2002.
3. S. Wright, "The roles of mutation, inbreeding, crossbreeding and selection in evolution," in Proc. VI Int. Conf. Genetics, 1932, vol. 1, pp. 356-366.
4. P. Chu and J. Beasley, "A genetic algorithm for the multidimensional knapsack problem," J. Heuristics, vol. 4, no. 1, pp. 63-86, 1998.
5. J. Tavares, F. B. Pereira, and E. Costa, "The role of representation on the multidimensional knapsack problem by means of fitness landscape analysis," in Proc. Congr. Evol. Comput., Jul. 16-21, 2006, pp. 2307-2314.
6. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. New York: Wiley, 1990.
7. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. New York: Springer-Verlag, 2004.
8. J. Gottlieb, "Evolutionary algorithms for constrained optimization problems," Ph.D. dissertation, Tech. Univ. Clausthal, Clausthal-Zellerfeld, Germany, 1999.
9. G. R. Raidl, "An improved genetic algorithm for the multiconstrained 0-1 knapsack problem," in Proc. 5th IEEE Conf. Evol. Comput., IEEE World Congr. Comput. Intell., Anchorage, AK, May 1998, pp. 207-211.
10. Z. Michalewicz and J. Arabas, "Genetic algorithms for the 0/1 knapsack problem," in Proc. 8th ISMIS, 1994, pp. 134-143.
11. R. Hinterding, "Mapping order-independent genes and the knapsack problem," in Proc. 1st IEEE Int. Conf. Evol. Comput., 1994, pp. 13-17.
12. J. Thiel and S. Voss, "Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms," INFOR, vol. 32, no. 4, pp. 226-242, 1994.
13. J. Gottlieb, "Permutation-based evolutionary algorithms for multidimensional knapsack problems," in Proc. ACM SAC, 2000, pp. 408-414.
14. J. Gottlieb, "On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems," in Proc. EvoWorkshops Appl. Evol. Comput., 2001, pp. 50-59.
15. J. Gottlieb and G. R. Raidl, "Characterizing locality in decoder-based EAs for the multidimensional knapsack problem," in Proc. Sel. Papers 4th Eur. Conf. AE, 2000, pp. 38-52.
16. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed. Berlin, Germany: Springer-Verlag, 1992.
17. J. C. Bean, "Genetic algorithms and random keys for sequencing and optimization," ORSA J. Comput., vol. 6, no. 2, pp. 154-160, 1994.
18. R. Hinterding, "Representation, constraint satisfaction and the knapsack problem," in Proc. Congr. Evol. Comput., P. J. Angeline, Z. Michalewicz, M. Schoenauer, X. Yao, and A. Zalzala, Eds., Jul. 6-9, 1999, vol. 2, pp. 1286-1292.
19. C. Cotta and J. Troya, "A hybrid genetic algorithm for the 0-1 multiple knapsack problem," in Artificial Neural Nets and Genetic Algorithms 3, G. Smith, N. Steele, and R. Albrecht, Eds. New York: Springer-Verlag, 1998, pp. 251-255.
20. G. Raidl, "Weight-codings in a genetic algorithm for the multiconstraint knapsack problem," in Proc. Congr. Evol. Comput., P. J. Angeline, Z. Michalewicz, M. Schoenauer, X. Yao, and A. Zalzala, Eds., Jul. 6-9, 1999, vol. 1, pp. 596-603.
21. G. R. Raidl and J. Gottlieb, "Empirical analysis of locality heriability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem," Evol. Comput. J., vol. 13, no. 4, pp. 441-475, Dec. 2005.
22. B. Manderick, M. de Weger, and P. Spiessens, "The genetic algorithm and the structure of the fitness landscape," in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 143-150.
23. T. Jones, "Evolutionary Algorithms, Fitness landscapes and search," Ph.D. dissertation, Univ. New Mexico, Albuquerque, NM, May 1995.
24. C. R. Reeves, "Fitness landscapes and evolutionary algorithms," in Proc. Sel. Papers 4th Eur. Conf. AE, 1999, pp. 3-20.
25. P. Merz, "Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies," Ph.D. dissertation, Univ. Siegen, Siegen, Germany, 2000.
26. W. Hordijk and B. Manderick, "The usefulness of recombination," in Proc. 3rd Eur. Conf. Artif. Life, 1995, pp. 908-919.
27. L. Altenberg, "Fitness distance correlation analysis: An instructive counterexample," in Proc. 7th ICGA, 1997, pp. 57-64.
28. B. Sendhoff, M. Kreutz, and W. V. Seelen, "A condition for the genotype-phenotype mapping: Casualty," in Proc. 7th Int. Conf. Genetic Algorithms, 1997, pp. 73-80.