DocumentCode
3136245
Title
Team scheduling by genetic search
Author
Zhang, Tiehua ; Gruver, William A. ; Smith, Michael H.
Author_Institution
Intelligent Robotics & Manuf. Syst. Lab., Simon Fraser Univ., Burnaby, BC, Canada
Volume
2
fYear
1999
fDate
1999
Firstpage
839
Abstract
We consider a photographic studio that must schedule multiple teams of photographers to a large number of elementary and secondary schools. The photographers´ schedules are to be optimized so that time constraints are satisfied and each team is able to at least visit two schools daily. A multiple travelling salesman model is used where the total distance traveled and time consumed can be evaluated in a single cost function to achieve overall optimality. A genetic algorithm has been applied to solve the problem. The results show that this approach rapidly provides an effective means for solving the problem
Keywords
genetic algorithms; scheduling; travelling salesman problems; elementary schools; genetic search; photographic studio; secondary schools; team scheduling; Cost function; Educational institutions; Genetics; Intelligent robots; Job shop scheduling; Laboratories; Manufacturing systems; Packaging; Processor scheduling; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Processing and Manufacturing of Materials, 1999. IPMM '99. Proceedings of the Second International Conference on
Conference_Location
Honolulu, HI
Print_ISBN
0-7803-5489-3
Type
conf
DOI
10.1109/IPMM.1999.791495
Filename
791495
Link To Document