Multi-depot multiple TSP: a polyhedral study and computational results

DOI10.1007/S10479-011-1024-YMaRDI QIDQ367624zbMATH OpenOpenAlexFDO

Authors Enrique Benavent, Antonio Martínez

Publication date 16 September 2013

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-011-1024-y

zbMATH Keywords

Branch-and-Cutmultiple depot traveling salesman problempolyhedral study

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
• Integer linear programming formulations of multiple salesman problems and its variations
• A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
• A multi-depot travelling salesman problem and its iterative and integrated approaches

Cites work

• A branch-and-cut algorithm for the plant-cycle location problem
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A cutting plane algorithm for minimum perfect 2-matchings
• A Lagrangian-based algorithm for a combinatorial motion planning problem
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A unified exact method for solving different classes of vehicle routing problems
• An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
• Edmonds polytopes and weakly hamiltonian graphs
• Facet identification for the symmetric traveling salesman polytope
• Hamiltonian path and symmetric travelling salesman polytopes
• scientific article; zbMATH DE number 3883903 (Why is no real title available?)
• Integer linear programming formulations of multiple salesman problems and its variations
• On the symmetric travelling salesman problem I: Inequalities
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• The traveling salesman problem and its variations
• The traveling salesman problem. A computational study.
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(22)

• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
• Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms
• On the multiple Steiner traveling salesman problem with order constraints
• Integer linear programming formulations of multiple salesman problems and its variations
• A multi-depot travelling salesman problem and its iterative and integrated approaches
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
• A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
• A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
• scientific article; zbMATH DE number 1342134 (Why is no real title available?)
• Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
• Node based compact formulations for the Hamiltonian p‐median problem
• New path elimination constraints for multi-depot routing problems
• The Hamiltonian p-median problem: polyhedral results and branch-and-cut algorithms
• A branch-and-cut algorithm for the multiple Steiner TSP with order constraints
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

Describes a project that uses

Uses Software

• TSPLIB
• Concorde

This page was built for publication: Multi-depot multiple TSP: a polyhedral study and computational results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367624)