A brief analysis of evolutionary algorithms for the dynamic multiobjective subset sum problem.
The paper investigate the behavior of evolutionary algorithms for solving multiobjective combinatorial problems in dynamic environments. Present work envisages the multiobjective subset sum problem which is known as an NP-hard problem. Several test and analysis are performed in order to asses the advantages and to point out the disadvantages and drawbacks of these classes of algorithms.
Citation:Comsa, I., Grosan, C. and Yang, S. (2011) A brief analysis of evolutionary algorithms for the dynamic multiobjective subset sum problem. Studia Universitatis Babes-Bolyai, Series Informatica, LVI(2), June 2011, pp. 87-94.
Research Group:Centre for Computational Intelligence