The <i>m</i>-Traveling Salesman Problem with Minmax Objective

DOI Web Site 被引用文献1件
  • Paulo M. França
    Faculdade de Engenharia Elétrica, Universidade Estadual de Campinas, 13081 Campinas-SP, Brazil
  • Michel Gendreau
    Centre de recherche sur les transports, Université de Montréal, Montréal, Canada H3C 3J7
  • Gilbert Laporte
    Centre de recherche sur les transports, Université de Montréal, Montréal, Canada H3C 3J7
  • Felipe M. Müller
    Departamento de Eletrônica e Computação, Universidade Federal de Santa Maria, Santa Maria-RS, Brazil

この論文をさがす

説明

<jats:p> This article proposes algorithms for the Minmax version of the m-Traveling Salesman Problem in which the objective is to minimize the length of the longest route. A tabu search heuristic and two exact search schemes are developed. Problems involving up to 50 vertices are solved to optimality. </jats:p>

収録刊行物

  • Transportation Science

    Transportation Science 29 (3), 267-275, 1995-08

    Institute for Operations Research and the Management Sciences (INFORMS)

被引用文献 (1)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ