Parallel local search for the time-constrained travelling salesman problem

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

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    Abstract

    In the time-constrained TSP. each city has to be visited within a given time interval Such 'time windows' often occur in practice. When practical vehicle routing problems are solved in an interactive setting, one needs algorithms for the timeconstrained TSP that combine a tow running lime with a high solullon quality Local search seems a natural approach. It is not obvious. however. how local search for the TSP has to be implemented so as to handle time windows efficiently. This is particularly true when parallel computer architectures are available. We consider these questions.
    Original languageEnglish
    Title of host publicationTwenty-five years of operations research in the Netherlands; papers dedicated to Gijs de Leve
    EditorsJ.K. Lenstra, H.C. Tijms, A. Volgenant
    Place of PublicationAmsterdam
    PublisherCentrum voor Wiskunde en Informatica
    Pages61-75
    ISBN (Print)90-6196-385-0
    Publication statusPublished - 1989

    Publication series

    NameCWI Tract
    Volume70

    Fingerprint Dive into the research topics of 'Parallel local search for the time-constrained travelling salesman problem'. Together they form a unique fingerprint.

    Cite this