Sciweavers

294 search results - page 8 / 59
» A hybrid metaheuristic approach to solving the UBQP problem
Sort
View
CPAIOR
2009
Springer
14 years 5 days ago
A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
TEC
2002
163views more  TEC 2002»
13 years 7 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
EAAI
2006
92views more  EAAI 2006»
13 years 7 months ago
Solving terminal assignment problems with groups encoding: The wedding banquet problem
This paper presents an extension of the terminal assignment problem (TA) in the case that groups of terminals must be assigned together. We analyze this situation by means of an e...
Sancho Salcedo-Sanz, José Antonio Portilla-...
CCE
2004
13 years 7 months ago
Solving heat exchanger network synthesis problems with Tabu Search
: This paper describes the implementation of a meta-heuristic optimization approach, Tabu Search (TS), for Heat Exchanger Networks (HEN) synthesis and compares this approach to oth...
B. Lin, D. C. Miller
IJCSA
2007
104views more  IJCSA 2007»
13 years 7 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala