Solving the family traveling salesman problem

DOI10.1016/j.ejor.2017.11.063zbMath1403.90563OpenAlexW2771232196MaRDI QIDQ723922

Raquel Bernardino, Ana Paias

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

zbMATH Keywords

combinatorial optimizationmetaheuristicstraveling salesman problemmulticommodity flowsbranch-and-cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A transformation technique for the clustered generalized traveling salesman problem with applications to logistics ⋮ Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems ⋮ 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 multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ The capacitated family traveling salesperson problem ⋮ Corrigendum to: ``Solving the family traveling salesman problem ⋮ A covering traveling salesman problem with profit in the last mile delivery

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on optimization metaheuristics
• Solution of large-scale symmetric travelling salesman problems
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• A comparative analysis of several asymmetric traveling salesman problem formulations
• The traveling salesman problem and its variations
• Heuristics for the traveling purchaser problem
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• The Generalized Covering Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Randomized heuristics for the family traveling salesperson problem
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Solving the family traveling salesman problem