Mohammed Abdelghany
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mohammed Abdelghany has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Amr B. Eltawil
2 shared publications- Zakaria Yahia
Industrial and Manufacturing Engineering Department, School of Innovative Design Engineering, Egypt Japan University of Science and Technology, Alexandria 21934, Egypt
2 shared publications - Amr Eltawil
Department of Industrial and Manufacturing Engineering, Egypt-Japan University of Science and Technology (EJUST), Alexandria 21934, Egypt
1 shared publication - Kazuhide Nakata
Institute of Science Tokyo, Tokyo, Japan
1 shared publication
Latest Publications
- 31 March 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55 (2) , 673-687
A new two-stage variable neighborhood search algorithm for the nurse rostering problem
The nurse rostering problem refers to the assignment of nurses to daily shifts according to the required demand of each shift and day, with consideration for the operational requirements and nurses’ preferences. This problem is known to be an NP-hard problem, difficult to be solved using the known exact solution methods especially for large size instances. Mostly, this problem is modeled with soft and hard constraint, and the objective is set to minimize the violations for the soft constraints. In this paper, a new two-stage variable neighborhood search algorithm is proposed for solving the nurse rostering problem. The first stage aims at minimizing the violations of the soft constraints with the higher penalty weights in the objective function. While the second stage considers minimizing the total solution penalty taking into account all the soft constraint. The proposed algorithm was tested on the 24 benchmark instances of Curtois and Qu (Technical Report, ASAP Research Group, School of Computer Science, University of Nottingham (2014)). The test results revealed that the proposed algorithm is able to compete with the results of a recent heuristic approach from literature for most of the tested instances.
- 31 March 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55 (2) , 673-687
A new two-stage variable neighborhood search algorithm for the nurse rostering problem
The nurse rostering problem refers to the assignment of nurses to daily shifts according to the required demand of each shift and day, with consideration for the operational requirements and nurses’ preferences. This problem is known to be an NP-hard problem, difficult to be solved using the known exact solution methods especially for large size instances. Mostly, this problem is modeled with soft and hard constraint, and the objective is set to minimize the violations for the soft constraints. In this paper, a new two-stage variable neighborhood search algorithm is proposed for solving the nurse rostering problem. The first stage aims at minimizing the violations of the soft constraints with the higher penalty weights in the objective function. While the second stage considers minimizing the total solution penalty taking into account all the soft constraint. The proposed algorithm was tested on the 24 benchmark instances of Curtois and Qu (Technical Report, ASAP Research Group, School of Computer Science, University of Nottingham (2014)). The test results revealed that the proposed algorithm is able to compete with the results of a recent heuristic approach from literature for most of the tested instances.
- Open Access
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (4) , 2051-2072
A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
Nurse Rostering is the activity of assigning nurses to daily shifts in order to satisfy the cover requirements, taking into account the operational requirements and nurses' preferences. The problem is usually modeled as sets of hard and soft constraints with an objective function to minimize violations of soft constraints. The nurse rostering problem is known to be NP-hard. Many metaheuristics were used to tackle this problem. One of the frequently used heuristics is the Variable Neighbourhood Search (VNS). The VNS is usually used as a standalone method or in integration with another exact or heuristic method. In this paper, a new hybrid VNS and Dynamic Programming based heuristic approach is proposed to handle the nurse rostering problem. In the proposed approach, two perturbation mechanisms are adopted simultaneously. The proposed approach is tested on two different benchmark data sets. A comparison with state-of-the-art methods from literature revealed the competitive performance of the proposed approach.
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (4) , 2051-2072
Open AccessA hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
Nurse Rostering is the activity of assigning nurses to daily shifts in order to satisfy the cover requirements, taking into account the operational requirements and nurses' preferences. The problem is usually modeled as sets of hard and soft constraints with an objective function to minimize violations of soft constraints. The nurse rostering problem is known to be NP-hard. Many metaheuristics were used to tackle this problem. One of the frequently used heuristics is the Variable Neighbourhood Search (VNS). The VNS is usually used as a standalone method or in integration with another exact or heuristic method. In this paper, a new hybrid VNS and Dynamic Programming based heuristic approach is proposed to handle the nurse rostering problem. In the proposed approach, two perturbation mechanisms are adopted simultaneously. The proposed approach is tested on two different benchmark data sets. A comparison with state-of-the-art methods from literature revealed the competitive performance of the proposed approach.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 18 (21573611) , 1214-1218
Individual versus integrated simulation techniques in healthcare applications
This paper compares between the individual and integrated simulation models used in the healthcare context. The paper focuses on the individual models using Agent-Based Simulation (ABS), Discrete Event Simulation (DES), and System Dynamics (SD), in addition to the integrated approaches as well as hybrid simulation, considering the advantages and limitations for each technique and the simulation software packages used for modeling. We demonstrate the advantage of the integrated approaches over the individual approaches. Integrated approaches help in modeling more complex healthcare systems and overcome the individual methods limitations. The paper concludes by a suggested framework for integrating the three methods in modeling of emergency rooms in order to achieve new objectives and improve performance.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 18 (21573611) , 1214-1218
Individual versus integrated simulation techniques in healthcare applications
This paper compares between the individual and integrated simulation models used in the healthcare context. The paper focuses on the individual models using Agent-Based Simulation (ABS), Discrete Event Simulation (DES), and System Dynamics (SD), in addition to the integrated approaches as well as hybrid simulation, considering the advantages and limitations for each technique and the simulation software packages used for modeling. We demonstrate the advantage of the integrated approaches over the individual approaches. Integrated approaches help in modeling more complex healthcare systems and overcome the individual methods limitations. The paper concludes by a suggested framework for integrating the three methods in modeling of emergency rooms in order to achieve new objectives and improve performance.