Achraf Jabeur Talmoudi

Achraf Jabeur Talmoudi


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
24 November 2020 in IEEE Access
Verified
Journal Article
Open access
KAKaouther Ben Ali
Kaouther Ben Ali
ATAchraf Jabeur Talmoudi
Achraf Jabeur Talmoudi
SGSaid Gattoufi
Said Gattoufi
The realtime manufacturing system is subject to different kinds of disruptions such as new job arrivals, machine breakdowns, and jobs cancellation. These different disruptions affect the original schedule that should be updated to maintain the system’s performance. An effective re-scheduling is required in this situation to make better utilization of the system resources. This paper studies the dynamic job shop scheduling problem. The problem is known as strongly NP Hard optimization problem where new jobs are unconditionally arrived at the system. Hence, to deal with system changes and performing hard tasks scheduling, we propose an evolutionary genetic algorithm based on virtual crossover operators. Experimental results are compared with state-of-the-art heuristics and metaheuristics dedicated for evaluating large scale instances. Simulation results show the efficiency of the proposed virtual crossover operators integrated into the genetic algorithm approach.

28 February 2018 in Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering
Verified
Journal Article
Closed access
ATAchraf Jabeur Talmoudi
Achraf Jabeur Talmoudi
MSMoez Soltani
Moez Soltani
LCLotfi Chaouech
Lotfi Chaouech
ACAbdelkader Chaari
Abdelkader Chaari
This article studies the problem of inappropriate parameter estimation for nonlinear system when the dataset is contaminated by noise based on fuzzy c-regression models. In comparison to the existing algorithms in the literature, the proposed method uses a generalized objective function that reduces the errors of partitioning datasets contaminated by noise, and as a consequence an accurate model is obtained. Indeed, it combines a modified version of possibilistic c-means procedure with fuzzy c-regression models. The weighted least squares method is exploited to identify the parameters contained in the consequent (THEN part). The results of this study demonstrate the effectiveness of the proposed method compared with other extended versions of the fuzzy c-regression model algorithm such as modified fuzzy c-regression model algorithm, possibilistic c-regression model and interval type-2 fuzzy c-regression model algorithm as well as other techniques existing in the literature.

14 September 2019 in Soft Computing
Verified
Journal Article
Closed access
PDF file
ATAchraf Jabeur Talmoudi
Achraf Jabeur Talmoudi
MSMoez Soltani
Moez Soltani
YBYassin Ben Belgacem
Yassin Ben Belgacem
ACAbdelkader Chaari
Abdelkader Chaari

16 November 2022 in Energies
Verified
Journal Article
Open access
PDF file
JHJamila Hemdani
Jamila Hemdani
LDLAID DEGAA
LAID DEGAA
MSMoez Soltani
Moez Soltani
NRNassim Rizoug
Nassim Rizoug
ATAchraf Jabeur Talmoudi
Achraf Jabeur Talmoudi
ACAbdelkader Chaari
Abdelkader Chaari
The market share of electric vehicles (EVs) has grown exponentially in recent years to reduce air pollution and greenhouse gas emissions. The principal part of an EV is the energy storage system, which is usually the batteries. Thus, the accurate estimation of the remaining useful life (RUL) of the batteries, for an optimal health management and a decision-making policy, still remains a challenge for automakers. In this paper, the problem of battery RUL prediction is studied from a new perspective. Unlike other estimation strategies existing in the literature, the proposed technique uses an intelligent prediction of the lifespan of lithium–iron–phosphate (LFP) batteries via a modified version of neural networks. It uses a data-driven life estimation approach and optimization method and does not require any prior comprehension and initialization of any parameters of the battery model. To validate and verify the proposed technique, we use LFP battery data sets, and the experimental results showed that the proposed methodology can well learn the characteristic relationship of battery discharge capacities as well as its state of health (SOH), where the battery life cycle changes as the battery ages with time and cycles.

18 May 2020 in Cybernetics and Systems
Verified
Journal Article
Closed access
AAAmir Abdellatif
Amir Abdellatif
ATAchraf Jabeur Talmoudi
Achraf Jabeur Talmoudi
PBPatrice Bonhomme
Patrice Bonhomme
LNLotfi Nabli
Lotfi Nabli
This paper deals with the problem of estimating the Minimum Initial Marking (MIM) of Labeled Petri Nets (L-PN). By the observation of a sequence of labels, we determine the set of possible MIMs related to a given L-PN through an approach based on GRASP (Greedy Randomized Adaptive Search Procedure) inspired method – GMIM. The objective is to get the maximum of feasible MIMs by exploring the search space and giving best solutions for real time cyber systems in short time. We consider four basic assumptions during the reasoning: (i) the L-PN structure is known; (ii) for each transition of L-PN, a label is associated, (iii) the label sequence is known, and (iv) all transitions of L-PN are observable. We show the validity and efficiency of our approach by applying the proposed GMIM metaheuristic to two validation examples: Initialization of two parallel machines (example widely cited in literature) and resources allocation in a monitoring problem via mobile robot network.

17 January 2020 in IEEE Access
Verified
Journal Article
Open access
HKHichem Kmimech
Hichem Kmimech
ATAchraf Jabeur Talmoudi
Achraf Jabeur Talmoudi
LSLayth Sliman
Layth Sliman
LNLotfi Nabli
Lotfi Nabli
Computing the minimum initial marking (MIM) in labeled Petri nets (PN) while considering a sequence of labels constitutes a difficult problem. The existing solutions of such a problem suffer from diverse limitations. In this paper, we proposed a new approach to automatically compute the MIM in labeled PNs in a timely fashion. We adopted a genetic-based algorithm to model the MIM problem. The choice of such an algorithm is justified by the nature of the MIM process which belongs to the NP-hard class. We experimentally showed the effectiveness of our approach and empirically studied the initial marking quality in particular.