Application of PBIL Algorithm on Timetable Problems

Bing Yao JIN;Cheng Jian WEI;Zhen Ya HE

Systems Engineering - Theory & Practice ›› 2000, Vol. 20 ›› Issue (5) : 104-108.

PDF(285 KB)
PDF(285 KB)
Systems Engineering - Theory & Practice ›› 2000, Vol. 20 ›› Issue (5) : 104-108. DOI: 10.12011/1000-6788(2000)5-104
论文

Application of PBIL Algorithm on Timetable Problems

  • Bing Yao JIN(1),Cheng Jian WEI(2),Zhen Ya HE(2)
Author information +
History +

Abstract

In this paper, two applications of PBIL (Population-Based Incremental Learning) algorithm on timetable problems are researched. Here PBIL algorithm is modified. The values of the alleles can take an integer number not only 0 or 1. Also, entropy is used here as the termination condition and to estimate the degree of evolution process in PBIL algorithm. The results are satisfactory. It has proved that PBIL algorithm is a good method in solving timetab1e problems because of its good-adaptability and stability.

Key words

evolutionary algorithms / timetable problems(TTP) / entropy

Cite this article

Download Citations
Bing Yao JIN , Cheng Jian WEI , Zhen Ya HE. Application of PBIL Algorithm on Timetable Problems. Systems Engineering - Theory & Practice, 2000, 20(5): 104-108 https://doi.org/10.12011/1000-6788(2000)5-104
PDF(285 KB)

Accesses

Citation

Detail

Sections
Recommended

/