Mohamad Khairulamirin Md Razali

Mr. Mohamad Khairulamirin Md Razali

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 December 2024 in Sensors
Verified
Journal Article
Open access
PDF file
YWYujing Wang
Yujing Wang
ARAbdul Hadi Abd Rahman
Abdul Hadi Abd Rahman
FRFadilla Atyka Nor Rashid
Fadilla Atyka Nor Rashid
MRMohamad Khairulamirin Md Razali
Mohamad Khairulamirin Md Razali
Object detection is an essential computer vision task that identifies and locates objects within images or videos and is crucial for applications such as autonomous driving, robotics, and augmented reality. Light Detection and Ranging (LiDAR) and camera sensors are widely used for reliable object detection. These sensors produce heterogeneous data due to differences in data format, spatial resolution, and environmental responsiveness. Existing review articles on object detection predominantly focus on the statistical analysis of fusion algorithms, often overlooking the complexities of aligning data from these distinct modalities, especially dynamic environment data alignment. This paper addresses the challenges of heterogeneous LiDAR-camera alignment in dynamic environments by surveying over 20 alignment methods for three-dimensional (3D) object detection, focusing on research published between 2019 and 2024. This study introduces the core concepts of multimodal 3D object detection, emphasizing the importance of integrating data from different sensor modalities for accurate object recognition in dynamic environments. The survey then delves into a detailed comparison of recent heterogeneous alignment methods, analyzing critical approaches found in the literature, and identifying their strengths and limitations. A classification of methods for aligning heterogeneous data in 3D object detection is presented. This paper also highlights the critical challenges in aligning multimodal data, including dynamic environments, sensor fusion, scalability, and real-time processing. These limitations are thoroughly discussed, and potential future research directions are proposed to address current gaps and advance the state-of-the-art. By summarizing the latest advancements and highlighting open challenges, this survey aims to stimulate further research and innovation in heterogeneous alignment methods for multimodal 3D object detection, thereby pushing the boundaries of what is currently achievable in this rapidly evolving domain.

31 December 2024 in IEEE Access
Verified
Journal Article
Open access
NANorizal Abdullah
Norizal Abdullah
Masri AyobMasri Ayob
Masri Ayob
MLMeng Chun Lam
Meng Chun Lam
NSNasser R. Sabar
Nasser R. Sabar
GKGraham Kendall
Graham Kendall
MRMohamad Khairulamirin Md Razali
Mohamad Khairulamirin Md Razali
The Physician Scheduling Problem (PSP) has emerged as a critical challenge in healthcare management, directly relevant to Sustainable Development Goal 3 (SDG 3) - Good Health and Well-being. Driven by physician shortages, rising operational costs, and the need for efficient workforce planning, PSP affects the quality of patient care, staff satisfaction, and the overall efficiency of the healthcare system. While previous reviews have addressed PSP, they are lacking in a comprehensive analysis of recent optimization methodologies and their effectiveness. This work aims to bridge this gap by analyzing 60 research studies which addressed PSP, published between January 2014 and June 2024. Our study also extends the problem definition, constraints, evaluation functions, and the variants of PSP. We examine a wide range of optimization methodologies, including mathematical programming, heuristics, matheuristics, and machine learning, highlighting their strengths and limitations in addressing the multifaceted nature of PSP. This review also analyzes the datasets used in PSP research, noting the lack of standardized benchmarks. Key findings reveal the prevalence of mathematical optimization methods, the growing importance of multi-objective optimization and robustness, as well as the potential of machine learning and data-driven approaches. Future research directions are outlined, emphasizing the need for more scalable algorithms, real-time scheduling capabilities, improved user interfaces, and comprehensive validation studies. This review contributes to the advancement of PSP optimization, aiming to enhance healthcare workforce management, improve patient care, and ultimately address the pressing challenges faced by healthcare systems worldwide, thus supporting the achievement of SDG 3 and promoting universal health coverage.

1 January 2025 in Computer Modeling in Engineering & Sciences
Verified
Journal Article
Open access
PDF file
MRMohamad Khairulamirin Md Razali
Mohamad Khairulamirin Md Razali
MAMasri Ayob
Masri Ayob
ARAbdul Hadi Abd Rahman
Abdul Hadi Abd Rahman
RJRazman Jarmin
Razman Jarmin
CLChian Yong Liu
Chian Yong Liu
GKGraham Kendall
Graham Kendall
The Cross-domain Heuristic Search Challenge (CHeSC) is a competition focused on creating efficient search algorithms adaptable to diverse problem domains. Selection hyper-heuristics are a class of algorithms that dynamically ... | Find, read and cite all the research you need on Tech Science Press

25 March 2024 in IEEE Access
Verified
Journal Article
Open access
MRMohamad Khairulamirin Md Razali
Mohamad Khairulamirin Md Razali
ARAbdul Hadi Abd Rahman
Abdul Hadi Abd Rahman
Masri AyobMasri Ayob
Masri Ayob
RJRazman Jarmin
Razman Jarmin
CLChian Yong Liu
Chian Yong Liu
RRRaha Abdul Rahman
Raha Abdul Rahman
The Master Surgery Scheduling Problem (MSSP) can be described as a timetabling problem involving assigning surgery groups to operating theatre (OT) time slots. Previous MSSP optimization models considered throughput, waiting measures, resource utilization, costs, and schedule assignment objectives, neglecting consecutive days assignment preferences and surgical equipment-sharing limitations. Furthermore, previous works utilize greedy constructive heuristics to produce solutions, which increases quality but decreases feasibility. Our prior study demonstrated that the saturation degree heuristic enhances feasibility by considering assignment difficulty during event selection. However, its impact on solution quality remained unexplored. Therefore, this study proposes an improved saturation degree-based constructive heuristic that integrates objective function value for event selection to increase both quality and feasibility. The algorithm sorts surgery groups based on unit scores , prioritizing lower assignment difficulty and higher objective value. The highest-scoring group is assigned to its feasible slot with the highest slot score , following similar goals. In case of no feasible slots, the repair mechanism vacates the highest swap score slot, assessing the impact on quality and feasibility. A new mathematical model is also formulated, incorporating novel objectives regarding consecutive days assignment preference and surgical equipment-sharing limitations. Validated using real-world data from Hospital Canselor Tuanku Muhriz, the proposed algorithm is evaluated considering repair mechanism usage for feasibility and objective function value for quality. The algorithm is benchmarked against greedy, random, regret-based, and saturation degree-based constructive heuristics. Our algorithm achieved a 14.63% improvement in feasibility compared to the original variant. Its objective function value is over two times better than the closest competitor and 2.6 times superior to the original variant. Comparison with the hospital’s actual plan demonstrates competitive objective function value and a more balanced waiting time distribution among surgical groups. Our study showcases that a saturation degree-based constructive heuristic considering objective function value has increased solution quality while maintaining feasibility.

2 September 2026 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MRMohamad Khairulamirin Md Razali
Mohamad Khairulamirin Md Razali
ARAbdul Hadi Abd Rahman
Abdul Hadi Abd Rahman
Masri AyobMasri Ayob
Masri Ayob
Selection hyper-heuristics represent high-level search algorithms that dynamically select and apply lower-level heuristics to solve various optimization problems. They encompass numerous algorithmic components such as heuristic selection, move acceptance, feedback, and parameter setting. Each of these components offers multiple implementation methods, which creates challenges for algorithm designers who must decide on the most suitable approach for their algorithms. The issue is aggravated by the absence of a definitive best method for these components. Furthermore, there is a lack of a comprehensive empirical study on the efficacy of the implementation methods of these components, where most previous studies focus on heuristic selection and move acceptance. This paper addresses this gap by presenting a comprehensive empirical analysis of seven key selection hyper-heuristic components, including search points, search phases, move acceptance, feedback, Tabu mechanism, restart mechanism, and low-level heuristic parameters, in the context of population-based Genetic Algorithm Hyper-heuristic (GAHH). Implementation methods for these components were derived from 53 algorithms implemented using the HyFlex framework, notably the 20 finalist entries in the Cross-Domain Heuristic Search Challenge 2011. An analytical method is employed to compare their performance and identify the most effective implementation method within the evaluated settings. The analysis indicated that multi-point search, iterated search phases, non-stochastic threshold move acceptance, no learning from search feedback, Tabu mechanism with visited solutions, threshold restart mechanism, and adaptive parameter control as the best-performing strategies for GAHH across a limited set of 12 HyFlex tuning instances. Notably, the performance of the no-learning approach is influenced by genetic algorithm’s evolutionary operators. The results provide valuable insights that serve as a solid foundation for future algorithm development and increase the understanding of selection hyper-heuristic components, specifically in GAHH.