20.500.12556/DKUM-51753 A modular hybrid approach to employee timetabling We consider a classical employee timetabling problem: a set of employees with various skill levels, qualifications, workload and availability distributions has to be assigned to a set of shifts, each requiring a prescribed number of qualified employees and spanning a given time period. The novelty of our approach is a hybrid combination of the methods proposed in bibliography, such that we leverage the advantages of known methods while minimizing their disadvantages. Thus, we first apply the generalized local hill-climbing with randomized neighborhoods to quickly reach the vicinity of local optima, and then use the tabu search to explore more of the search space around those solutions. Our experiments show that the resulting hybrid technique performs better than the comparable approaches presented in bibliography due to the hybrid nature of the technique. In addition, we propose a modular design that utilizes dependency injection to compose the the search algorithm. Together with careful modeling, this approach allows for constant-time evaluation of each possible step in the neighborhood and for an easy evaluation of different hybrid combinations that can be combined and parameterized at runtime. operacijsko raziskovanje razporejanje zaposlenih urniki lokalna optimizacija operations research employee timetabling generalized local hill-climbing tabu search hybrid local optimization true false false Angleški jezik Neznan jezik Članek v reviji 2015-07-10 15:05:52 2015-07-10 15:05:52 2024-09-25 13:59:44 2019-07-11 07:27:25 2008 0 0 12 str. 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.8:004 14939993 14940249 URN:SI:UM:DK:AQTRNMAX http://w1.cirrelt.ca/~patat2008/PATAT_7_PROCEEDINGS/Papers/Fijavz-HA3b.pdf 1 https://dk.um.si/Dokument.php?lang=slv&id=76313 Fakulteta za naravoslovje in matematiko 0 0 0