Variable Neighborhood Search based algorithms for high school timetabling

被引：27

作者：

Fonseca, George H. G. ^{[1
]}

Santos, Haroldo G. ^{[2
]}

机构：

[1] Univ Fed Ouro Preto, Comp & Syst Dept, Ouro Preto, Brazil

[2] Univ Fed Ouro Preto, Dept Comp, Ouro Preto, Brazil

来源：

COMPUTERS & OPERATIONS RESEARCH | 2014年 / 52卷

关键词：

Variable Neighborhood Search; High School Timetabling Problem; Third International Timetabling; Competition; VNS;

D O I：

10.1016/j.cor.2013.11.012

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC 2011), which released many instances from educational institutions around the world and attracted 17 competitors. Some of the VNS algorithm variants were able to outperform the winner of Third ITC solver, which proposed a Simulated Annealing - Iterated local Search approach. This result coupled with another reports in the literature points that VNS based algorithms are a practical solution method for providing high quality solutions for some hard timetabling problems. Moreover they are easy to implement with few parameters to adjust. (C) 2014 Published by Elsevier Ltd.

引用

页码：203 / 208

页数：6

共 50 条

[31] Variable Neighborhood Search Algorithms for the Node Placement Problem in Multihop Networks
Katayama, Kengo
Okamoto, Yusuke
Kulla, Elis
Nishihara, Noritaka
ADVANCES ON BROAD-BAND WIRELESS COMPUTING, COMMUNICATION AND APPLICATIONS, 2017, 2 : 631 - 638
[32] Variable Neighborhood Search Algorithms for a Competitive Location Problem with Elastic Demand
Levanova T.V.
Gnusarev A.Y.
Levanova, T.V. (levanova@ofim.oscsbras.ru); Gnusarev, A. Yu. (alexander.gnussarev@gmail.com), 1600, Pleiades journals (14): : 693 - 705
[33] Tabu search techniques for large high-school timetabling problems
Schaerf, A
PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 363 - 368
[34] Parallel Scatter Search Algorithms for Exam Timetabling
Mansour, Nashat
Sleiman-Haidar, Ghia
INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2011, 2 (03) : 27 - 44
[35] Constraint-based school timetabling using hybrid genetic algorithms
Yigit, Tuncay
AI(ASTERISK)IA 2007: ARTIFICIAL INTELLIGENCE AND HUMAN-ORIENTED COMPUTING, 2007, 4733 : 848 - 855
[36] Time-dependent vehicle routing problem with backhaul with FIFO assumption: Variable neighborhood search and mat-heuristic variable neighborhood search algorithms
Bajegani, Esmaeil Akhondi
Mollaverdi, Naser
Alinaghian, Mahdi
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2021, 12 (01) : 15 - 36
[37] Tabu search and variable neighborhood search algorithms for solving interval bus terminal location problem
Rahdar, Sahar
Ghanbari, Reza
Ghorbani-Moghadam, Khatere
APPLIED SOFT COMPUTING, 2022, 116
[38] Effective adaptive large neighborhood search for a firefighters timetabling problem
Ouberkouk, Mohamed-Amine
Boufflet, Jean-Paul
Moukrim, Aziz
JOURNAL OF HEURISTICS, 2023, 29 (4-6) : 545 - 580
[39] Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance
Wahiba Jomaa
Mansour Eddaly
Bassem Jarboui
Operational Research, 2021, 21 : 2525 - 2542
[40] An Ensemble of Differential Evolution Algorithms with Variable Neighborhood Search for Constrained Function Optimization
Paldrak, Mert
Tasgetiren, M. Fatih
Suganthan, P. N.
Pan, Quan-Ke
2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 2610 - 2617

← 1 2 3 4 5 →