A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem

DOI10.1016/S0960-0779(00)00227-7zbMath0978.90099OpenAlexW2055393744MaRDI QIDQ5950645

Vangelis Th. Paschos, Aristidis Likas

Publication date: 2 January 2002

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0960-0779(00)00227-7

zbMATH Keywords

traveling salesman problemgreedy representationlocal search with random restartsparallelizable search strategysoution space

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A new algorithm for finding the shortest paths using PCNNs

Uses Software

• Unnamed Item

Cites Work

• Genetic algorithms for the traveling salesman problem
• TSPLIB—A Traveling Salesman Problem Library
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• The Traveling Salesman Problem with Distances One and Two
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem