• No results found

[PDF] Top 20 A tensor based hyper heuristic for nurse rostering

Has 10000 "A tensor based hyper heuristic for nurse rostering" found on our website. Below are the top 20 most common "A tensor based hyper heuristic for nurse rostering".

A tensor based hyper heuristic for nurse rostering

A tensor based hyper heuristic for nurse rostering

... There are various benchmarks for nurse rostering. Curtois (2015) pro- vides a comprehensive public benchmark including the latest best known results together with the approaches yielding them. The ... See full document

39

Grammatical evolution hyper heuristic for combinatorial optimization problems

Grammatical evolution hyper heuristic for combinatorial optimization problems

... currently based at the University of Nottingham’s Malaysia campus, where he is serving as Vive-Provost (Research and Knowledge ...and Hyper-Heuristics, Evolutionary Computation and Artificial Intelligence, ... See full document

22

Lookahead policy and genetic algorithm for solving nurse rostering problems

Lookahead policy and genetic algorithm for solving nurse rostering problems

... It has been observed that more than 60% of the computational time spent by our latest ADP implementation is used to produce the solutions in each stage. This has been the motivation for developing an improved way to ... See full document

12

A heuristic algorithm based on multiassignment procedures for nurse scheduling

A heuristic algorithm based on multiassignment procedures for nurse scheduling

... for nurse scheduling ...different nurse scheduling ...specific nurse rostering problem being solved can be done easily by having a procedure to check each constraint (hard or soft) in order to ... See full document

24

A learning automata based multiobjective hyper heuristic

A learning automata based multiobjective hyper heuristic

... selection hyper- heuristic with the adaptation ...selection hyper-heuristics leading to an improved overall ...used tensor analysis as a machine learning approach to decide which low level ... See full document

15

A hybrid integer and constraint programming approach to solve nurse rostering problems

A hybrid integer and constraint programming approach to solve nurse rostering problems

... the Nurse Rostering Problem, which have the potential to provide better performance for large-size problem instances when the modelling is designed in a customised ... See full document

31

A harmony search algorithm for nurse rostering problems

A harmony search algorithm for nurse rostering problems

... population based and local search based meta-heuristic algorithms developed to solve NRPs include GAs [12, 13], TS [14, 15], SA [16, 17] and many ... See full document

22

A time predefined variable depth search for nurse rostering

A time predefined variable depth search for nurse rostering

... There also a few possibilities for future work. It may be possible to develop a more powerful algorithm by using the variable depth search as the improvement method in a population based approach such as a memetic ... See full document

16

A tensor based selection hyper heuristic for cross domain heuristic search

A tensor based selection hyper heuristic for cross domain heuristic search

... selection hyper-heuristic combines heuristic selection and move acceptance methods under an iterative single point-based search ...selected heuristic and a decision is made whether the ... See full document

47

A hybrid integer programming and variable neighborhood search algorithm to solve Nurse Rostering Problems

A hybrid integer programming and variable neighborhood search algorithm to solve Nurse Rostering Problems

... The Nurse Rostering Problem (NRP) is defined as assigning a number of nurses to different shifts during a specified planning period, considering some regulations and ...greedy heuristic, the solution ... See full document

35

An apprenticeship learning hyper heuristic for vehicle routing in HyFlex

An apprenticeship learning hyper heuristic for vehicle routing in HyFlex

... A hyper-heuristic is a search method or a learning mechanism that controls a set of low level heuristics or combines different heuristic components to generate heuristics for solving a given ... See full document

8

A grouping hyper heuristic framework: application on graph colouring

A grouping hyper heuristic framework: application on graph colouring

... Selection hyper-heuristics are high level general purpose search methodologies that operate on a space formed by a set of low level heuristics rather than ...selection hyper-heuristics are iterative and ... See full document

26

Late Acceptance Selection Hyper heuristic for Wind Farm Layout Optimisation Problem

Late Acceptance Selection Hyper heuristic for Wind Farm Layout Optimisation Problem

... simple heuristic approaches to solve the wind layout optimisation ...and hyper-heuristics demonstrated even better results ...high-level hyper-heuristic approach for solving the wind farm ... See full document

5

A genetic programming hyper heuristic for the multidimensional knapsack problem

A genetic programming hyper heuristic for the multidimensional knapsack problem

... a hyper- heuristic to evolve heuristics for the biobjective 0-1 knapsack ...a hyper-heuristic by Keller and Poli [23] for the travelling salesman problem, by Fukunaga [9] to generate local ... See full document

5

e Roster Policy: Insights and implications of codifying nurse scheduling

e Roster Policy: Insights and implications of codifying nurse scheduling

... Drake, “The nurse rostering problem: from operational research to organizational reality?,” Journal of Advanced Nursing, vol.. Silvestro, “Towards a model of strategic roster planning an[r] ... See full document

26

Heuristic Hyper-minimization of Finite State Lexicons

Heuristic Hyper-minimization of Finite State Lexicons

... automatically, based on the morpheme structure implicit in the language ...presented hyper-minimization method, the transducer is reduced to 10,1% of the original size, with lookup speed decreased only by ... See full document

6

On the hypersurface of randers change of finsler square metric

On the hypersurface of randers change of finsler square metric

... Theorem 4.4. The necessary and sufficient condition of the Randers change of Square metric for Hypersurface to be a hyperplane of second kind is given by . Proof: Since from Lemma (6) is a hyper plane of second ... See full document

12

Impairment -Aware Static Route and Wavelength Assignment in WDM Networks

Impairment -Aware Static Route and Wavelength Assignment in WDM Networks

... The three prioritization categories are applied to the demands iteratively starting with the calculation of the number of available wavelength C ∈ W for each i. The available wavelengths for a path belonging to demand i ... See full document

116

A Tabu Search hyper heuristic strategy for t way test suite generation

A Tabu Search hyper heuristic strategy for t way test suite generation

... We conduct our statistical analysis for all the obtained results in Tables 4 through 11 based on multiple pairwise comparisons with 95% confidence level (i.e. α=0.05). To be specific, we adopt the Friedman tests ... See full document

30

A case study of controlling crossover in a selection hyper heuristic framework using the multidimensional knapsack problem

A case study of controlling crossover in a selection hyper heuristic framework using the multidimensional knapsack problem

... each hyper-heuristic is sufficient as these instances are extremely ...the hyper-heuristics with average performance over 10 runs ...Strategy-based hyper-heuristics as suggested by ... See full document

31

Show all 10000 documents...