Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
EN
Timetabling problems are often difficult and time-consuming to solve. Most of the methods of solving these problems are limited to one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems in various domains. The solution is based on an evolutionary algorithm framework and employs tabu search to quicken the solution finding process. Hyper-heuristics are used to establish the algorithm's operating parameters. The method has been used to solve three timetabling problems with promising results of extensive experiments.
EN
Scheduling doctors duties in a hospital are complicated and time-consuming tasks. The person responsible for creating a duty timetable is facing one major problem when allocating doctors to time periods: the agreement between several constraining (and often mutually excluding) requirements must be found. In this paper a solution methodology for the monthly duty assignment of doctors is presented. The typical problem is described in detail, along with specific hospital environment, from which datasets for experiments have been taken. A hybrid approach that utilizes strengths of a few artificial intelligence techniques was used to solve the problem. In particular, a population of initial solutions is generated heuristically and then improved using evolutionary algorithm. Experimental results are presented along with a discussion on the computational efficiency, operational acceptability and quality of the solutions.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.