A genetic algorithm for finding a salesman's route
From MaRDI portal
(Redirected from A genetic algorithm for finding a salesman's route)
Recommendations
Cites work
Cited in
(15)- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
- Genetic local search in combinatorial optimization
- 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
- Analysis and a survey of evolutionary models
- 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
- Evolutionary methods for solving dynamic resource allocation problems
- 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
- New imperialist competitive algorithm to solve the travelling salesman problem
- 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
- Method of searching for global extremum of a continuous function on a simplex
This page was built for publication: A genetic algorithm for finding a salesman's route
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946368)