Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations

Authors:
Temel Öncan;İ. Kuban Altınel;Gilbert Laporte
Affiliations:
Department of Industrial Engineering, Galatasaray University, Ortaköy, İstanbul 34357, Turkey;Department of Industrial Engineering, Boğaziçi University, Bebek, İstanbul 34342, Turkey;Canada Research Chair in Distribution Management, HEC Montréal, 3000, chemin de la Côte-Sainte-Catherine, Montréal, Canada, H3T 2A7
Venue:
Computers and Operations Research
Year:
2009

Citing 8
Cited 9

An analytical comparison of different formulations of the travelling sales man problem

Mathematical Programming: Series A and B
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin contraints

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems

Operations Research
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

Discrete Optimization
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints

Operations Research Letters
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints

Operations Research Letters
Classification of travelling salesman problem formulations

Operations Research Letters

Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
The Traveling Salesman Problem with Draft Limits

Computers and Operations Research
A new genetic algorithm for the asymmetric traveling salesman problem

Expert Systems with Applications: An International Journal
An ant colony optimization and bayesian network structure application for the asymmetric traveling salesman problem

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part III
The Delivery Man Problem with time windows

Discrete Optimization
Multi-product sequencing and lot-sizing under uncertainties: A memetic algorithm

Engineering Applications of Artificial Intelligence
Optimum piece selection strategies for a peer-to-peer video streaming platform

Computers and Operations Research
An ant-colony approach for the design of optimal chunk scheduling policies in live peer-to-peer networks

International Journal of Metaheuristics
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this survey, a classification of 24 asymmetric traveling salesman problem (ATSP) formulations is presented. The strength of their LP relaxations is discussed and known relationships from the literature are reviewed. Some new relationships are also introduced, and computational results are reported.