A new evolutionary algorithm for the multiobjective knapasck problem.
Groşan, Crina, Oltean, Mihai, Dumitrescu, D. (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Groşan, Crina, Oltean, Mihai, Dumitrescu, D. (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Rotar, Corina (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Adam Piotrowski, Jarosław Napiórkowski (2010)
Control and Cybernetics
Similarity:
Khun, Jiří, Šimeček, Ivan
Similarity:
Parallelization is one of possible approaches for obtaining better results in terms of algorithm performance and overcome the limits of the sequential computation. In this paper, we present a study of parallelization of the opt-aiNet algorithm which comes from Artificial Immune Systems, one part of large family of population based algorithms inspired by nature. The opt-aiNet algorithm is based on an immune network theory which incorporates knowledge about mammalian immune systems in...
Thomas Stützle, Sebastian Linke (2002)
Mathware and Soft Computing
Similarity:
A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally...
Thibaut Lust, Jacques Teghem (2008)
RAIRO - Operations Research
Similarity:
We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the first parent. A local search is then applied to the offspring. We experiment this scheme with...
Zou, Wenping, Zhu, Yunlong, Chen, Hanning, Sui, Xin (2010)
Discrete Dynamics in Nature and Society
Similarity:
Angelova, Maria, Tzonkov, Stoyan, Pencheva, Tania (2010)
Serdica Journal of Computing
Similarity:
Fermentation processes as objects of modelling and high-quality control are characterized with interdependence and time-varying of process variables that lead to non-linear models with a very complex structure. This is why the conventional optimization methods cannot lead to a satisfied solution. As an alternative, genetic algorithms, like the stochastic global optimization method, can be applied to overcome these limitations. The application of genetic algorithms is a precondition for...