Sciweavers

370 search results - page 10 / 74
» A Meta-Heuristic Based on Simulated Annealing for Solving Mu...
Sort
View
AMC
2005
136views more  AMC 2005»
13 years 7 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
AUSAI
2005
Springer
14 years 1 months ago
A Multi-exchange Heuristic for a Production Location Problem
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
Yunsong Guo, Yanzhi Li, Andrew Lim, Brian Rodrigue...
IPPS
2008
IEEE
14 years 2 months ago
A genetic programming approach to solve scheduling problems with parallel simulation
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...
Andreas Beham, Stephan M. Winkler, Stefan Wagner 0...
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
13 years 12 months ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
14 years 27 days ago
ERA: An Algorithm for Reducing the Epistasis of SAT Problems
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez