Local search is a well-known and a well·investigated solution approach for the traveling salesman problem. It is not obvious, however, how local search for the TSP has to be implemented efficiently when each city has to bevisited within one or more given time windows.This is particularly true when parallel computer architectures are available. Weconsider these questions.
Key Words & Phrases: traveling salesman problem, time window,local search, parallel omputing.
|ISSN van geprinte versie||0926-4493|