کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
979050 933319 2007 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Optimization with extremal dynamics for the traveling salesman problem
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات فیزیک ریاضی
پیش نمایش صفحه اول مقاله
Optimization with extremal dynamics for the traveling salesman problem
چکیده انگلیسی

By mapping the optimization problems to physical systems, the paper presents a general-purpose stochastic optimization method with extremal dynamics. It is built up with the traveling salesman problem (TSP) being a typical NP-complete problem. As self-organized critical processes of extremal dynamics, the optimization dynamics successively updates the states of those cities with high energy. Consequently, a near-optimal solution can be quickly obtained through the optimization processes combining the two phases of greedy searching and fluctuated explorations (ergodic walk near the phase transition). The computational results demonstrate that the proposed optimization method may provide much better performance than other optimization techniques developed from statistical physics, such as simulated annealing (SA). Since the proposed fundamental solution is based on the principles and micromechanisms of computational systems, it can provide systematic viewpoints and effective computational methods on a wide spectrum of combinatorial and physical optimization problems.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 385, Issue 1, 1 November 2007, Pages 115–123
نویسندگان
, , ,