Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
The Application of Simulated Algorithm Based on .NET in NP
verfasst von : Ailian Wang, Yuexing Duan
Erschienen in: Emerging Research in Artificial Intelligence and Computational Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.