GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
DOI10.1016/J.COR.2012.10.001zbMATH Open1348.90548OpenAlexW2031673408MaRDI QIDQ336743FDOQ336743
Luiz S. Ochi, Simone de Lima Martins, Mário Mestria
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.10.001
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integer Programming Formulation of Traveling Salesman Problems
- Principles of scatter search
- Greedy randomized adaptive search procedures
- An emergency vehicle dispatching system for an electric utility in Chile
- TTT plots: a perl program to create time-to-target plots
- GRASP and path relinking for the max-min diversity problem
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Procedures for travelling salesman problems with additional constraints
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
- Restricted delivery problems on a network
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Some applications of the clustered travelling salesman problem
- The symmetric clustered traveling salesman problem
Cited In (11)
- A comprehensive survey on the generalized traveling salesman problem
- Metaheuristics for the distance constrained generalized covering traveling salesman problem
- Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility
- 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
- A multifactorial optimization paradigm for linkage tree genetic algorithm
- Solving the clustered traveling salesman problem with ‐relaxed priority rule
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
Uses Software
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)
