Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
type: Item
instance of: scholarly article
title: Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
zbMATH Open document ID: 0722.92009
DOI: 10.1007/BF00197287
author: B. K. Ambati
author: J. Ambati
author: Mahmoud M. Mokhtar
published in: Biological Cybernetics
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 4191452
zbMATH Keywords: genetic algorithm
zbMATH Keywords: Darwinian evolution
zbMATH Keywords: near-optimal solutions to the Traveling Salesman Problem
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: natural selection
zbMATH Keywords: time complexity
zbMATH Keywords: fastest sorting scheme
MaRDI profile type: Publication
cites work: Q5729634
cites work: Q4198056
cites work: Q5806371
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
full work available at URL: https://doi.org/10.1007/bf00197287
OpenAlex ID: W1995107402
description: scientific article; zbMATH DE number 4191452