Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Luca Di Gaspero"'
We describe the solver that we developed for the Sports Timetabling Competition ITC2021, a three-stage simulated annealing approach, that makes use of a portfolio of six different neighborhoods. Five of these neighborhoods are taken from the literatu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e13c1c749f0acac0a31915c69ce66f6e
http://hdl.handle.net/11390/1231548
http://hdl.handle.net/11390/1231548
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:
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
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
In this work we formalize a new complex variant of the classical vehicle routing problem arising from a real-world application. Our formulation includes a heterogeneous fleet, a multi-day planning horizon, a complex carrier-dependent cost for vehicle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4036fb2cfeaa4d0a5087f0515f7eca6
http://hdl.handle.net/11390/697537
http://hdl.handle.net/11390/697537