An efficient composite heuristic for the symmetric generalized traveling salesman problem
From MaRDI portal
(Redirected from Publication:1296792)
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
Cites work
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- Algorithms to solve the orienteering problem: A comparison
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- An Optimal Algorithm for the Orienteering Tour Problem
- Computer Solutions of the Traveling Salesman Problem
- 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
- scientific article; zbMATH DE number 4061010 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4125195 (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?)
- Models and algorithms for the dynamic-demand joint replenishment problem
- On Some Generalizations of the Travelling-Salesman Problem
- Optimal tour planning with specified nodes
- Some Applications of the Generalized Travelling Salesman Problem
- The Covering Salesman Problem
- The maximal expected coverage relocation problem for emergency vehicles
- The median tour and maximal covering tour problems: Formulations and heuristics
- The orienteering problem
- The prize collecting traveling salesman problem
- The symmetric clustered traveling salesman problem
- TSPLIB—A Traveling Salesman Problem Library
Cited in
(25)- On the solving strategy in composite heuristics
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Generalized network design problems.
- Heuristics for the traveling purchaser problem
- Algorithms for the design of network topologies with balanced disjoint rings
- Ant colony optimization for the traveling purchaser problem
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
- The generalized covering salesman problem
- Automatic production planning of press brakes for sheet metal bending
- Discrete/Binary approach
- 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
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- A Sensitive Metaheuristic for Solving a Large Optimization Problem
- Cluster-level operations planning for the out-of-position robotic arc-welding
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- New neighborhoods and an iterated local search algorithm 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
- A comprehensive survey on the generalized traveling salesman problem
- An ALNS metaheuristic for the family multiple traveling salesman problem
- 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 memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
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)
