An efficient composite heuristic for the symmetric generalized traveling salesman problem

DOI10.1016/S0377-2217(97)00142-2zbMath0944.90068OpenAlexW2070484240MaRDI QIDQ1296792

Jacques Renaud, Fayez F. Boctor

Publication date: 3 August 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00142-2

zbMATH Keywords

heuristicsgeneralized traveling salesman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem ⋮ Ant colony optimization for the traveling purchaser problem ⋮ A random-key genetic algorithm for the generalized traveling salesman problem ⋮ GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem ⋮ Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem ⋮ Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem ⋮ A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs ⋮ A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ Algorithms for the design of network topologies with balanced disjoint rings ⋮ A Sensitive Metaheuristic for Solving a Large Optimization Problem ⋮ The Generalized Covering Salesman Problem ⋮ Generalized network design problems. ⋮ Cluster-level operations planning for the out-of-position robotic arc-welding ⋮ Discrete/Binary Approach ⋮ Automatic production planning of press brakes for sheet metal bending ⋮ Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks ⋮ Heuristics for the traveling purchaser problem

Uses Software

• TSPLIB
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The symmetric clustered traveling salesman problem
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• Algorithms to solve the orienteering problem: A comparison
• The median tour and maximal covering tour problems: Formulations and heuristics
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• The maximal expected coverage relocation problem for emergency vehicles
• On Some Generalizations of the Travelling-Salesman Problem
• The orienteering problem
• The prize collecting traveling salesman problem
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• An Optimal Algorithm for the Orienteering Tour Problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem
• Models and algorithms for the dynamic-demand joint replenishment problem
• The Covering Salesman Problem
• Optimal tour planning with specified nodes
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem