MATEC Web Conf.
Volume 210, 201822nd International Conference on Circuits, Systems, Communications and Computers (CSCC 2018)
|Number of page(s)||5|
|Published online||05 October 2018|
Local search for parallel optimization algorithms for high diminsional optimization problems
Cairo University, Cairo, Egypt
* Corresponding author: firstname.lastname@example.org
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.
Key words: local search / optimization algorithms / paralell algorithms / high dimensional subset problems
© The Authors, published by EDP Sciences, 2018
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.