Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
DOI10.1007/BF00197287zbMATH Open0722.92009OpenAlexW1995107402MaRDI QIDQ757282FDOQ757282
J. Ambati, Mahmoud M. Mokhtar, B. K. Ambati
Publication date: 1991
Published in: Biological Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00197287
genetic algorithmnatural selectionheuristic algorithmtime complexityDarwinian evolutionfastest sorting schemenear-optimal solutions to the Traveling Salesman Problem
Problems related to evolution (92D15) Directed graphs (digraphs), tournaments (05C20) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ``Neural computation of decisions in optimization problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Cited In (8)
- New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
- An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
- Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
- Optimization by hierarchical mutant production
- Drift analysis and average time complexity of evolutionary algorithms
- Applying evolutionary programming to selected control problems
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
- ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
Recommendations
- Genetic algorithms for the traveling salesman problem 👍 👎
- Title not available (Why is that?) 👍 👎
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach 👍 👎
- A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem 👍 👎
- New evolutionary genetic algorithms for NP-complete combinatorial optimization problems 👍 👎
This page was built for publication: Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757282)
