Advertisement
Published in:
2011 | OriginalPaper | Chapter
The Application of Simulated Algorithm Based on .NET in NP
Authors : Ailian Wang, Yuexing Duan
Published in: Emerging Research in Artificial Intelligence and Computational Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Based on the principle of simulated annealing algorithm and applying annealing model, this paper systematically analyzed the extended applied algorithm and its examples of Nondeterministic polynomial (NP) decision problem, evaluated the setting of the important parameters and the processes, and realized the global optimum solution for NP application.The results of the experiments tested under .NET confirm that SA algorithm can jump out from the trap of local optimum and find global optimum solution for combinatorial optimization. Meanwhile, optimization algorithm is competitive comparing with other local searching algorithm.