The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
From MaRDI portal
Publication:6085888
DOI10.1002/net.22125OpenAlexW4294930823MaRDI QIDQ6085888
Daniel Santos, Raquel Bernardino, Ana Paias, Luís Gouveia
Publication date: 12 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22125
valid inequalitieswarehouse managementclustered vehicle routingfamily traveling salesman problembranch-\&-cut algorithmmulti-depot routing problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal capacitated ring trees
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem
- Multi-depot multiple TSP: a polyhedral study and computational results
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Solving the family traveling salesman problem
- Operating room planning and scheduling: a literature review
- Hamiltonian location problems
- Picker routing in the mixed-shelves warehouses of e-commerce retailers
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- Warehousing in the e-commerce era: a survey
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- A compact model and tight bounds for a combined location-routing problem
- A generic exact solver for vehicle routing and related problems
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Exact solution of the soft-clustered vehicle-routing problem
- Multi-depot rural postman problems
- Operating room planning and surgical case scheduling: a review of literature
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- The Generalized Covering Salesman Problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Vehicle Routing
- A comparison of several models for the hamiltonian p‐median problem
- Randomized heuristics for the family traveling salesperson problem
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm
- Exact Algorithms for the Clustered Vehicle Routing Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- A branch and cut approach to the cardinality constrained circuit problem.
- Heuristic approaches for the family traveling salesman problem
