201 search results - page 17 / 41 » Algorithms for the On-Line Quota Traveling Salesman Problem |
CEC
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
CPAIOR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
ESA
2003
Springer
14 years 28 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
TCS
2008
13 years 7 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...