The period traveling salesman problem: A new heuristic algorithm (Q1603331)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The period traveling salesman problem: A new heuristic algorithm
scientific article

    Statements

    The period traveling salesman problem: A new heuristic algorithm (English)
    0 references
    0 references
    11 July 2002
    0 references
    A simple and effective heuristic algorithm for the period traveling salesman problem is described in this article. The computational results obtained from 33 test problems taken from the literature indicate that the algorithm compares well in terms of accuracy with other existing algorithms, finding a larger number of best solutions.
    0 references
    0 references