Solving the Teacher Assignment Problem by Two Metaheuristics__臺灣人文及社會科學引文索引資料庫

:::

詳目顯示

第 1 筆 / 總合 1 筆

/1頁

來源文獻資料
外文摘要
引文資料

題名：	Solving the Teacher Assignment Problem by Two Metaheuristics
書刊名：	International Journal of Information and Management Sciences
作者：	Gunawan, Aldy／Ng, Kien Ming
出版日期：	2011
卷期：	22:1
頁次：	頁73-86
主題關鍵詞：	Timetabling problem；Teacher assignment；Simulated annealing；Tabu search
原始連結：	連回原系統網址
相關次數：	被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0) 排除自我引用:1 共同引用:0 點閱:27

Abstract The timetabling problem arising from a university in Indonesia is addressed in this paper. It involves the assignment of teachers to the courses and course sections. We formulate the problem as a mathematical programming model. Two different algorithms, mainly based on simulated annealing (SA) and tabu search (TS) algorithms, are proposed for solving the problem. The proposed algorithms consist of two phases. The first phase involves allocating the teachers to the courses and determining the number of courses to be assigned to each teacher. The second phase involves assigning the teachers to the course sections in order to balance the teachers' load. The performance of the proposed algorithms is evaluated using two sets of real data and some randomly generated problem instances. The computational results show that in general, tabu search performs better than simulated annealing and other previous work. For the real data sets, the computational results show that both proposed algorithms yield better solutions when compared to manual allocation done by the university.

以文找文

期刊論文
1.	Glover, F.(1990)。Tabu Search。ORSA Journal on Computing，2(1)，4-32。
2.	Bellanti, F.、Carello, G.、Croce, F. D.、Tadei, R.(2004)。A greedy-based neighborhood search approach to a nurse rostering problem。European Journal of Operational Research，153(1)，28-40。
3.	Wang, Y. Z.(2002)。An Application of Genetic Algorithm Methods for Teacher Assignment Problems。Expert Systems with Applications，22(4)，295-302。
4.	Burke, E. K.、De Causmaecker, P.、Berghe, G. V.、Landeghem, H. V.(2004)。The state of the art of nurse rostering。Journal of Scheduling，7(6)，441-499。
5.	Glover, F.(1989)。Tabu Search。ORSA Journal on Computing，1，190-206。
6.	Kirkpatrick, Scott、Gelatt, C. D. Jr.、Vecchi, M. P.(1983)。Optimization by simulated annealing。Science，220(4598)，671-680。
7.	Breslaw, J. A.(1976)。A linear programming solution to the faculty assignment problem。Socio-Economic Planning Sciences，10(6)，227-230。
8.	Burke, E. K.、Petrovic, S.(2002)。Recent research directions in automated timetabling。European Journal of Operational Research，140(2)，266-280。
9.	Burke, E. K.、McCollum, B.、Meisel, A.、Petrovic, S.、Qu, R.(2007)。A graph-based hyper-heuristic for educational timetabling problems。European Journal of Operational Research，176(1)，177-192。
10.	Cerny, V.(1985)。A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm。Journal of Optimization Theory and Applications，45(1)，41-51。
11.	Chahal, N.、de Werra, D.(1989)。An interactive system for constructing timetables on a PC。European Journal of Operational Research，40(1)，32-37。
12.	Chen, S.-M、Lin, C.-H.(2007)。Multiple DNA sequence alignment based on genetic simulatedannealing techniques。Information and Management Sciences，18(2)，97-111。
13.	Costa, D.(1994)。A tabu search algorithm for computing an operational timetable。European Journal of Operational Research，76(1)，98-110。
14.	de Causmaecker, P.、Demeester, P.、Berghe, G. V.(2009)。A decomposed metaheuristic approach for a real-world university timetabling problem。European Journal of Operational Research，195(1)，307-318。
15.	Andrew, G. M.、Collins, R.(1971)。Matching faculty to course。College University，46(2)，83-89。
16.	de Werra, D.(1985)。An introduction to timetabling。European Journal of Operational Research，19(2)，151-162。
17.	Eswaramurthy, V. P.、Tamilarasi, A.(2009)。Hybridization of ant colony optimization strategies in tabu search for solving job shop scheduling problems。International Journal of Information and Manage-ment Sciences，20(2)，173-189。
18.	Schaerf, A.(1999)。A survey of automated timetabling。Artificial Intelligence Review，13(2)，87-127。
19.	Schniederjans, M.J.、Kim, G. C.(1987)。A goal programming model to optimize departmental preference in course assignments。Computers and Operations Research，14(2)，87-96。
20.	Drezner, Z.(2005)。The extended concentric tabu for the quadratic assignment problem。European Journal of Operational Research，160(2)，416-422。
21.	Gunawan, A.、Ng, K. M.、Poh, K. L.(2007)。Solving the teacher assignment-course scheduling problem by a hybrid algorithm。International Journal of Computer，1(2)，136-141。
22.	Gunawan, A.、Ong, H. L.、Ng, K. M.(2008)。A genetic algorithm for the teacher assignment problem。International Journal of Information and Management Sciences，19(1)，1-16。
23.	Harwood, G. B.、Lawless, R. W.(1975)。Optimizing organizational goals in assigning faculty teaching schedules。Decision Science，6(3)，513-524。
24.	Tillett, P. I.(1975)。An operations research approach to the assignment of teachers to courses。Socio-Economic Planning Sciences，9(3)，101-104。
25.	Valdes, R. A.、Crespo, E.、Tamarit, J. M.(2000)。Assigning students to course sections using tabu search。Annals of Operations Research，96(1)，1-16。
26.	Liu, S.、Ong, H. L.(2002)。A comparative study of algorithms for the flowshop scheduling problem。Asia-Pacific Journal of Operational Research，19(2)，205-222。
27.	Schonberger, J.、Mattfeld, D. C.、Kopfer, H.(2004)。Memetic algorithm timetabling for non-commercial sport leagues。European Journal of Operational Research，153(1)，102-116。
28.	Yu, E.、Sung, K. S.(2002)。A genetic algorithm for a university weekly course timetabling problem。International Transactions in Operational Research，9(6)，703-717。
29.	Radhakrishnan, S.、Ventura, J. A.(2000)。Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times。International Journal of Produc-tion Research，38(10)，2233-2252。

會議論文
1.	Gunawan, A.、Lau, H. C.(2009)。Master physician scheduling problem。Dublin, Ireland。
2.	Massoodian, S.、Esteki, A.(2008)。A hybrid genetic algorithm for curriculum based course timetabling。Montreal, Canada。
3.	Votre, V. P.(2008)。MAGHO - A tool for teachers and physical resources assignment and for student's scheduling。Montreal, Canada。

圖書
1.	Du, D.Z.、Pardalos, P.M.(1998)。Handbook of Combinatorial Optimization。The Netherlands。
2.	Burke, E. K.、Kingston, J. H.、de Werra, D.(2004)。Applications to timetabling。The Handbook of Graph Theory。Boca Raton。
3.	Carrasco, M. P.、Pato, M. V.(2000)。A multiobjective genetic algorithm for the class/teacher timetabling problem。Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science。Berlin。
4.	Carter, M. W.、Laporte, G.(1998)。Recent developments in practical course timetabling。Practice and Theory of Automated Timetabling III, Lecture Notes in Computer Science。Berlin。
5.	Kwan, R. S. K.(2004)。Bus and train driver scheduling, in Leung。Handbook of Scheduling: Algorithms, Models and Performance。Boca Raton。
6.	Rankin, R.C.(1996)。Automatic timetabling in practice。The Practice and Theory of Automated Timetabling I: Selected Papers (PATAT 1995), Lecture Notes in Computer Science。Berlin。
7.	Saleh Elmohamed, M.A.、Coddington, P.、Fox, G.(1998)。A comparison of annealing techniques for academic course scheduling。Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science。Berlin。
8.	Schaerf, A.、Meisels, A.(2000)。Solving employee timetabling problems by generalized local search。AI*IA 99: Advances in Artificial Intelligence: 6th Congress of the Italian Association for Artificial Intelligence, Lecture Notes in Computer Science。Berlin。
9.	Wren, A.(1996)。Scheduling, timetabling and rostering - a special relationship?。Practice and Theory of Automated Timetabling I, Lecture Notes in Computer Science。Berlin。
10.	Ergl, A.(1996)。GA-based examination scheduling experience at Middle EastTechnical University。The Practice and Theory of Automated Timetabling I: Selected Papers (PATAT 1995), Lecture Notes in Computer Science。Berlin。

推文
推薦
引用網址
引用嵌入語法
轉寄

top

:::

相關期刊
相關論文
相關專書
相關著作
熱門點閱

1.	Using Layer Patterns in Solving the Two-Dimensional Cutting Stock Problem
2.	Hybridization of Ant Colony Optimization Strategies in Tabu Search for Solving Job Shop Scheduling Problems

無相關博士論文

無相關書籍

無相關著作

無相關點閱

QR Code

臺灣人文及社會科學引文索引資料庫系統

詳目顯示

臺灣人文及社會科學引文索引資料庫