Sequential and parallel local search for the time-constrained traveling salesman problem

G.A.P. Kindervater, J.K. Lenstra, M.W.P. Savelsbergh

Research output: Book/ReportReportAcademic

24 Downloads (Pure)

Abstract

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.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages11
Publication statusPublished - 1990

Publication series

NameMemorandum COSOR
Volume9041
ISSN (Print)0926-4493

Fingerprint

Dive into the research topics of 'Sequential and parallel local search for the time-constrained traveling salesman problem'. Together they form a unique fingerprint.

Cite this