The m-Traveling Salesman Problem with Minmax Objective

DOI10.1287/trsc.29.3.267zbMath0858.90128OpenAlexW2171971243MaRDI QIDQ4897090

Felipe M. Müller, Gilbert Laporte, Michel Gendreau, Paulo Morelato França

Publication date: 3 December 1996

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.29.3.267

zbMATH Keywords

tabu search\(m\)-traveling salesmanlength of the longest routeminmax version

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Min-Max vs. Min-Sum vehicle routing: a worst-case analysis, Hybrid search with neighborhood reduction for the multiple traveling salesman problem, An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, Routing problems: A bibliography, Metaheuristics: A bibliography, A min-max vehicle routing problem with split delivery and heterogeneous demand, A constant-factor approximation algorithm for multi-vehicle collection for processing problem, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, A binary search algorithm for the general coupled task scheduling problem, A matheuristic for the MinMax capacitated open vehicle routing problem, Memetic search for the minmax multiple traveling salesman problem with single and multiple depots, A columnar competitive model for solving multi-traveling salesman problem, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem