Sciweavers

ICIC
2007
Springer

An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization

14 years 6 months ago
An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of the algorithm. Then the paper introduces the simulated annealing (SA) algorithm and incorporates the ideas of SA into two of the arithmetic operators of NP algorithm to form the combined NP/SA algorithm. Moreover, the paper presents the explicit optimization procedure of the combined algorithm NP/SA and explains the feasibility and superiority of it. The NP/SA algorithm adopts the global optimization ability of NP algorithm and the local search ability of SA algorithm so that it improves the optimization efficiency and the convergence rate. This paper also illustrates the NP/SA algorithm through an optimization example. Key-Words: - Nested partitions algorithm, Simulated annealing, Complex decision problem.
Yan Luo, Changrui Yu
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ICIC
Authors Yan Luo, Changrui Yu
Comments (0)