A general ontological timetabling-model driven metaheuristics approach based on elite solutions
作者：
Highlights：
• A unified timetabling ontology – General Timetabling Problem (GTP), is proposed.
• GTP addresses cross-domain heterogeneity and provides a common modeling basis.
• Structure of the GTP model is exploited using a two-stage solution approach.
• Elite initial solutions found in the first stage are improved via meta-heuristics.
• Numerical analysis exhibits high computational efficiency of the solution approach.
摘要
•A unified timetabling ontology – General Timetabling Problem (GTP), is proposed.•GTP addresses cross-domain heterogeneity and provides a common modeling basis.•Structure of the GTP model is exploited using a two-stage solution approach.•Elite initial solutions found in the first stage are improved via meta-heuristics.•Numerical analysis exhibits high computational efficiency of the solution approach.
论文关键词：Timetabling,Ontological model,Metaheuristics,Combinatorial optimization,Simulated annealing
论文评审过程：Received 29 August 2020, Revised 18 October 2020, Accepted 6 November 2020, Available online 4 January 2021, Version of Record 14 January 2021.
论文官网地址：https://doi.org/10.1016/j.eswa.2020.114268
