603 search results - page 61 / 121 » DFS-Tree Based Heuristic Search |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classic...
ERCIMDL
2010
Springer
13 years 9 months ago
2010
Springer
Given a set of keyphrases, we analyze how Web queries with these phrases can be formed that, taken altogether, return a specified number of hits. The use case of this problem is a ...
HM
2007
Springer
13 years 12 months ago
2007
Springer
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
IPPS
1997
IEEE
14 years 6 days ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...