Sciweavers

GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
14 years 4 months ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens
CPAIOR
2004
Springer
14 years 4 months ago
SIMPL: A System for Integrating Optimization Techniques
Abstract In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and s...
Ionut D. Aron, John N. Hooker, Tallys H. Yunes
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
14 years 4 months ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...
DGCI
2005
Springer
14 years 4 months ago
Uncertain Geometry in Computer Vision
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
Peter Veelaert
ISCAS
2005
IEEE
149views Hardware» more  ISCAS 2005»
14 years 4 months ago
Advances in QoS path(s) selection problem
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
Krishnaiyan Thulasiraman, Ying Xiao, Guoliang Xue
CEC
2005
IEEE
14 years 4 months ago
A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
José E. Gallardo, Carlos Cotta, Antonio J. ...
IPPS
2007
IEEE
14 years 5 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
CEC
2007
IEEE
14 years 5 months ago
On improving approximate solutions by evolutionary algorithms
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank ...
CEC
2007
IEEE
14 years 5 months ago
Modified genetic algorithm for job-shop scheduling: A gap utilization technique
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
ISDA
2008
IEEE
14 years 5 months ago
Cultural-Based Genetic Algorithm: Design and Real World Applications
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
Mostafa A. El-Hosseini, Aboul Ella Hassanien, Ajit...