An Improved Genetic Algorithm and Its Application in Constrained Solid TSP in Uncertain Environments
From MaRDI portal
Publication:4640197
Recommendations
- scientific article; zbMATH DE number 2219759
- Application of improved genetic simulated annealing algorithm in TSP optimization
- Solving TSP with improved multi-Agent genetic algorithm
- GENETIC ALGORITHM IN UNCERTAIN ENVIRONMENTS FOR SOLVING STOCHASTIC PROGRAMMING PROBLEM
- A novel genetic algorithm for solving constrained optimization problems
- scientific article; zbMATH DE number 2079469
- A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter
- Solving constrained traveling salesman problems by genetic algorithms
Cited in
(6)- A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter
- A constrained solid TSP in fuzzy environment: two heuristic approaches
- Solving constrained traveling salesman problems by genetic algorithms
- Imprecise constrained covering solid travelling salesman problem with credibility
- An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints
- Coordination of cyclic crossover and bat algorithm for the travelling salesman problems in different environments: a simulation approach
This page was built for publication: An Improved Genetic Algorithm and Its Application in Constrained Solid TSP in Uncertain Environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640197)