A time constrained scheduling method based on dynamic combination of genetic algorithm and ant algorithm

Author

Li, Guangshun ; Wu, Junhua ; Huang, Baogui ; Ma, Guangsheng

Author_Institution

Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin

fYear

2007

fDate

29-31 Dec. 2007

Firstpage

119

Lastpage

122

Abstract

A time constrained scheduling (TCS) method based on dynamic combination of genetic algorithm (GA) and ant algorithm (AA) is proposed in this paper. For RCS problem, chromosome encoding, crossover, mutation and fitness function of GA are defined first, and then the initial pheromone distribution and pheromone updating rule of AA are given. Dynamic switching condition from GA to AA for TCS is also presented finally. Experimental data for TCS indicate that the average resource number needed and average execution time of our method are less than GA and AA respectively.

Keywords

encoding; genetic algorithms; scheduling; RCS problem; ant algorithm; chromosome encoding; dynamic switching; genetic algorithm; pheromone distribution; pheromone updating rule; time constrained scheduling; Algorithm design and analysis; Computer science; Constraint theory; Dynamic scheduling; Educational institutions; Genetic algorithms; Genetic engineering; Processor scheduling; Scheduling algorithm; Time factors; Max-Min ant system; dynamic switching; genetic algorithm; time constrained scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Microelectronics, 2007. ICM 2007. Internatonal Conference on

Conference_Location

Cairo

Print_ISBN

978-1-4244-1846-6

Electronic_ISBN

978-1-4244-1847-3

Type

conf

DOI

10.1109/ICM.2007.4497675

Filename

4497675