Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
Is Peer ReviewedIs Peer Reviewed
-
Item TypeItem Type
-
SubjectSubject
-
SourceSource
-
YearFrom:-To:
-
More FiltersMore FiltersLanguage
Done
Filters
Reset
4
result(s) for
"مستعمرات النمل"
Sort by:
Enhanced Ant Colony Algorithm with Tabu Search and Memory Solution for Solving Scheduling Problems
by
Beidas, Izzat Hisham
,
Alkaabneh, Khalid
in
الجداول الزمنية
,
الخوارزميات الحاسوبية
,
خوارزمية مستعمرة النمل
2019
The core business for the universities and other academic institution is course timetabling problem, seminars, practical session, number of teachers, number of students, and examinations. This study aims at investigating and exploring the benefits and advantages of using enhanced Ant Colony Algorithms, with tabu list and list of memory solution for solving the scheduling problem which are many and different, and all of the components of scheduling problems have the influence in reaching the near optimal solution for this problem. And Based on the obtained results, we have a promising outcome to be used in different domains to solve the scheduling problems, and the necessity for conducting training workshops for those who work in the programming domain to be able to reach the optimal solutions for the scheduling problems and compared the proposed algorithm with standard Ant Colony algorithm using benchmark dataset used the track 3 of the second international competition schedule (ITC2007) and taking consideration hard and soft constraints.
Journal Article