A comprehensive survey on the generalized traveling salesman problem

DOI10.1016/J.EJOR.2023.07.022MaRDI QIDQ6556079zbMATH OpenFDO

Authors Petrica Pop, Ovidiu Cosma, Cosmin Sabo, Corina Pop Sitar

Publication date 17 June 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.07.022

zbMATH Keywords

combinatorial optimizationgeneralized traveling salesman problemheuristic and metaheuristic algorithmsmathematical formulationstraveling salesman problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A beam search for the equality generalized symmetric traveling salesman problem
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Comparative Study between Haploid Genetic Algorithms and Diploid Genetic Algorithms
• A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• A general VNS heuristic for the traveling salesman problem with time windows
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• A memetic algorithm for the generalized traveling salesman problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• A novel genetic algorithm for solving the clustered shortest-path tree problem
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
• A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem
• A two-level solution approach for solving the generalized minimum spanning tree problem
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
• An efficient transformation of the generalized vehicle routing problem
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
• An improved hybrid ant-local search algorithm for the partition graph coloring problem
• Approximation algorithms for generalized MST and TSP in grid clusters
• Branch-and-bound for the precedence constrained generalized traveling salesman problem
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• Generalized network design problems.
• Generalized network design problems. Modeling and optimization.
• Generalized Steiner problems and other variants
• Generalized traveling salesman problem reduction algorithms
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• scientific article; zbMATH DE number 4012343 (Why is no real title available?)
• scientific article; zbMATH DE number 1123081 (Why is no real title available?)
• scientific article; zbMATH DE number 2064409 (Why is no real title available?)
• scientific article; zbMATH DE number 6867742 (Why is no real title available?)
• scientific article; zbMATH DE number 3278972 (Why is no real title available?)
• scientific article; zbMATH DE number 3298367 (Why is no real title available?)
• scientific article; zbMATH DE number 3335671 (Why is no real title available?)
• Integer Programming Formulation of Traveling Salesman Problems
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
• Mixed integer programming formulations for the generalized traveling salesman problem with time windows
• Networks and vehicle routing for municipal waste collection
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
• On the complexity of the selective graph coloring problem in some special classes of graphs
• On the generalized minimum spanning tree problem
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Randomized heuristics for the family traveling salesperson problem
• Selective generalized travelling salesman problem
• Solving a generalized traveling salesperson problem with stochastic customers
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• Solving the family traveling salesman problem
• Some applications of the clustered travelling salesman problem
• Some Applications of the Generalized Travelling Salesman Problem
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• The Bottleneck Traveling Salesman Problem
• The Covering Tour Problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• The prize collecting traveling salesman problem
• The selective travelling salesman problem
• The Steiner traveling salesman problem and its extensions
• The traveling salesman problem. A computational study.
• The vehicle routing problem: An overview of exact and approximate algorithms
• Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(9)

• A unified pre-training and adaptation framework for combinatorial optimization on graphs
• Competition between Dandelion and Prüfer encoded genetic algorithms for solving the clustered minimum routing tree problem
• Quantifying and reducing the complexity of multi-line charts as a visual aid in multi-criteria decision-making
• A review of benchmark and test functions for global optimization algorithms and metaheuristics
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
• A survey on the traveling salesman problem and its variants in a warehousing context
• Graph spanners for group Steiner distances
• The non-disjoint clustered traveling salesperson problem
• Beer path problems in temporal graphs

This page was built for publication: A comprehensive survey on the generalized traveling salesman problem

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