2393 search results - page 107 / 479 » Bounds-Consistent Local Search |
111
click to vote
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...
114
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
132
click to vote
HM
2007
Springer
15 years 4 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...
227
click to vote
GECCO
2011
Springer
14 years 4 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
128
Voted
CIKM
2011
Springer
14 years 20 days ago
2011
Springer
As user demands become increasingly sophisticated, search engines today are competing in more than just returning document results from the Web. One area of competition is providi...