Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem
نویسندگان
چکیده
منابع مشابه
Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem
The Nurse Rostering Problem is an NP-hard combinatorial optimization, scheduling problem for assigning a set of nurses to shifts per day by considering both hard and soft constraints. A novel metaheuristic technique is required for solving Nurse Rostering Problem (NRP). This work proposes a metaheuristic technique called Directed Bee Colony Optimization Algorithm using the Modified Nelder-Mead ...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملMulti-Objective Ant Colony Optimization Algorithm to Solve a Nurse Scheduling Problem
In this paper we deal with the Nurse Scheduling Problem (NSP) in a hospital. The problem aims to generate a feasible and a satisfactory schedule to the planners and the hospital staffs. Sometimes a large number of constraints are taken into account: preferences of staffs (vacation, public holidays, and special demands) and administrative or union obligations, in order to ensure a good working c...
متن کاملUsing the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem
The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on th...
متن کاملa honey bee algorithm to solve quadratic assignment problem
assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence and Neuroscience
سال: 2017
ISSN: 1687-5265,1687-5273
DOI: 10.1155/2017/6563498