An efficient composite heuristic for the symmetric generalized traveling salesman problem

DOI10.1016/S0377-2217(97)00142-2zbMATH Open0944.90068OpenAlexW2070484240MaRDI QIDQ1296792FDOQ1296792

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

Recommendations

• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Improvements to the Or-opt heuristic for the symmetric travelling salesman problem

zbMATH Keywords

heuristicsgeneralized traveling salesman problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (23)

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

Uses Software

• TSPLIB
• VRP

This page was built for publication: An efficient composite heuristic for the symmetric generalized traveling salesman problem

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