1176 search results - page 55 / 236 » Implicit Abstraction Heuristics |
214
Voted
EVOW
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
174
click to vote
ICOIN
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
173
click to vote
AI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
156
click to vote
IBERAMIA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
166
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem b...