Adaptive local search approach for the timetable scheduling problem
| Author | Hadjidj, Drifa |
| Author | Hadjidj, Rachid |
| Author | Drias, Habiba |
| Available date | 2020-08-20T08:06:22Z |
| Publication Date | 2017 |
| Publication Name | 2017 5th International Conference on Electrical Engineering - Boumerdes, ICEE-B 2017 |
| Resource | Scopus |
| Abstract | In this paper, we present a new Adaptive Local Search approach (ALS) and its implementation for the NP hard Timetable Scheduling Problem. This approach uses graph heuristics to generate the initial solution and the Aspiration criterion with Random moves strategies to improve a guided local search procedure for the search process. Experimental results on a collection of data sets from the popular Carter's benchmark demonstrated very promising results when compared with several existing state of the art approaches. 2017 IEEE. |
| Language | en |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Subject | Aspiration strategy component: Scheduling Graph heuristics Guided Local Search Meta-heuristic Random moves strategy Timetable |
| Type | Conference Paper |
| Pagination | 6-Jan |
| Volume Number | 2017-January |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
This item appears in the following Collection(s)
-
Computer Science & Engineering [2402 items ]