On the performance of linkage-tree genetic algorithms for the multidimensional knapsack problem

Neurocomputing

Volumn 146, Issue , 2014, Pages 17-29

  Martins, Jean P ^a   Fonseca, Carlos M ^b   Delbem, Alexandre C B ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Linkage learning usefulness; Linkage tree GA; Multidimensional knapsack problem

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; FORESTRY; GENETIC ALGORITHMS; ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; OPTIMIZATION; TREES (MATHEMATICS);

EFFECTIVE ALGORITHMS; ESTIMATION OF DISTRIBUTION ALGORITHMS; FOCUS OF RESEARCHES; GENETIC ALGORITHM (GAS); LINKAGE-LEARNING USEFULNESS; MACHINE LEARNING TECHNIQUES; MULTIDIMENSIONAL KNAPSACK PROBLEMS; OPTIMIZATION PROBLEMS; LINKAGE LEARNING;

PROBLEM SOLVING;

ACCURACY; ANALYTICAL ERROR; ARTICLE; AVERAGE RUNNING TIME; CHU AND BEASLEY GENETIC ALGORITHM; COMPARATIVE STUDY; COMPLETE LINKAGE TREE GENETIC ALGORITHM; COMPLETE RANDOM LINKAGE TREE GENETIC ALGORITHM; CONTROLLED STUDY; DIVERSITY PRESERVATION; EXPERIMENTAL DESIGN; FEASIBILITY STUDY; GENETIC ALGORITHM; LINKAGE TREE GENETIC ALGORITHM; LINKAGE TREE LEARNING; MACHINE LEARNING; MULTIDIMENSIONAL KNAPSACK PROBLEM; NUMBER OF FUNCTION EVALUATION; PRIORITY JOURNAL; PROBLEM SOLVING; PROCESS OPTIMIZATION; QUALITY CONTROL; RANDOM LINKAGE TREE GENETIC ALGORITHM; SORTED LINKAGE TREE GENETIC ALGORITHM; SORTED RANDOM LINKAGE TREE GENETIC ALGORITHM; STATISTICAL CONCEPTS; STATISTICAL MODEL; STATISTICAL PARAMETERS; CALCULATION; GENETIC LINKAGE; GENETIC VARIABILITY; LEARNING ALGORITHM; LINEAR SYSTEM; MATHEMATICAL COMPUTING; MATHEMATICAL PHENOMENA; MUTATIONAL ANALYSIS; POPULATION SIZE; PROBABILITY;

ALGORITHMS; FORESTRY; OPTIMIZATION; PROBLEM SOLVING;

EID: 84906947664     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2014.04.069     Document Type: Article

References (67)

1. Simon H. The Sciences of the Artificial 1996, The MIT Press, Cambridge, MA, USA.
2. Simon H.A. Near decomposability and the speed of evolution. Ind Corp Change 2002, 11(3):587-599. 10.1093/icc/11.3.587.
3. Holland J.H. Adaptation in Natural and Artificial Systems 1975, The University of Michigan Press, Ann Arbor.
4. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning 1989, Addison-Wesley Professional, Boston, MA, USA.
5. Goldberg D. The Design of Innovation: Lessons from and for Competent Genetic Algorithms 2002, Kluwer Academic Publishers, Norwell, MA, USA.
6. G. Harik, Learning Gene Linkage to Efficiently Solve Problems of Bounded Difficulty Using Genetic Algorithms (Ph.D. thesis), The University of Michigan, 1997.
7. Fan K.-C., Yu T.-L., Lee J.-T. Linkage learning by number of function evaluations estimation. practical view of building blocks. Inf. Sci. 2013, 230(0):162-182. (Mobile and Internet Services in Ubiquitous and Pervasive Computing Environments). 10.1016/j.ins.2012.12.032.
8. M. Pelikan, NK landscapes, problem difficulty, and hybrid evolutionary algorithms, in: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO '10, ACM, New York, NY, USA, 2010, pp. 665-672, doi:10.1145/1830483.1830606.
9. Hauschild M., Pelikan M. An introduction and survey of estimation of distribution algorithms. Swarm Evol. Comput. 2011, 1(3):111-128. 10.1016/j.swevo.2011.08.003.
10. D. Thierens, The Linkage Tree Genetic Algorithm, in: Parallel Problem Solving from Nature, PPSN XI, Vol. 6238 of Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2010, pp. 264-273, doi:10.1007/978-3-642-15844-5_27.
11. M. Pelikan, M.W. Hauschild, D. Thierens, Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm, in: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO '11, ACM, New York, NY, USA, 2011, pp. 1005-1012, doi:10.1145/2001576.2001713.
12. D. Thierens, P.A. Bosman, Optimal mixing evolutionary algorithms, in: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO '11, ACM, New York, NY, USA, 2011, pp. 617-624, doi:10.1145/2001576.2001661.
13. Crocomo M.K., Martins J.P., Delbem A.C.B. Decomposition of black-box optimization problems by community detection in Bayesian networks. Int. J. Nat. Comput. Res. 2013, 3(4):1-19. 10.4018/jncr.2012100101.
14. D.J. Coffin, R.E. Smith, The limitations of distribution sampling for linkage learning, in: IEEE Congress on Evolutionary Computation (CEC 2007), 2007, pp. 364-369, doi:10.1109/CEC.2007.4424494.
15. S.-C. Chen, T.-L. Yu, Difficulty of linkage learning in estimation of distribution algorithms, in: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO '09), ACM, New York, NY, USA, 2009, pp. 397-404, doi:10.1145/1569901.1569957.
16. C. Echegoyen, Q. Zhang, A. Mendiburu, R. Santana, J. Lozano, On the limits of effectiveness in estimation of distribution algorithms, in: 2011 IEEE Congress on Evolutionary Computation (CEC), pp. 1573-1580, doi:10.1109/CEC.2011.5949803.
17. J.P. Martins, C. Bringel Neto, M.K. Crocomo, K. Vittori, A.C.B. Delbem, A comparison of linkage-learning-based genetic algorithms in multidimensional knapsack problems, in: 2013 IEEE Congress on Evolutionary Computation (CEC), vol. 1, pp. 502-509, doi:10.1109/CEC.2013.6557610.
18. J.P. Martins, A.C.B. Delbem, The influence of linkage-learning in the linkage-tree GA when solving multidimensional knapsack problems, in: Proceeding of the Fifteenth Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), ACM, New York, NY, USA, 2013, pp. 821-828, doi:10.1145/2463372.2463476.
19. Wolpert D., Macready W. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 2002, 1(1):67-82.
20. Zhang J., Zhan Z.-H., Lin Y., Chen N., Gong Y.-J., Zhong J.-h., Chung H.-H., Li Y., Shi Y.-h. Evolutionary computation meets machine learning. a survey. IEEE Comput. Intell. Mag. 2011, 6(4):68-75. 10.1109/MCI.2011.942584.
21. Freville A. The multidimensional 0-1 knapsack problem. an overview. Eur. J. Oper. Res. 2004, 155(1):1-21. 10.1016/S0377-2217(03)00274-1.
22. Puchinger J., Raidl G.R., Pferschy U. The multidimensional knapsack problem. structure and algorithms. INFORMS J. Comput. 2010, 22(2):250-265.
23. Kulik A., Shachnai H. There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. 2010, 110(16):707-710. 10.1016/j.ipl.2010.05.031.
24. Gilmore P.C., Gomory R.E. The theory and computation of knapsack functions. Oper. Res. 1966, 14(6):1045-1074. 10.1287/opre.14.6.1045.
25. Weingartner H.M., Ness D.N. Methods for the solution of the multidimensional 0/1 knapsack problem. Oper. Res. 1967, 15(1):83-103. 10.1287/opre.15.1.83.
26. Marsten R.E., Morin T.L. Optimal solutions found for Senju and Toyoda 0/1 integer programming problems. Manag. Sci. 1977, 23(12):1364-1365. 10.1287/mnsc.23.12.1364.
27. Marsten R., Morin T. A hybrid approach to discrete mathematical programming. Math. Program. 1978, 14(1):21-40. 10.1007/BF01588949.
28. Shih W. A branch and bound method for the multiconstraint zero-one knapsack problem. J. Oper. Res. Soc. 1979, 369-378.
29. Gavish B., Pirkul H. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Math. Program. 1985, 31(1):78-105. 10.1007/BF02591863.
30. Bertsimas D., Demir R. An approximate dynamic programming approach to multidimensional knapsack problems. Manag. Sci. 2002, 48(4):550-565. 10.1287/mnsc.48.4.550.208.
31. Boyer V., Elkihel M., Baz D.E. Heuristics for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 2009, 199(3):658-664. 10.1016/j.ejor.2007.06.068.
32. Glover F., Kochenberger G. Critical event tabu search for multidimensional knapsack problems. Meta-Heuristics 1996, 407-427. Springer, US. 10.1007/978-1-4613-1361-8_25. I. Osman, J. Kelly (Eds.).
33. Hanafi S., Freville A. An efficient tabu search approach for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 1998, 106(2-3):659-675. 10.1016/S0377-2217(97)00296-8.
34. Chu P., Beasley J. A genetic algorithm for the multidimensional knapsack problem. J. Heurist. 1998, 4:63-86. 10.1023/A:1009642405419.
35. M. Vasquez, J.-K. Hao, A hybrid approach for the 0-1 multidimensional knapsack problem, in: In Proceedings of the International Joint Conference on Artificial Intelligence 2001, Seattle, Estados Unidos, 2001, pp. 328-333.
36. Vasquez M., Vimont Y. Improved results on the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 2005, 165(1):70-81. 10.1016/j.ejor.2004.01.024.
37. Li V., Curry G. Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search. Comput. Oper. Res. 2005, 32(4):825-848. 10.1016/j.cor.2003.08.021.
38. Li V.C. Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints. Comput. Oper. Res. 2005, 32(11):2843-2852. 10.1016/j.cor.2004.04.020.
39. Li V.C., Liang Y.-C., Chang H.-F. Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method. Comput. Oper. Res. 2012, 39(9):2111-2121. 10.1016/j.cor.2011.10.016.
40. G. Raidl, An improved genetic algorithm for the multiconstrained 0-1 knapsack problem, in: 1998 IEEE International Conference on Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence, pp. 207-211, doi:10.1109/ICEC.1998.699502.
41. J. Gottlieb, Permutation-based evolutionary algorithms for multidimensional knapsack problems, in: Proceedings of the 2000 ACM Symposium on Applied Computing (SAC'00), vol. 1, ACM, New York, NY, USA, 2000, pp. 408-414, doi:10.1145/335603.335866.
42. Gottlieb J. On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems. Applications of Evolutionary Computing, Lecture Notes in Computer Science 2001, vol. 2037:50-59. Springer, Berlin, Heidelberg. 10.1007/3-540-45365-2_6.
43. J. Tavares, F. Pereira, E. Costa, The role of representation on the multidimensional knapsack problem by means of fitness landscape analysis, in: IEEE Congress on Evolutionary Computation (CEC 2006), 2006, pp. 2307-2314, doi:10.1109/CEC.2006.1688593.
44. Tavares J., Pereira F., Costa E. Multidimensional knapsack problem. a fitness landscape analysis. IEEE Trans. Syst., Man, Cybern., Part B: Cybern. 2008, 38(3):604-616. 10.1109/TSMCB.2008.915539.
45. Kong M., Tian P., Kao Y. A new ant colony optimization algorithm for the multidimensional knapsack problem. Comput. Oper. Res. 2008, 35(8):2672-2683. 10.1016/j.cor.2006.12.029.
46. Wang L., Wang S.-y., Xu Y. An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem. Expert Syst. Appl. 2012, 39(5):5593-5599. 10.1016/j.eswa.2011.11.058.
47. Chih M., Lin C.-J., Chern M.-S., Ou T.-Y. Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem. Appl. Math. Model. 2014, 38(4):1338-1350. 10.1016/j.apm.2013.08.009.
48. Azad M.A.K., Rocha A.M.A., Fernandes E.M. Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems. Swarm Evol. Comput. 2014, 14(0):66-75. 10.1016/j.swevo.2013.09.002.
49. Wang L., Fu X., Mao Y., Menhas M.I., Fei M. A novel modified binary differential evolution algorithm and its applications. Neurocomputing 2012, 98(0):55-75. (Bio-inspired Computing and Applications (LSMS-ICSEE' 2010)). 10.1016/j.neucom.2011.11.033.
50. Kellerer H., Pferschy U., Pisinger D. Knapsack Problems 2004, Springer, Berlin, Heidelberg.
51. Hanafi S., Wilbaut C. Improved convergent heuristics for the 0-1 multidimensional knapsack problem. Ann. Oper. Res. 2011, 183(1):125-142. 10.1007/s10479-009-0546-z.
52. Boussier S., Vasquez M., Vimont Y., Hanafi S., Michelon P. A multi-level search strategy for the 0-1 multidimensional knapsack problem. Discret. Appl. Math. 2010, 158(2):97-109. 10.1016/j.dam.2009.08.007.
53. Hill R.R., Cho Y.K., Moore J.T. Problem reduction heuristic for the 0-1 multidimensional knapsack problem. Comput. Oper. Res. 2012, 39(1):19-26. (Special Issue on Knapsack Problems and Applications). 10.1016/j.cor.2010.06.009.
54. Croce F.D., Grosso A. Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. Comput. Oper. Res. 2012, 39(1):27-31. (Special Issue on Knapsack Problems and Applications). 10.1016/j.cor.2011.03.013.
55. Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Oper. Res. 1980, 28(5):1130-1154.
56. Martello S., Pisinger D., Toth P. New trends in exact algorithms for the 0-1 knapsack problem. Eur. J. Oper. Res. 2000, 123(2):325-332. 10.1016/S0377-2217(99)00260-X.
57. Dobson G. Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Math. Oper. Res. 1982, 7(4):515-531.
58. Senju S., Toyoda Y. An approach to linear programming with 0-1 variables. Manag. Sci. 1968, 15(4). pp. B-196-B-207. 10.1287/mnsc.15.4.B196.
59. Fox G.E., Scudder G.D. A heuristic with tie breaking for certain 0-1 integer programming models. Nav. Res. Logist. Quart. 1985, 32(4):613-623. 10.1002/nav.3800320408.
60. Freville A., Plateau G. An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem. Discret. Appl. Math. 1994, 49(1):189-212.
61. Kan A.R., Stougie L., Vercellis C. A class of generalized greedy algorithms for the multi-knapsack problem. Discret. Appl. Math. 1993, 42(2-3):279-290. 10.1016/0166-218X(93)90051-O.
62. Fleszar K., Hindi K.S. Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem. Comput. Oper. Res. 2009, 36(5):1602-1607. 10.1016/j.cor.2008.03.003.
63. Gottlieb J. On the effectivity of evolutionary algorithms for the multidimensional knapsack problem. Artificial Evolution, Lecture Notes in Computer Science 2000, vol. 1829:23-37. Springer, Berlin, Heidelberg. 10.1007/10721187_2.
64. Gronau I., Moran S. Optimal implementations of UPGMA and other common clustering algorithms. Inf. Process. Lett. 2007, 104(6):205-210. 10.1016/j.ipl.2007.07.002.
65. Bosman P., Thierens D. On measures to build linkage trees in LTGA. Parallel Problem Solving from Nature - PPSN XII, Lecture Notes in Computer Science 2012, vol. 7491:276-285. Springer, Berlin, Heidelberg. 10.1007/978-3-642-32937-1_28.
66. T. Cover, J. Thomas, J. Wiley, et al., Elements of Information Theory, vol. 6, Wiley Online Library, Wiley-Interscience, New York, NY, USA, 1991.
67. Kraskov A., Stögbauer H., Andrzejak R.G., Grassberger P. Hierarchical clustering using mutual information. Europhys. Lett. 2005, 70(2):278.