A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan.
Lian, Zhigang (2010)
Discrete Dynamics in Nature and Society
Similarity:
Displaying similar documents to “Multi-swarm that learns”
A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan.
Adaptive bacterial foraging optimization.
Chen, Hanning, Zhu, Yunlong, Hu, Kunyuan (2011)
Abstract and Applied Analysis
Similarity:
Hybrid PSO and GA for global maximization.
Mesloub, Said, Mansour, Abdelouahab (2009)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Cooperative bacterial for aging optimization.
Chen, Hanning, Zhu, Yunlong, Hu, Kunyuan (2009)
Discrete Dynamics in Nature and Society
Similarity:
Far from equilibrium computation and particle swarm optimization.
Dioşan, Laura, Dumitrescu, Dumitru, David, Delia (2006)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
A differential evolution approach to dimensionality reduction for classification needs
Goran Martinović, Dražen Bajer, Bruno Zorić (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
A differential evolution approach to dimensionality reduction for classification needs
Goran Martinović, Dražen Bajer, Bruno Zorić (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery
Mohammed Khabzaoui, Clarisse Dhaenens, El-Ghazali Talbi (2008)
RAIRO - Operations Research
Similarity:
An important task of knowledge discovery deals with discovering association rules. This very general model has been widely studied and efficient algorithms have been proposed. But most of the time, only frequent rules are seeked. Here we propose to consider this problem as a multi-objective combinatorial optimization problem in order to be able to also find non frequent but interesting rules. As the search space may be very large, a discussion about different approaches is proposed...