Hedi Mhalla

Hedi Mhalla

Auto-generated profile, based on publicly available information

Hedi Mhalla

College of Engineering and Technology , American University of the Middle East , Kuwait

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
1 March 2017 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
FAFerhan Al‐Maliky
Ferhan Al‐Maliky
MHMhand Hifi
Mhand Hifi
HMHedi Mhalla
Hedi Mhalla

1 November 2013 in Discrete Optimization
Verified
Journal Article
Closed access
MHMhand Hifi
Mhand Hifi
HMHedi Mhalla
Hedi Mhalla

18 December 2024 in Operations Research Forum
Verified
Journal Article
Closed access
PDF file
YLYacine Laalaoui
Yacine Laalaoui
HMHedi Mhalla
Hedi Mhalla

9 December 2021
Verified
Conference Paper
Closed access
HMHedi Mhalla
Hedi Mhalla
YLYacine Laalaoui
Yacine Laalaoui
In the last two decades we observed a considerably improvement in algorithms' performances and their ability to solve hard combinatorial optimization problems. One of these problems is the knapsack sharing problem (KSP). The latter problem is a challenging variant of the well-known NP-hard single knapsack problem. In fact, we can find in the literature several exact and heuristic resolution approaches to solve the (KSP). We mainly propose here an improvement and an adaptation to parallel computing of one of the existing and most recent algorithm in the literature. The approach is a constructive tree search that runs in two phases: the initial solution construction phase and the second phase where we build the optimal solution through a customized branch and bound. We applied a parallel computing on this second phase in order to improve the overall computational time. Finally we present a comparative study on instances from literature to show the positive effect of parallel processing on the computing time.

3 April 2025 in Engineering, Technology & Applied Science Research
Verified
Journal Article
Open access
PDF file
NANilüfer Pekin Alakoç
Nilüfer Pekin Alakoç
HMHedi Mhalla
Hedi Mhalla
This study, proposes a heuristic algorithm to balance Robotic Assembly Lines (RAL). A flexible line is assumed in which robots can be allocated to any station, perform any task, and have fixed setup costs. To consider both robot allocation costs and limiting the number of stations, the current work aims to minimize the system cost, which includes new station and robot allocation costs. It evaluates the performance of the algorithm with a large set of randomly generated samples and conducts statistical analyses to summarize, compare, and draw conclusions. The experimental results demonstrate the efficacy of the proposed algorithm in addressing large-scale problems in a reasonable timeframe.

1 November 2014
Verified
Conference Paper
Closed access
FAFerhan Al-Maliky
Ferhan Al-Maliky
MHMhand Hifi
Mhand Hifi
HMHedi Mhalla
Hedi Mhalla
In this paper, we propose to solve the max-min multiple knapsack problem by using an exact solution search. An instance of the problem is defined by a set of n items to be packed into m knapsacks as to maximize the minimum of the knapsacks' profits. The proposed method uses a series of interval searches, where each interval is bounded with a target value (considered as a lower bound) and an estimated upper bound. The target lower bound is computed by applying some aggressive fixation of some items to optimality whereas the upper bound is computed by using a surrogate relaxation. The performance of the proposed method is evaluated on a set of instances containing a variety of sizes. Computational results showed the superiority of the proposed method when comparing its provided results to those obtained by the Cplex solver and one of the best exact method available in the literature.