The ``molecular traveling salesman

DOI10.1007/BF00203625zbMath0709.92016OpenAlexW1976595943MaRDI QIDQ922393

Wolfgang Banzhaf

Publication date: 1990

Published in: Biological Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00203625

zbMATH Keywords

traveling salesman problemglobal optimumisolated evolutionoptimization of NP-problems

Mathematics Subject Classification ID

Problems related to evolution (92D15)

Related Items

Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm, A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems, A matheuristic algorithm for the pollution and energy minimization traveling salesman problems, An enhanced genetic algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Self-replicating sequences of binary numbers. Foundations. I: General, Models and algorithms for the traveling salesman problem with time-dependent service times, New evolutionary genetic algorithms for NP-complete combinatorial optimization problems, Linkage learning through probabilistic expression., Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation

Cites Work

• Optimization by Simulated Annealing
• Evolution algorithms in combinatorial optimization
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item