Genetically improved presequences for Euclidean traveling salesman problems

DOI10.1016/0895-7177(94)90212-7zbMath0810.90130OpenAlexW1965972418MaRDI QIDQ1341408

C. Tunasar, D. M. Tate, Alice E. Smith

Publication date: 11 January 1995

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(94)90212-7

zbMATH Keywords

genetic algorithmEuclidean traveling salesman problemproblem space searchspacefilling curvepresequence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

A genetic algorithm approach to curve fitting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Evolution algorithms in combinatorial optimization
• An O(N log N) planar travelling salesman heuristic based on spacefilling curves
• Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• Parallel Genetic Algorithms Applied to the Traveling Salesman Problem
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Fast Algorithms for Geometric Traveling Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Genetically improved presequences for Euclidean traveling salesman problems