A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
From MaRDI portal
Publication:1681265
DOI10.1016/j.ejor.2017.07.056zbMath1374.90044OpenAlexW2740867407WikidataQ107155169 ScholiaQ107155169MaRDI QIDQ1681265
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.056
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (5)
Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ An MILP approach for persistent coverage tasks with multiple robots and performance guarantees ⋮ 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 ⋮ Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The hybrid electric vehicle-traveling salesman problem
- The exact solution of several classes of inventory-routing problems
- Multi-depot multiple TSP: a polyhedral study and computational results
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Classification of travelling salesman problem formulations
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Partitioning procedures for solving mixed-variables programming problems
- An analytical comparison of different formulations of the travelling salesman problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- Optimisation of maintenance routing and scheduling for offshore wind farms
- Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Integer linear programming formulations of multiple salesman problems and its variations
- The Vehicle Routing Problem
- Integer Programming Formulation of Traveling Salesman Problems
- A New Formulation for the Travelling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- The General Pickup and Delivery Problem
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- In Pursuit of the Traveling Salesman
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
This page was built for publication: A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
