Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm

DOI10.1016/j.cor.2015.12.014zbMath1391.90536arXiv1508.01813OpenAlexW2962992409MaRDI QIDQ1651623

Kaarthik Sundar, Sivakumar Rathinam

Publication date: 12 July 2018

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

Full work available at URL: https://arxiv.org/abs/1508.01813

zbMATH Keywords

branch-and-cutroutingpolyhedral studygeneralized multiple depot traveling salesmen

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

Dealing with time in the multiple traveling salespersons problem with moving targets, Selective generalized travelling salesman problem, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, Multiple depot ring star problem: a polyhedral study and an exact algorithm, Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks

Uses Software

• CPLEX
• LKH
• GTSP Instances Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-depot multiple TSP: a polyhedral study and computational results
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A memetic algorithm for the generalized traveling salesman problem
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Branching rules revisited
• An efficient transformation of the generalized vehicle routing problem
• Solving an urban waste collection problem using ants heuristics
• Odd Minimum Cut-Sets and b-Matchings
• Technical Note—A Note on Zero-One Programming
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The symmetric generalized traveling salesman polytope
• Edmonds polytopes and weakly hamiltonian graphs