273 search results - page 22 / 55 » Genetic local search for multi-objective combinatorial optim... |
138
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
126
click to vote
MICRO
1990
IEEE
15 years 8 months ago
1990
IEEE
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
132
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
155
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
133
click to vote
PVM
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....