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

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

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    2 Citaten (Scopus)

    Samenvatting

    Local search has proven to be an effective solution approach for the traveling salesman problem. We consider variants of the TSP in which each city is to be visited within one or more given time windows. The travel times are symmetric and satisfy the triangle inequality; the objective is to minimize the tour duration. We develop efficient sequential and parallel algorithms for the verification of local optimality of a tour with respect to k-exchanges.
    Originele taal-2Engels
    Pagina's (van-tot)211-225
    Aantal pagina's15
    TijdschriftDiscrete Applied Mathematics
    Volume42
    Nummer van het tijdschrift2-3
    DOI's
    StatusGepubliceerd - 1993

    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