Local search for parallel optimization algorithms for high diminsional optimization problems

Local search algorithms perform an important role when being employed with optimization algorithms tackling numerous optimization problems since they lead to getting better solutions. However, this is not practical in many applications as they do not contribute to the search process. This was not much studied previously for traditional optimization algorithms or for parallel optimization algorithms. This paper investigates this issue for parallel optimization algorithms when tackling high dimensional subset problems. The acquired results show impressive recommendations.

[1]  Anupam Shukla,et al.  Real Life Applications of Soft Computing , 2010 .

[2]  Urfat Nuriyev,et al.  A New Genetic Algorithm for the 0-1 Knapsack Problem , 2016 .

[3]  Jihoon Yang,et al.  Feature Subset Selection Using a Genetic Algorithm , 1998, IEEE Intell. Syst..

[4]  Zdenek Konfrst,et al.  Parallel Genetic Algorithms: Advances, Computing Trends, Applications and Perspectives , 2004, IPDPS.

[5]  Stefka Fidanova.  Ant Colony Optimization and Multiple Knapsack Problem , 2007 .

[6]  Marco Dorigo.  Ant colony optimization , 2004, Scholarpedia.

[7]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[8]  Vittorio Maniezzo,et al.  An Ant-Based Framework for Very Strongly Constrained Problems , 2002, Ant Algorithms.

[9]  Enrique Alba,et al.  Parallel Genetic Algorithms , 2011, Studies in Computational Intelligence.

[10]  Nadia Abd-Alsabour,et al.  Hybrid Metaheuristics for Classification Problems , 2016 .

[11]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms in Combinatorial Optimization , 1992, Computer Science and Operations Research.

[12]  El-Ghazali Talbi,et al.  GPU-based island model for evolutionary algorithms , 2010, GECCO '10.

[13]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[14]  Anton Bondarenko,et al.  On Application of the Local Search and the Genetic Algorithms Techniques to Some Combinatorial Optimization Problems , 2010, ArXiv.

[15]  Chu-Hsing Lin,et al.  Parallel genetic algorithms on the graphics processing units using island model and simulated annealing , 2017 .

[16]  Vittorio Maniezzo,et al.  VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH , 2008, Cybern. Syst..

[17]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[18]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[19]  Olympia Roeva,et al.  Influence of the population size on the genetic algorithm performance in case of cultivation process modelling , 2013, 2013 Federated Conference on Computer Science and Information Systems.

[20]  D. Bridge,et al.  Chapter I An Ant Colony Optimization MetaHeuristic for Subset Selection Problems , 2022 .