The ``molecular traveling salesman
From MaRDI portal
Publication:922393
DOI10.1007/BF00203625zbMath0709.92016OpenAlexW1976595943MaRDI QIDQ922393
Publication date: 1990
Published in: Biological Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00203625
Related Items (10)
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
This page was built for publication: The ``molecular traveling salesman