The m -Traveling Salesman Problem with Minmax Objective

Paulo M. França, Michel Gendreau, Gilbert Laporte and Felipe M. Müller
Additional contact information
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

Transportation Science, 1995, vol. 29, issue 3, 267-275

Abstract: 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.

Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.29.3.267 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:29:y:1995:i:3:p:267-275

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().