944 search results - page 12 / 189 » Heuristic Search for Large Problems With Real Costs |
HEURISTICS
2002
14 years 9 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
SAGA
2001
Springer
15 years 2 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
JAIR
2010
14 years 8 months ago
2010
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
HEURISTICS
2000
14 years 9 months ago
2000
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...