An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem
From MaRDI portal
Publication:4298545
Recommendations
- A kind of renewed simulated annealing algorithm
- A new simulated annealing approach for travelling salesman problem
- scientific article; zbMATH DE number 4085427
- Application of improved genetic simulated annealing algorithm in TSP optimization
- An improved simulated annealing for solving the linear constrained optimization problems
Cites work
Cited in
(10)- A new simulated annealing approach for travelling salesman problem
- Sequence optimization and design of allocation using GA and SA
- A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for the travelling salesman problem
- Adaptive temperature rising simulated annealing algorithm for traveling salesman problem
- Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem
- Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling
- Application of improved genetic simulated annealing algorithm in TSP optimization
- A kind of renewed simulated annealing algorithm
- Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
This page was built for publication: An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4298545)