Font Size: a A A

Mixed Timetabling System Based On Competition,Cooperation, Parallel Simulated Annealing Algorithm

Posted on:2013-01-15Degree:MasterType:Thesis
Country:ChinaCandidate:R C LiuFull Text:PDF
GTID:2268330398457030Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Currently, the Universities Timetabling job mainly in artificial timetable, and use timetable software to adjust the result as auxiliary. The fundamental reason is that Timetabling job is recognized as NP-complete problem, its computational complexity and problems of scale exponential relationship. Therefore, bring in a large number of intelligent search and evolution based approximation algorithms, including GA(Genetic Algorithms), SAA(Simulated Annealing Arthmetic), ACO (Ant Colony Optimization), as well as BSA(Branch-and-bound Search Algorithm).The SAA has strong global search capability, widely used in the Timetable Problems. However, the SAA does not has a good parallel, if using parallel computing, different calculation unit separate search, noninterference in each other, can not share the evolution of the results, makes the increase in computing unit but can not be guaranteed to improve the quality of solutions.In this paper, the Parallel-SAA based on computing unit between competition and collaboration so that each computing unit regularly interact, share stage evolution calculations, a calculation unit breakthrough will lead to the development of other computing unit. The Parallel-SAA has excellent scalability, through simple interactive network, it is possible to make full use of the existing computing resources, including a CPU, a memory, and the CPU multicore etc. The calculation process is open, and a computing unit can intervene or exit at any time in the calculation process, contribute their computing power. With decreasing annealing temperature, the local search capabilities of the SAA is improved, but due to the limited nature of the SAA itself, the local search results are often unsatisfactory.-This paper in accordance with the nature of the timetabling problem, improved hill-climbing method, based on SAA to search results, and strengthen the local search ability to improve the solutoin’s quality.Use Asp.Net technology as a carrier to complete the B/S architecture system algorithm. In order to make the software more user-friendly and available, the establishment of graphical interface for inpute the constraints and output Timetable results. The system can output a variety of optimization for the user to choose.
Keywords/Search Tags:Timetable, Simulated Annealing Arthmetic, Hill-climbing Method, Parallel Algorithm
PDF Full Text Request
Related items