Results 281 to 290 of about 681,060 (327)
Hybridization of Decomposition and Local Search for Multiobjective Optimization [PDF]
IEEE Transactions on Cybernetics, 2014 Combining ideas from evolutionary algorithms, decomposition approaches, and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: memetic algorithm based on decomposition (MOMAD).
Liangjun Ke +2 more
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Tabu search exploiting local optimality in binary optimization
European Journal of Operational Research, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saïd Hanafi +4 more
openaire +2 more sources
Global optimization based on local searches
4OR, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marco Locatelli 0001, Fabio Schoen
openaire +4 more sources
Modularity optimization by Global-Local Search
2016 International Joint Conference on Neural Networks (IJCNN), 2016Modularity is widely used in community detection in network. Despite its great success, one drawback is that its optimization is an NP-complete problem. To this end, this paper designs a new optimization method termed Global-Local-Search (Glo-Loc-Search for short).
Xun Wang +2 more
openaire +1 more source
Local search for distributed asymmetric optimization
International Joint Conference on Autonomous Agents and Multiagent Systems, 2010Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned by different agents. DCOP algorithms search for the optimal solution, optimizing the total gain (or cost) that is composed of all gains of all agents.
Alon Grubshtein +3 more
openaire +2 more sources
Using AI Local Search to Improve an OR Optimizer
Proceedings of the AAAI Conference on Artificial Intelligence, 2021One of the key issues for transportation companies is to produce an optimal plan for the work of crew members. Crew planning consists of a sequence of phases, the first two corresponding to planning duties (sequences of trips to be done by crew members from their home base to their home base) and planning rosters (sequences of duties and rest days to ...
Filipa Morgado +5 more
openaire +1 more source
Human Group Optimizer with Local Search
2011Human Group Optimization (HGO) algorithm, derived from the previously proposed seeker optimization algorithm (SOA), is a novel swarm intelligence algorithm by simulating human behaviors, especially human searching/foraging behaviors. In this paper, a canonical HGO with local search (L-HGO) is proposed.
Chaohua Dai +4 more
openaire +1 more source
On local search in d.c. optimization problems
Applied Mathematics and Computation, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Spherical Local Search for Global Optimization
2018This paper proposed spherical local search (SLS) for solving unconstrained optimization problems in three dimensions. The algorithm begins with a randomly chosen point in the search domain. Then, spherical trust region around this point is defined by the radius of SLS; where any point in this region is feasible.
Mohammed A. El-Shorbagy +1 more
openaire +1 more source
Program Optimization with Local Search
2023Recent advancements in large language models and program synthesis have enabled the development of powerful programming assistance tools. These tools are designed to help the programmer while writing a program in an online setting. In this thesis we introduce a programming assistant that can optimize a compilable version of a program with respect to a ...
openaire +1 more source