Sciweavers

101 search results - page 8 / 21
» Solving Combinatorial Auctions Using Stochastic Local Search
Sort
View
COR
2006
122views more  COR 2006»
13 years 7 months ago
Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
Tal Shima, Steven J. Rasmussen, Andrew G. Sparks, ...
CP
2004
Springer
13 years 11 months ago
Set Variables and Local Search
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
Magnus Ågren
SAGA
2007
Springer
14 years 1 months ago
A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
Walter J. Gutjahr, Stefan Katzensteiner, Peter Rei...
WSC
2004
13 years 9 months ago
Simulation Optimization Using Balanced Explorative and Exploitative Search
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...
Andrei A. Prudius, Sigrún Andradótti...
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 1 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...