Sciweavers

70 search results - page 5 / 14
» Hybrid Tabu Search for Lot Sizing Problems
Sort
View
EOR
2010
110views more  EOR 2010»
13 years 7 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
EVOW
2006
Springer
13 years 11 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
CEC
2009
IEEE
14 years 2 months ago
Local search based evolutionary multi-objective optimization algorithm for constrained and unconstrained problems
Abstract— Evolutionary multi-objective optimization algorithms are commonly used to obtain a set of non-dominated solutions for over a decade. Recently, a lot of emphasis have be...
Karthik Sindhya, Ankur Sinha, Kalyanmoy Deb, Kaisa...
BMCBI
2005
152views more  BMCBI 2005»
13 years 7 months ago
An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem
Background: The protein folding problem is a fundamental problems in computational molecular biology and biochemical physics. Various optimisation methods have been applied to for...
Alena Shmygelska, Holger H. Hoos
PRICAI
2004
Springer
14 years 26 days ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...