Results 291 to 300 of about 681,060 (327)
Some of the next articles are maybe not open access.
On local search in d.c. optimization
2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA), 2017This paper addresses a nonconvex optimization problem with the cost function and inequality constraints given by d.c. functions. The original problem is reduced to a problem without inequality constraints by the exact penalization procedure.
Alexander Strekalovsky, Ilya Minarchenko
openaire +1 more source
Local search in combinatorial optimization
2018In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size ...
Aarts, Emile, Lenstra, Jan Karel
openaire +3 more sources
Adding Local Search to Particle Swarm Optimization
2006 IEEE International Conference on Evolutionary Computation, 2006Particle swarm optimization is a stochastic algorithm for optimizing continuous functions. It uses a population of particles that follow trajectories through the search space towards good optima. This paper proposes adding a local search component to PSO to improve its convergence speed. Two possible methods are discussed.
Sanjoy Das +6 more
openaire +1 more source
A hybrid local search operator for multiobjective optimization
2013 IEEE Congress on Evolutionary Computation, 2013In recent years, the development of hybrid approaches to solve multiobjective optimization problems has become an important trend in the evolutionary computation community. Despite hybrid approaches of mathematical programming techniques with multiobjective evolutionary algorithms are not very popular, when both fields are successfully coupled, results
Alan Díaz-Manríquez +2 more
openaire +1 more source
A New Local Search Algorithm for Binary Optimization
INFORMS Journal on Computing, 2013We develop a new local search algorithm for binary optimization problems, whose complexity and performance are explicitly controlled by a parameter Q, measuring the depth of the local search neighborhood. We show that the algorithm is pseudo-polynomial for general cost vector c, and achieves a w2/(2w-1) approximation guarantee for set packing problems
Dimitris Bertsimas +2 more
openaire +1 more source
Anytime local search for distributed constraint optimization
International Joint Conference on Autonomous Agents and Multiagent Systems, 2008Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs.
openaire +3 more sources
Enhanced Ant Colony Optimization with Local Search
2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS), 2018The ant colony optimization (ACO) algorithm frequently gets trapped around local optimum solutions and does not approach the global optimum solution of vehicle routing problem. This work attempts to remedy this drawback by modifying the ant system (AS) algorithm, an instance of ACO.
Yindee Oonsrikaw, Arit Thammano
openaire +1 more source
A local search method for continuous global optimization
Journal of Global Optimization, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GAVIANO, MARCO +2 more
openaire +4 more sources
Evolutionary parallel local search for function optimization
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 2003This paper proposes a kind of evolutionary parallel local search technique (EPLS) that integrates the reproduction mechanisms from evolutionary algorithms and simplex method. The major aim is to explore the tradeoff between exploration and exploitation for optimizing multimodal functions.
Guo Guanqi, Y. Shouyi
openaire +2 more sources
Optimal search strategies for pollutant source localization
2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2016This paper is aimed at developing optimal motion planning for a single autonomous surface vehicle (ASV) equipped with an on-board pollutant sensor that will maximize the sensor-related information available for source seeking. The ASV uses a nonlinear diffusion model of the pollutant source to estimate the intensity/level of the pollution at the ...
Behzad Bayat +3 more
openaire +1 more source