Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations

DOI10.1016/J.COR.2014.05.014zbMath1348.90011OpenAlexW2147151422MaRDI QIDQ337114

Hanif D. Sherali, Pei-Fang (Jennifer) Tsai, Jason D. Judd, Sarin, Subhash C.

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.014

zbMATH Keywords

precedence constraintsmultiple asymmetric traveling salesmen problemsequential ordering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (2)

The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach

Uses Software

• VRP
• Unnamed Item

Cites Work

• Unnamed Item
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A classification of formulations for the (time-dependent) traveling salesman problem
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
• Integer linear programming formulations of multiple salesman problems and its variations
• Improving Discrete Model Representations via Symmetry Considerations
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Integer Programming Formulation of Traveling Salesman Problems
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
• A Cutting Planes Algorithm for the m-Salesmen Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• TSPLIB—A Traveling Salesman Problem Library
• Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Computational Experience with an M-Salesman Traveling Salesman Algorithm

This page was built for publication: Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations