A genetic algorithm for finding a salesman's route

DOI10.1134/S1064230706010102zbMath1260.90142OpenAlexW2026522996MaRDI QIDQ1946368

V. V. Kureichik, V. M. Kureichik

Publication date: 12 April 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230706010102

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Ant colony optimization algorithms for solving transportation problems ⋮ An application of genetic algorithms with binary and real coding for approximate synthesis of suboptimal control in deterministic systems ⋮ Solution of sectorization problems for an air traffic management area. II: Development of sectorization algorithms ⋮ The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior ⋮ Modification of the method of generation of control finite-state machines with continuous actions based on training examples ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Inductive inference and argumentation methods in modern intelligent decision support systems ⋮ A numerical method for network operator for synthesis of a control system with uncertain initial values ⋮ Inducing finite state machines from training samples using ant colony optimization ⋮ Analysis and a survey of evolutionary models ⋮ Об одном методе поиска глобального экстремума непрерывной функции на симплексе ⋮ An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms ⋮ Evolutionary methods for solving dynamic resource allocation problems ⋮ New Imperialist Competitive Algorithm to solve the travelling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Multialternative genetic algorithms for the search of a function extremum