A kind of renewed simulated annealing algorithm

MaRDI QIDQ5489114zbMATH OpenFDO

Authors Zhi Ren Wang, Yin Zhang

Publication date 25 September 2006

zbMATH Keywords

asymptotic convergencecooling increase chartentropyMarkov chaintravelling salesman problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Simulated annealing: A tool for operational research
• scientific article; zbMATH DE number 4085427
• A kind of renewed simulated annealing algorithm solves 0-1 knapsack problem
• scientific article; zbMATH DE number 4048925
• An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem

Cited in

(6)

• A new simulated annealing approach for travelling salesman problem
• Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem
• A kind of renewed simulated annealing algorithm solves 0-1 knapsack problem
• An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem
• scientific article; zbMATH DE number 770230 (Why is no real title available?)
• Adaptive temperature rising simulated annealing algorithm for traveling salesman problem

This page was built for publication: A kind of renewed simulated annealing algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5489114)