Solving the family traveling salesman problem
DOI10.1016/J.EJOR.2017.11.063zbMATH Open1403.90563OpenAlexW2771232196MaRDI QIDQ723922FDOQ723922
Publication date: 25 July 2018
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.11.063
combinatorial optimizationmetaheuristicstraveling salesman problembranch-and-cutmulticommodity flows
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- TSPLIB—A Traveling Salesman Problem Library
- Solution of a Large-Scale Traveling-Salesman Problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- The traveling salesman problem and its variations
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- A survey on optimization metaheuristics
- Heuristics for the traveling purchaser problem
- The generalized covering salesman problem
- Solution of large-scale symmetric travelling salesman problems
- Randomized heuristics for the family traveling salesperson problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- Some Applications of the Generalized Travelling Salesman Problem
Cited In (12)
- A comprehensive survey on the generalized traveling salesman problem
- The family capacitated vehicle routing problem
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- Corrigendum to: ``Solving the family traveling salesman problem
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
- The family traveling salesman problem with incompatibility constraints
- Heuristic approaches for the family traveling salesman problem
- The capacitated family traveling salesperson problem
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
- A covering traveling salesman problem with profit in the last mile delivery
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- An adaptive memory matheuristic for the set orienteering problem
Uses Software
This page was built for publication: Solving the family traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723922)
