Sciweavers

273 search results - page 20 / 55
» Genetic local search for multi-objective combinatorial optim...
Sort
View
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
15 years 4 months ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
IROS
2007
IEEE
162views Robotics» more  IROS 2007»
15 years 5 months ago
Genetic MRF model optimization for real-time victim detection in search and rescue
— One primary goal in rescue robotics is to deploy a team of robots for coordinated victim search after a disaster. This requires robots to perform subtasks, such as victim detec...
Alexander Kleiner, Rainer Kümmerle
AAAI
2004
15 years 2 days ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 2 months ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
ICASSP
2011
IEEE
14 years 2 months ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor