کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1135563 956103 2008 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Ants can solve the team orienteering problem
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
Ants can solve the team orienteering problem
چکیده انگلیسی

The team orienteering problem (TOP) involves finding a set of paths from the starting point to the ending point such that the total collected reward received from visiting a subset of locations is maximized and the length of each path is restricted by a pre-specified limit. In this paper, an ant colony optimization (ACO) approach is proposed for the team orienteering problem. Four methods, i.e., the sequential, deterministic-concurrent and random-concurrent and simultaneous methods, are proposed to construct candidate solutions in the framework of ACO. We compare these methods according to the results obtained on well-known problems from the literature. Finally, we compare the algorithm with several existing algorithms. The results show that our algorithm is promising.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 54, Issue 3, April 2008, Pages 648–665
نویسندگان
, , ,