Sciweavers

336 search results - page 11 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 8 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
14 years 1 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
CEC
2005
IEEE
14 years 1 months ago
Constraint quadratic approximation operator for treating equality constraints with genetic algorithms
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
Elizabeth F. Wanner, Frederico G. Guimarães...
CPAIOR
2010
Springer
14 years 8 days ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
13 years 11 months ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim