6976 search results - page 59 / 1396 » The Oil Searching Problem |
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
168
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...
174
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
163
click to vote
AUSAI
1999
Springer
15 years 10 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
199
click to vote
TEC
2002
15 years 5 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...