An Improved Ant Colony Algorithm and It´s Application in Exam-Arrangement

Author

Xiao, Le ; Li, ZhouFang

Author_Institution

Sch. of Inf. Sci. & Eng., Henan Univ. of Technol., Zhengzhou, China

fYear

2010

fDate

22-23 May 2010

Firstpage

1

Lastpage

0

Abstract

A exam-arrangement model with multi-constraints and optimization goal was constructed and an improved ant colony algorithm was proposed to solve the exam-arrangement optimization problem; To improve the self-adaptability of the algorithm, heuristic method was improved and pheromone updating strategy was modified by adjusting the pheromone residual according to the progress of the algorithm convergence,accordingly, the converging rate and global search capability were enthanced. Experimental results show that the optimal or nearly optimal solutions to the exam-arrangement can be quickly and effectively obtained by the improved ant colony algorithm.

Keywords

optimisation; ant colony algorithm; exam-arrangement optimization problem; heuristic method; pheromone residual; pheromone updating strategy; Ant colony optimization; Communication networks; Constraint optimization; Educational institutions; Food technology; Information science; Processor scheduling; Robustness; Scheduling algorithm; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Systems and Applications (ISA), 2010 2nd International Workshop on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-5872-1

Electronic_ISBN

978-1-4244-5874-5

Type

conf

DOI

10.1109/IWISA.2010.5473691

Filename

5473691