A brief analysis of evolutionary algorithms for the dynamic multiobjective subset sum problem.
Date
2011
Authors
Advisors
Journal Title
Journal ISSN
ISSN
1224-869x
DOI
Volume Title
Publisher
Babes-Bolyai University, Faculty of Mathematics and Computer Science.
Type
Article
Peer reviewed
Abstract
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.
Description
Keywords
Discret mathematics, Graph theory, Graphy algorithms, Dynamic environment, Multiobjective optimization, NP-completeness
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.