1171 search results - page 13 / 235 » Variable neighborhood search |
NETWORKS
2007
13 years 6 months ago
2007
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
PPL
2010
13 years 2 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
HM
2009
Springer
13 years 12 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
AIPS
2010
13 years 9 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
EOR
2006
13 years 7 months ago
2006
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective met...