Show simple item record

AuthorHadjidj, Drifa
AuthorHadjidj, Rachid
AuthorDrias, Habiba
Available date2020-08-20T08:06:22Z
Publication Date2017
Publication Name2017 5th International Conference on Electrical Engineering - Boumerdes, ICEE-B 2017
ResourceScopus
URIhttp://dx.doi.org/10.1109/ICEE-B.2017.8192111
URIhttp://hdl.handle.net/10576/15709
AbstractIn 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.
Languageen
PublisherInstitute of Electrical and Electronics Engineers Inc.
SubjectAspiration strategy
component: Scheduling
Graph heuristics
Guided Local Search
Meta-heuristic
Random moves strategy
Timetable
TitleAdaptive local search approach for the timetable scheduling problem
TypeConference Paper
Pagination6-Jan
Volume Number2017-January
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record