An efficient simulated annealing algorithm for feasible solutions of course timetabling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5317 LNAI, Issue , 2008, Pages 675-685

  Frausto Solís, Juan ^a   Alonso Pecina, Federico ^a   Mora Vargas, Jaime ^a  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING; ARTIFICIAL INTELLIGENCE; BIONICS; DIESEL ENGINES; GENETIC ALGORITHMS; TABU SEARCH;

FEASIBLE SOLUTIONS; NEW ALGORITHMS; NP-HARD PROBLEMS; OTHER ALGORITHMS; RANDOMIZED ALGORITHMS; SIMULATED ANNEALING ALGORITHMS; TIMETABLING; TIMETABLING PROBLEMS;

SIMULATED ANNEALING;

EID: 57049164967     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88636-564     Document Type: Conference Paper

References (19)

1. Rossi-Doria, O., Sampels, M., Biratrari, M., Chiarandini, M., Dorigo, M., Gambardella, L.M., Knowles, J., Manfrin, M., Mastrolilli, L., Paetcher, B., Paquete, L., Stützte, T.: A comparison of the performance of different metaheuristic on the timetabling problem. Napier University, Université Libre de Bruxelles, Technische Universitaet Darmstadt (2002)
2. Socha, K., Knowles, J., Sampels, M.: A MAX-MIN Ant System for the University Timetabling Problem In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 1-13. Springer, Heidelberg (2002)
3. Krzysztof, S.: MAX-MIN Ant Systems for International Timetabling Competition. International Timetabling Competition, March 31 (2003)
4. Bykov, Y.: The Description of the Algorithm for International Timetabling Competition. Timetabling Competition, University of Nottingham, School of Computer Science & IT, Wollaton Road, Nottingham NG8 1BB, UK
5. Harvard Arntzen, Arne Lokketangen. A local search heuristic for a university timetabling problem, March 31 (2003)
6. Frausto-Solis, J., Alonso-Pecina, F., Larre, M., Gonzalez-Segura., C., Gomez-Ramos, J.L.: Solving the Timetabling Problem with three heuristics. WSEAS Transactions on Computers 5(11), 2849-2855 (2006)
7. Lewis, R.: (June 2007), http://www.emergentcomputing.org/timetabling/ harderinstances
8. Lewis, R., Paechter, B.: Application of the Grouping Genetic Algorithm to University Course Timetabling. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, Springer, Heidelberg (2005)
9. Lewis, R., Paechter, B.: Finding Feasible Timetables using Group-Based Operators. Technical Report NUS-2005-01, Centre for Emergent Computing, Edinburgh, Scotland 2005. IEEE Transactions on Evolutionary Computation (2005) (accepted for publication)
10. International Timetabling Competition, Consultant date: Wednesday (June 2007), http://www.idsia.ch/Files/ttcomp2002/
11. Kostuch, P.A.: The University Course Timetabling Problem with 3-Phase approach. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 251-266. Springer, Heidelberg (2005)
12. Di Gaspero, L., Schaerf, A.: Timetabling Competition TTComp 2002: Solver Description, March 31 (2003)
13. Cordeau, J.-F., Jaumard, B., Morales, R.: Efficient Timetabling Solution with Tabu Search, March 31 (2003)
14. Di Gaspero, L., Schaerf, A.: Timetabling Competition TTComp 2002: Solver Description, March 31 (2003)
15. Caballero, S.A.: Desarrollo y aplicación de un algoritmo híbrido de cómputo evolutivo y Recocido Simulado para la solución de problemas de Timetabling (The development and application of a hybrid algorithm of Evolutionary Computation and Simulated Annealing for the solution of problems of Timetabling) Master Thesis, ITESM Campus Estado de México (July 2007)
16. Frausto-Solis, Federico, A.-P.: Analytically Tuned Parameters of Simulated Annealing for the Timetabling Problem. In: WSEAS International Conferences Puerto De La Cruz, Tenerife, Canary Islands, Spain, December 14-16 (2007)
17. Sanvicente-Sanchez, H., Frausto Solis, I: Method to Establish the Cooling Scheme in Simulated Annealing Like Algorithms, México (2003)
18. Aarts, E., Korst, J.: Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing, hichester [England]. Wiley, New York (1989)
19. Frausto-Solis, J., Alonso-Pecina, F.: FRALONSO: A Hybrid Simulated Annealing-Tabu Search Algorithm for Post Enrolment Course Timetabling. In: PATAT Conferences 2008, Montreal Canada (accepted, 2008)