Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
type: Item
instance of: scholarly article
title: Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
zbMATH Open document ID: 0800.68608
DOI: 10.1007/BF01185425
author: Károly F. Pál
published in: Biological Cybernetics
publication date: 1994-01-02T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 474925
MaRDI profile type: Publication
cites work: Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
cites work: The ``molecular'' traveling salesman
cites work: The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
cites work: Q4198056
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Optimization by Simulated Annealing
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q3713483
description: scientific article; zbMATH DE number 474925