GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
From MaRDI portal
(Redirected from Publication:336743)
Recommendations
Cites work
- scientific article; zbMATH DE number 1054959 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 1114466 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 2064412 (Why is no real title available?)
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- An annotated bibliography of GRASP – Part I: Algorithms
- An annotated bibliography of GRASP-Part II: Applications
- An emergency vehicle dispatching system for an electric utility in Chile
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP and path relinking for the max-min diversity problem
- Greedy randomized adaptive search procedures
- Integer Programming Formulation of Traveling Salesman Problems
- Principles of scatter search
- Procedures for travelling salesman problems with additional constraints
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Restricted delivery problems on a network
- Some applications of the clustered travelling salesman problem
- TTT plots: a perl program to create time-to-target plots
- The symmetric clustered traveling salesman problem
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
Cited in
(17)- A comprehensive survey on the generalized traveling salesman problem
- Metaheuristics for the distance constrained generalized covering traveling salesman problem
- A heuristic approach for cluster TSP
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
- Metaheuristics for the tabu clustered traveling salesman problem
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- A hybrid metaheuristic for the clustered travelling salesman problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- GRASP with path-relinking for the TSP
- A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
- Competition between Dandelion and Prüfer encoded genetic algorithms for solving the clustered minimum routing tree problem
- Randomized heuristics for the family traveling salesperson problem
- A multifactorial optimization paradigm for linkage tree genetic algorithm
- Imprecise constrained covering solid travelling salesman problem with credibility
- Better approximation algorithms for clustered TSP and subgroup planning
- Solving the clustered traveling salesman problem with ‐relaxed priority rule
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
This page was built for publication: GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336743)
