scholarly journals A hybrid case-based reasoning approach to detecting the optimal solution in nurse scheduling problem

Author(s):  
Svetlana Simić ◽  
Dragana Milutinović ◽  
Slobodan Sekulić ◽  
Dragan Simić ◽  
Svetislav D Simić ◽  
...  
2019 ◽  
Vol 27 (2) ◽  
pp. 561-578 ◽  
Author(s):  
Won-Gil Hyung ◽  
Sangyong Kim ◽  
Jung-Kyu Jo

Purpose Applied a hybrid approach using genetic algorithms (GAs) for a case-based retrieval process in order to increase the overall improved cost accuracy for a case-based library. The paper aims to discuss this issue. Design/methodology/approach A weight optimization approach using case-based reasoning (CBR) with proposed GAs for developing the CBR model. GAs are used to investigate optimized weight generation with an application to real project cases. Findings The proposed CBR model can reduce errors consistently, and be potentially useful in the early financial planning stage. The authors suggest the developed CBR model can provide decision-makers with accurate cost information for assessing and comparing multiple alternatives in order to obtain the optimal solution while controlling cost. Originality/value The system can operate with more accuracy or less cost, and CBR can be used to better understand the effects of factor interaction and variation during the developed system’s process.


2011 ◽  
Vol 188 ◽  
pp. 340-343 ◽  
Author(s):  
Y.H. Shen ◽  
Yi Wen Wang ◽  
Tao Chen ◽  
Hai Ying Han ◽  
H. Zhang

The large cylinder is difficult processed material, which be based on the analysis of the processing feature of large cylinder, the method is proposed on the basics of actual case resemblance, the optimal solution is educed by calculating the vocal and the whole similarity with the technical property. The preferred system can be provided for the processing of process.


Author(s):  
K. M. Saridakis ◽  
A. J. Dentsoras

From a certain point of view, parametric engineering design may be considered as an optimization problem. The design problem may be represented through a set of design parameters. The optimal solution is located by using a set of competing design parameters and its evaluation is based upon specific criteria. A significant number of techniques and methodologies have been proposed in order to perform this difficult task. The selection of the appropriate one(s) depends strongly upon the nature and the specific characteristics of the design problem under consideration. The majority of these techniques and methodologies rely on the definition of some initial conditions. Wrong, misleading or incomplete initial conditions may result to solutions characterized by local optimality or may need excessive computational time in order to converge to either an optimal or a sub-optimal solution. In the context of the current work, two different approaches are used for initializing the optimization process: genetic algorithms and pattern search. Genetic algorithms need an initial population of individual solutions before the genetic operations could be deployed, while the pattern search techniques use a starting (initial) point for the optimization process. These two initial conditions (initial population and initial point) may be defined either randomly or deliberately. The present paper introduces a case-based design (CBD) module as pre-processor to the design optimization. This CBD module is based on an artificial competitive neural network, which is submitted to unsupervised learning by examples based on past design solutions. The new design is represented through fuzzy preferences and weighting factors, which are compiled by the neural network for retrieving similar past solutions. The retrieved solutions are used in order to determine the initial conditions of the optimization method (the initial population for the genetic algorithm (GA) or the starting point for the pattern search). The optimal solution is then searched using the criterion of the maximum aggregated overall preference. A system, namely Case-DeSC, has been developed in the purpose of evaluating the proposed framework in the application area of parametric design of oscillating conveyors. The results show that the proposed optimization methods converge faster to more efficient solutions if case-based reasoning (CBR) is utilized for defining the initial optimization conditions.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Li Huang ◽  
Chunming Ye ◽  
Jie Gao ◽  
Po-Chou Shih ◽  
Franley Mngumi ◽  
...  

This paper studies a special scheduling problem under hierarchical management in nurse staff. This is a more complex rostering problem than traditional nurse scheduling. The first is that the rostering requirements of charge nurses and general nurses are different under hierarchical management. The second is that nurses are preferable for relative fair rather than absolute fair under hierarchical management. The model aims at allocating the required workload to meet the operational requirements, weekend rostering preferences, and relative fairness preferences. Two hybrid heuristic algorithms based on multiobjective grey wolf optimizer (MOGWO) and three corresponding single heuristic algorithms are employed to solve this problem. The experimental results based on real cases from the Third People’s Hospital, Panzhihua, China, show that MOGWO does not as good as it does on other engineering optimization. However, the hybrid algorithms based on MOGWO are better than corresponding single algorithms on generational distance (GD) and spacing (SP) of Pareto solutions. Furthermore, for relative fair rostering objective, NSGAII-MOGWO has more power to find the optimal solution in the dimension of relative fairness.


2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.


Sign in / Sign up

Export Citation Format

Share Document