Sciweavers

285 search results - page 34 / 57
» Intelligent Neighborhood Exploration in Local Search Heurist...
Sort
View
CEC
2008
IEEE
14 years 2 months ago
Memetic Gradient Search
—This paper reviews the different gradient-based schemes and the sources of gradient, their availability, precision and computational complexity, and explores the benefits of usi...
Boyang Li, Yew-Soon Ong, Minh Nghia Le, Chi Keong ...
ANTSW
2004
Springer
14 years 1 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
CP
2010
Springer
13 years 5 months ago
Contingency Plans for Air Traffic Management
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
Karl Sundequist Blomdahl, Pierre Flener, Justin Pe...
AUSAI
2003
Springer
14 years 28 days ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
14 years 1 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya