GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

DOI10.1016/j.cor.2012.10.001zbMath1348.90548OpenAlexW2031673408MaRDI QIDQ336743

Simone de Lima Martins, Mário Mestria, Luiz Satoru Ochi

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

zbMATH Keywords

heuristicscombinatorial optimizationGRASPpath relinkingclustered traveling salesman problem

Mathematics Subject Classification ID

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)

Related Items

Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem ⋮ Metaheuristics for the distance constrained generalized covering traveling salesman problem ⋮ A fast two-level variable neighborhood search for the clustered vehicle routing problem ⋮ GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem ⋮ Metaheuristics for the tabu clustered traveling salesman problem ⋮ Solving the clustered traveling salesman problem with ‐relaxed priority rule ⋮ New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem ⋮ Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility ⋮ A multifactorial optimization paradigm for linkage tree genetic algorithm

Uses Software

• TSPLIB
• GRASP
• PERL
• CPLEX
• Concorde
• TTTPLOTS

Cites Work

• The symmetric clustered traveling salesman problem
• GRASP and path relinking for the max-min diversity problem
• 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
• Greedy randomized adaptive search procedures
• TTT plots: a perl program to create time-to-target plots
• Principles of scatter search
• An emergency vehicle dispatching system for an electric utility in Chile
• Integer Programming Formulation of Traveling Salesman Problems
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• 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
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Some applications of the clustered travelling salesman problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item