Sciweavers

1101 search results - page 50 / 221
» heuristics 2007
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 3 months ago
Continuous lunches are free!
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...
Anne Auger, Olivier Teytaud
ICGA
2007
85views Optimization» more  ICGA 2007»
13 years 9 months ago
Searching Solitaire in Real Time
This article presents a new real-time heuristic search method for planning problems with distinct stages. Our multistage nested rollout algorithm allows the user to apply separate...
Ronald Bjarnason, Prasad Tadepalli, Alan Fern
COR
2007
134views more  COR 2007»
13 years 9 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
ANOR
2005
120views more  ANOR 2005»
13 years 9 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
EVOW
2007
Springer
14 years 3 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz