223 search results - page 16 / 45 » Approximate local search in combinatorial optimization |
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
JCO
1998
13 years 7 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
EMO
2003
Springer
14 years 22 days ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...