3142 search results - page 239 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
146
Voted
WLP
2004
Springer
15 years 8 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
133
click to vote
IJIT
2004
15 years 4 months ago
2004
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
127
click to vote
TNN
2010
14 years 10 months ago
2010
The competitive layer model (CLM) can be described by an optimization problem. The problem can be further formulated by an energy function, called the CLM energy function, in the s...
134
Voted
SAT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
134
click to vote
CEC
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...