Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Luca Di Gaspero"'
Publikováno v:
Journal of the Operational Research Society. 70:1039-1050
The thesis defense timetabling problem consists in composing the suitable committee for a set of defense sessions and assigning each graduation candidate to one of the sessions.In this work, we define the problem formulation that applies to some Ital
This book constitutes the refereed proceedings of the 14th International Conference on Metaheuristics, MIC 2022, held in Syracuse, Italy, in July 2022.The 48 full papers together with 17 short papers presented were carefully reviewed and selected fro
Autor:
Michele Battistutta, Fabio De Cesco, Elena Topan, Andrea Schaerf, Sara Ceschia, Luca Di Gaspero
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR
CPAIOR
We investigate the examination timetabling problem in the context of Italian universities. The outcome is the definition of a general problem that can be applied to a large set of universities, but is quite different in many aspects from the classica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05e9a179a577ca87c43d543a1aca5905
http://hdl.handle.net/11390/1193257
http://hdl.handle.net/11390/1193257
Publikováno v:
Energies
Volume 13
Issue 23
Pages: 6214
Energies, Vol 13, Iss 6214, p 6214 (2020)
Volume 13
Issue 23
Pages: 6214
Energies, Vol 13, Iss 6214, p 6214 (2020)
In recent years, cold food chains have shown an impressive growth, mainly due to customers life style changes. Consequently, the transportation of refrigerated food is becoming a crucial aspect of the chain, aiming at ensuring efficiency and sustaina
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04077186480ec8ddba48948a3afc02de
http://hdl.handle.net/11390/1194047
http://hdl.handle.net/11390/1194047
Publikováno v:
Computers & Industrial Engineering. 114:235-243
We consider the discrete single-machine, multi-item lot-sizing and scheduling problem and we propose a Simulated Annealing (SA) approach together with a statistically-principled tuning procedure to solve it. We compare our solver with the state-of-th
Publikováno v:
Annals of Operations Research. 275:1-2
Publikováno v:
Journal of Scheduling. 15:49-61
We propose a hybrid local search algorithm for the solution of the Curriculum-Based Course Timetabling Problem and we undertake a systematic statistical study of the relative influence of the relevant features on the performances of the algorithm. In
Publikováno v:
Annals of Operations Research. 194:59-70
We propose a set of formulations for the Curriculum-Based Course Timetabling problem, with the aim of “capturing” many real-world formulations, and thus encouraging researchers to “reduce” their specific problems to one of them, gaining the o
Autor:
Barry McCollum, Andrea Schaerf, Andrew J. Parkes, Rong Qu, Ben Paechter, Edmund K. Burke, Luca Di Gaspero, Paul McMullan, Rhyd Lewis
Publikováno v:
INFORMS Journal on Computing. 22:120-130
The Second International Timetabling Competition (TTC2007) opened in August 2007. Building on the success of the first competition in 2002, this sequel aimed to further develop research activity in the area of educational timetabling. The broad aim o