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

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

    Onderzoeksoutput: Boek/rapportRapportAcademic

    22 Downloads (Pure)

    Samenvatting

    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.
    Originele taal-2Engels
    Plaats van productieEindhoven
    UitgeverijTechnische Universiteit Eindhoven
    Aantal pagina's11
    StatusGepubliceerd - 1990

    Publicatie series

    NaamMemorandum COSOR
    Volume9041
    ISSN van geprinte versie0926-4493

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Sequential and parallel local search for the time-constrained traveling salesman problem'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit