Sciweavers

544 search results - page 54 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
FLAIRS
2003
13 years 9 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
14 years 1 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...
CP
2008
Springer
13 years 9 months ago
Search Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
Helmut Simonis, Barry O'Sullivan
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 2 months ago
An Improved Topology Design Algorithm for Network Coding-Based Multicast Networks
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
Kaikai Chi, Xiaohong Jiang, Susumu Horiguchi
GECCO
2004
Springer
14 years 1 months ago
Non-stationary Subtasks Can Improve Diversity in Stationary Tasks
Low diversity in a genetic algorithm (GA) can cause the search to become stagnant upon reaching a local optimum. To some extent, non-stationary tasks avoid this problem, which woul...
Christopher Willis-Ford, Terence Soule