Sciweavers

202 search results - page 5 / 41
» Complexity of local search for the p-median problem
Sort
View
ICIC
2007
Springer
14 years 1 months ago
An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
Yan Luo, Changrui Yu
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 1 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
CORR
2011
Springer
179views Education» more  CORR 2011»
13 years 2 months ago
Cooperative searching for stochastic targets
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
EC
2010
157views ECommerce» more  EC 2010»
13 years 7 months ago
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Daniel Molina, Manuel Lozano, Carlos García...
CP
2009
Springer
13 years 10 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...