Pages that link to "Item:Q1946368"
From MaRDI portal
The following pages link to A genetic algorithm for finding a salesman's route (Q1946368):
Displaying 14 items.
- Solution of sectorization problems for an air traffic management area. II: Development of sectorization algorithms (Q357104) (← links)
- The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior (Q393676) (← links)
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms (Q1008897) (← links)
- Modification of the method of generation of control finite-state machines with continuous actions based on training examples (Q1742411) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Inductive inference and argumentation methods in modern intelligent decision support systems (Q1742432) (← links)
- Analysis and a survey of evolutionary models (Q2017494) (← links)
- A numerical method for network operator for synthesis of a control system with uncertain initial values (Q2263407) (← links)
- Inducing finite state machines from training samples using ant colony optimization (Q2263894) (← links)
- Evolutionary methods for solving dynamic resource allocation problems (Q2331481) (← links)
- Ant colony optimization algorithms for solving transportation problems (Q2391772) (← links)
- An application of genetic algorithms with binary and real coding for approximate synthesis of suboptimal control in deterministic systems (Q2392617) (← links)
- New Imperialist Competitive Algorithm to solve the travelling salesman problem (Q2855772) (← links)
- Об одном методе поиска глобального экстремума непрерывной функции на симплексе (Q4961579) (← links)