Using Simulated Annealing and Ant-Colony Optimization Algorithms to Solve the Scheduling Problem

Download
Full text for this resource is not available from the Research Repository.
Export

Chmait, Nader ORCID logoORCID: https://orcid.org/0000-0002-3152-382X and Challita, K (2013) Using Simulated Annealing and Ant-Colony Optimization Algorithms to Solve the Scheduling Problem. Computer Science and Information Technology, 1 (3). pp. 208-224. ISSN 2331-6071

Item type Article
URI https://vu-9.eprints-hosting.org/id/eprint/38510
Official URL http://www.hrpub.org/journals/article_info.php?aid...
Subjects Historical > FOR Classification > 0801 Artificial Intelligence and Image Processing
Current > Division/Research > Institute for Health and Sport
Keywords combinatorial optimization problem; simulate annealing; algorithms; heuristics; Matlab; exam scheduling problem model; scheduling problems
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login

CORE (COnnecting REpositories)