Hajem Ati Daham

Dr. Hajem Ati Daham


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 June 2017 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
PDF file
HDHajem Ati Daham
Hajem Ati Daham
XYXinan Yang
Xinan Yang
MWMichaela K. Warnes
Michaela K. Warnes
© 2016 The Operational Research Society. All rights reserved. The inland transportation takes a significant portion of the total cost that arises from intermodal transportation. In addition, there are many parties (shipping lines, haulage companies, customers) who share this operation as well as many restrictions that increase the complexity of this problem and make it NP-hard. Therefore, it is important to create an efficient strategy to manage this process in a way to ensure all parties are satisfied. This paper investigates the pairing of containers/orders in drayage transportation from the perspective of delivering paired containers on 40-ft truck and/or individual containers on 20-ft truck, between a single port and a list of customer locations. An assignment mixed integer linear programming model is formulated, which solves the problem of how to combine orders in delivery to save the total transportation cost when orders with both single and multiple destinations exist. In opposition to the traditional models relying on the vehicle routing problem with simultaneous pickups and deliveries and time windows formulation, this model falls into the assignment problem category which is more efficient to solve on large size instances. Another merit for the proposed model is that it can be implemented on different variants of the container drayage problem: import only, import-inland and import-inland-export. Results show that in all cases the pairing of containers yields less cost compared to the individual delivery and decreases empty tours. The proposed model can be solved to optimality efficiently (within half hour) for over 300 orders


11 May 2022 in International journal of health sciences
Verified
Journal Article
Open access
ASAli saidg
Ali saidg
HDHajem Ati Daham
Hajem Ati Daham
KAKadhem Al-Daffaie
Kadhem Al-Daffaie
Healthcare systems efficiency is a ratio of service delivery system outputs to inputs to achieve optimal strategy for decision makers. In this paper, we investigated the efficiency of Eastern Mediterranean health observatory systems. For this purpose, a data envelopment analysis model formulated to evaluate the efficiency of healthcare systems response determinants for the Eastern Mediterranean countries. To find the important inputs and outputs that effect the efficiency, a robust regression model estimated, and the result explained which of inputs and outputs have an effect of the efficiency of these systems.

1 January 2023 in Journal of Algorithms & Computational Technology
Verified
Journal Article
Open access
RARewayda Razaq Abo-Alsabeh
Rewayda Razaq Abo-Alsabeh
HDHajem Ati Daham
Hajem Ati Daham
ASAbdellah Salhi
Abdellah Salhi
Given a rectangle [ ] containing points, we consider the problem of detecting the largest rectangle that is totally contained in [ ] and does not include any of the points. In other words, we want to find the biggest hole in the dataset that can contain the biggest possible rectangle. A new algorithm for dealing with this problem is, therefore, suggested. Existing algorithms are exact but cannot deal efficiently with problems in high dimensions and large instances. In fact, only computing maximum empty rectangles in a set of points in [ ] has been well addressed. In high dimensions, the problem is shown to be NP-complete. Our suggested approach is evolutionary in nature and is an innovative implementation of the genetic algorithm. The approach solves a more general form of the stated problem in that it ignores the axis-parallel condition imposed on the hyper-rectangles to be found. This paper includes computational results and their discussions.

1 January 2022
Verified
Journal Article
Closed access
PDF file
HDHajem Ati Daham
Hajem Ati Daham
Discrete facility location problems are classified as types of facility location problems, wherein decisions on choosing facilities in specific locations are made to serve the demand points of customers, thus minimizing the total cost. The covering- and median-based problems are the common classified types of discrete facility location problems, which both comprise different classes of discrete problems as reviewed in this research. However, the discrete facility location problems shown in deterministic and known information and data under uncertain, vague, and ambiguous environments have usually been solved using intuitionistic fuzzy approaches. Neutrosophic is recently applied to tackle the uncertainty and ambiguity of information and data. This paper considered solving the discrete facility location problems under the neutrosophic environment, wherein the information of the locations, distances, times, and costs is uncertain. The mathematical models for the main types of neutrosophic discrete facility location problems, which remain unclear till now despite previous related works, are formulated in this study. Numerical examples demonstrated testing of the neutrosophic discrete models and comparison with the optimization solutions obtained from the normal situations.

1 January 2026 in International Journal of Neutrosophic Science
Verified
Journal Article
Closed access
PDF file
HDHajem Ati Daham
Hajem Ati Daham
Husam Jasim MohammedHusam Jasim Mohammed
Husam Jasim Mohammed
American scientific publishing group