Genetically improved presequences for Euclidean traveling salesman problems
type: Item
instance of: scholarly article
title: Genetically improved presequences for Euclidean traveling salesman problems
zbMATH Open document ID: 0810.90130
DOI: 10.1016/0895-7177(94)90212-7
author: D. M. Tate
author: C. Tunasar
author: Alice E. Smith
published in: Mathematical and Computer Modelling
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 706953
zbMATH Keywords: presequence
zbMATH Keywords: genetic algorithm
zbMATH Keywords: problem space search
zbMATH Keywords: Euclidean traveling salesman problem
zbMATH Keywords: spacefilling curve
MaRDI profile type: Publication
full work available at URL: 0895-7177(94)90212-7
OpenAlex ID: W1965972418
cites work: Q5187226
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
cites work: An O(N log N) planar travelling salesman heuristic based on spacefilling curves
cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
cites work: Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
cites work: Q4079017
cites work: Q4692508
cites work: Evolution algorithms in combinatorial optimization
cites work: Parallel Genetic Algorithms Applied to the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
description: scientific article; zbMATH DE number 706953