Landscape analyses of search-space in travelling salesman problems

Hiroki Yoshizawa, Shuji Hashimoto

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    This paper shows statistical analyses of the search-space landscape of travelling salesman problems in due consideration of stochastic optimization. It is known from existing works that travelling salesman problems have landscape called "a rugged landscape" and "big valley structure". This work reveals more detailed structure of the landscape. We deal with the 1000 travelling salesman problems of 6 to 9 cities where the cities are arranged randomly and a travelling salesman problem of 100 cities. It is assumed that the rugged landscape is a combination of the global valleylike structure and the local noiselike structure. Each of them is characterized by the statistical properties of the search-space landscape, that is, the global valleylike structure has linearity with the distance (in this case, the bond distance) from the optimum, and the variance of the local noiselike structure increase monotonously with the distance from the optimum. On the other side correlation of the tours with the costs close upon the optimum cost is low. For this reason to combine the genetic search with the local search is supported. Even if the number of cities and the definition of the intercity cost value are changed, the structure of the landscape has the same feature. Although the number of the cities of the examined travelling salesman problems is not large, obtained results seem to be universal. It is forecasted that not only travelling salesman problems but also many practical problems have the structure which is characterized with the same measure. These results are useful to compose more effective optimization methods without trial and error.

    Original languageEnglish
    Pages (from-to)309-315
    Number of pages7
    JournalTransactions of the Japanese Society for Artificial Intelligence
    Volume16
    Issue number3
    DOIs
    Publication statusPublished - 2001

    Fingerprint

    Traveling salesman problem
    Costs

    Keywords

    • Landscape
    • No free lunch theorems
    • Optimization
    • Search space
    • Travelling salesman problems

    ASJC Scopus subject areas

    • Artificial Intelligence

    Cite this

    Landscape analyses of search-space in travelling salesman problems. / Yoshizawa, Hiroki; Hashimoto, Shuji.

    In: Transactions of the Japanese Society for Artificial Intelligence, Vol. 16, No. 3, 2001, p. 309-315.

    Research output: Contribution to journalArticle

    @article{5c085e076fe04b3aa3a6147ee0a238b9,
    title = "Landscape analyses of search-space in travelling salesman problems",
    abstract = "This paper shows statistical analyses of the search-space landscape of travelling salesman problems in due consideration of stochastic optimization. It is known from existing works that travelling salesman problems have landscape called {"}a rugged landscape{"} and {"}big valley structure{"}. This work reveals more detailed structure of the landscape. We deal with the 1000 travelling salesman problems of 6 to 9 cities where the cities are arranged randomly and a travelling salesman problem of 100 cities. It is assumed that the rugged landscape is a combination of the global valleylike structure and the local noiselike structure. Each of them is characterized by the statistical properties of the search-space landscape, that is, the global valleylike structure has linearity with the distance (in this case, the bond distance) from the optimum, and the variance of the local noiselike structure increase monotonously with the distance from the optimum. On the other side correlation of the tours with the costs close upon the optimum cost is low. For this reason to combine the genetic search with the local search is supported. Even if the number of cities and the definition of the intercity cost value are changed, the structure of the landscape has the same feature. Although the number of the cities of the examined travelling salesman problems is not large, obtained results seem to be universal. It is forecasted that not only travelling salesman problems but also many practical problems have the structure which is characterized with the same measure. These results are useful to compose more effective optimization methods without trial and error.",
    keywords = "Landscape, No free lunch theorems, Optimization, Search space, Travelling salesman problems",
    author = "Hiroki Yoshizawa and Shuji Hashimoto",
    year = "2001",
    doi = "10.1527/tjsai.16.309",
    language = "English",
    volume = "16",
    pages = "309--315",
    journal = "Transactions of the Japanese Society for Artificial Intelligence",
    issn = "1346-0714",
    publisher = "Japanese Society for Artificial Intelligence",
    number = "3",

    }

    TY - JOUR

    T1 - Landscape analyses of search-space in travelling salesman problems

    AU - Yoshizawa, Hiroki

    AU - Hashimoto, Shuji

    PY - 2001

    Y1 - 2001

    N2 - This paper shows statistical analyses of the search-space landscape of travelling salesman problems in due consideration of stochastic optimization. It is known from existing works that travelling salesman problems have landscape called "a rugged landscape" and "big valley structure". This work reveals more detailed structure of the landscape. We deal with the 1000 travelling salesman problems of 6 to 9 cities where the cities are arranged randomly and a travelling salesman problem of 100 cities. It is assumed that the rugged landscape is a combination of the global valleylike structure and the local noiselike structure. Each of them is characterized by the statistical properties of the search-space landscape, that is, the global valleylike structure has linearity with the distance (in this case, the bond distance) from the optimum, and the variance of the local noiselike structure increase monotonously with the distance from the optimum. On the other side correlation of the tours with the costs close upon the optimum cost is low. For this reason to combine the genetic search with the local search is supported. Even if the number of cities and the definition of the intercity cost value are changed, the structure of the landscape has the same feature. Although the number of the cities of the examined travelling salesman problems is not large, obtained results seem to be universal. It is forecasted that not only travelling salesman problems but also many practical problems have the structure which is characterized with the same measure. These results are useful to compose more effective optimization methods without trial and error.

    AB - This paper shows statistical analyses of the search-space landscape of travelling salesman problems in due consideration of stochastic optimization. It is known from existing works that travelling salesman problems have landscape called "a rugged landscape" and "big valley structure". This work reveals more detailed structure of the landscape. We deal with the 1000 travelling salesman problems of 6 to 9 cities where the cities are arranged randomly and a travelling salesman problem of 100 cities. It is assumed that the rugged landscape is a combination of the global valleylike structure and the local noiselike structure. Each of them is characterized by the statistical properties of the search-space landscape, that is, the global valleylike structure has linearity with the distance (in this case, the bond distance) from the optimum, and the variance of the local noiselike structure increase monotonously with the distance from the optimum. On the other side correlation of the tours with the costs close upon the optimum cost is low. For this reason to combine the genetic search with the local search is supported. Even if the number of cities and the definition of the intercity cost value are changed, the structure of the landscape has the same feature. Although the number of the cities of the examined travelling salesman problems is not large, obtained results seem to be universal. It is forecasted that not only travelling salesman problems but also many practical problems have the structure which is characterized with the same measure. These results are useful to compose more effective optimization methods without trial and error.

    KW - Landscape

    KW - No free lunch theorems

    KW - Optimization

    KW - Search space

    KW - Travelling salesman problems

    UR - http://www.scopus.com/inward/record.url?scp=15744377214&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=15744377214&partnerID=8YFLogxK

    U2 - 10.1527/tjsai.16.309

    DO - 10.1527/tjsai.16.309

    M3 - Article

    VL - 16

    SP - 309

    EP - 315

    JO - Transactions of the Japanese Society for Artificial Intelligence

    JF - Transactions of the Japanese Society for Artificial Intelligence

    SN - 1346-0714

    IS - 3

    ER -