613 search results - page 43 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
125
Voted
AI
2006
Springer
15 years 2 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
115
Voted
EMO
2001
Springer
15 years 7 months ago
2001
Springer
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
200
Voted
AINA
2004
IEEE
15 years 6 months ago
2004
IEEE
In this paper, we propose a personal navigation system (called PNS) which navigates a tourist through multiple destinations efficiently. In our PNS, a tourist can specify multiple...
103
Voted
COMPSAC
2004
IEEE
15 years 6 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
112
click to vote
WSC
2008
15 years 5 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...