کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
473675 698804 2011 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A hybrid particle swarm optimization approach for the sequential ordering problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A hybrid particle swarm optimization approach for the sequential ordering problem
چکیده انگلیسی

The sequential ordering problem is a version of the asymmetric travelling salesman problem where precedence constraints on vertices are imposed. A tour is feasible if these constraints are fulfilled, and the objective is to find a feasible solution with minimum cost.A particle swarm optimization approach hybridized with a local search procedure is discussed in this paper. The method is shown to be very effective in guiding a sophisticated local search previously introduced in the literature towards high quality regions of the search space. Differently from standard particle swarm algorithms, the proposed hybrid method tends to fast convergence to local optima. A mechanism to self-adapt a parameter and to avoid stagnation is therefore introduced.Extensive experimental results, where the new method is compared with the state-of-the-art algorithms, show the effectiveness of the new approach.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 38, Issue 7, July 2011, Pages 1076–1085
نویسندگان
, , , ,