273 search results - page 32 / 55 » Genetic local search for multi-objective combinatorial optim... |
117
click to vote
JCO
1998
15 years 3 days 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...
82
Voted
IJCAI
1993
15 years 1 months ago
1993
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
92
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
114
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
98
Voted
IJIT
2004
15 years 1 months ago
2004
In this contribution, the use of a new genetic operator is proposed. The main advantage of using this operator is that it is able to assist the evolution procedure to converge fast...