Ala-Eddine Benrazek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ala-Eddine Benrazek has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Brahim Farou
Labstic Laboratory, Department of Computer Science, Guelma University, Guelma 24000, Algeria
6 shared publications - Hamid Seridi
Labstic Laboratory, Department of Computer Science, Guelma University, Guelma 24000, Algeria
6 shared publications Brahim Farou
5 shared publicationsHamid Seridi
5 shared publications- Mohamed Amine Ferrag
Guelma University
5 shared publications - Zineddine Kouahla
Department of Computer Science, 8 May 1945 University, Guelma, Algeria
5 shared publications
Latest Publications
- Open Access
- 22 May 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (11) , 5188
A Three-Stage Approach for the Multi-Depot VRP with Priority Requests
Field-service operations for utility companies require routing technicians across multiple depots while guaranteeing same-day response to critical infrastructure customers, a constraint that standard multi-depot routing methods cannot structurally enforce. We introduce the MDVRP with Priority Requests (MDVRP-PR), formalised as a lexicographic optimisation problem that guarantees service to priority customers before maximising coverage and minimising route duration. A three-stage pipeline is proposed: hybrid DBSCAN-Hierarchical clustering for topology-aware depot assignment, an Enhanced Max-Min Ant System (MMAS) with priority-driven construction, lexicographic solution selection, and repair, and a Boundary Relocate post-optimisation stage with global cross-depot recovery. The approach is evaluated on a real-world applied case study from Algérie Télécom (Guelma, Algeria), comprising a single four-depot field-service instance scaled to three sizes (55, 90, and 150 customers) and assessed over 2135 controlled runs. On this case study, the proposed clustering method outperforms the MDVRP-adapted Sweep baseline by percentage points on the largest instance (n = 150; Friedman p < 0.001). The priority mechanisms sustain feasibility across all configurations, compared to complete collapse without them ( seeds at priority), at a route-time overhead below . Relative to the company’s current manual practice, the framework improves customer coverage by percentage points within 28 s, confirming its practical utility for daily deployment in this capacity-constrained, priority-sensitive routing context.- 22 May 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (11) , 5188
Open AccessA Three-Stage Approach for the Multi-Depot VRP with Priority Requests
Field-service operations for utility companies require routing technicians across multiple depots while guaranteeing same-day response to critical infrastructure customers, a constraint that standard multi-depot routing methods cannot structurally enforce. We introduce the MDVRP with Priority Requests (MDVRP-PR), formalised as a lexicographic optimisation problem that guarantees service to priority customers before maximising coverage and minimising route duration. A three-stage pipeline is proposed: hybrid DBSCAN-Hierarchical clustering for topology-aware depot assignment, an Enhanced Max-Min Ant System (MMAS) with priority-driven construction, lexicographic solution selection, and repair, and a Boundary Relocate post-optimisation stage with global cross-depot recovery. The approach is evaluated on a real-world applied case study from Algérie Télécom (Guelma, Algeria), comprising a single four-depot field-service instance scaled to three sizes (55, 90, and 150 customers) and assessed over 2135 controlled runs. On this case study, the proposed clustering method outperforms the MDVRP-adapted Sweep baseline by percentage points on the largest instance (n = 150; Friedman p < 0.001). The priority mechanisms sustain feasibility across all configurations, compared to complete collapse without them ( seeds at priority), at a route-time overhead below . Relative to the company’s current manual practice, the framework improves customer coverage by percentage points within 28 s, confirming its practical utility for daily deployment in this capacity-constrained, priority-sensitive routing context. - Open Access
- 26 March 2026
- Published by Elsevier in Vehicular Communications
- Vol. 59
Secure UAV-AV communications architecture in non-terrestrial networks: A review
- 26 March 2026
- Published by Elsevier in Vehicular Communications
- Vol. 59
Open AccessSecure UAV-AV communications architecture in non-terrestrial networks: A review
- Top Cited PapersOpen Access
- 19 February 2026
- Published by Elsevier in Information Fusion
- Vol. 132
Security and privacy in LLMs: A comprehensive survey of threats and mitigation strategies
- 19 February 2026
- Published by Elsevier in Information Fusion
- Vol. 132
Top Cited PapersOpen AccessSecurity and privacy in LLMs: A comprehensive survey of threats and mitigation strategies
- 17 January 2026
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 131
Hybrid tree-based indexing for efficient data retrieval in Smart Grids
- 17 January 2026
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 131
Hybrid tree-based indexing for efficient data retrieval in Smart Grids
- Open Access
Internet of Things and Blockchain Adoption in Food Supply Chain: A Survey
The characteristics of Food Supply Chains (FSC) make them hard to manage properly, and many efforts have been conducted to alleviate the difficulties related to their management, especially when it comes to integrating the latest Information and Communications Technologies. The Internet of Things (IoT) has shown to be very beneficial in providing a holistic and real-time vision of FSCs. Blockchain, with its decentralization and immutability, is another promising technology, that is showing a great potential in managing FSCs. A lot of research has been carried out to prove the advantages of each of these technologies on its own. However, the research investigating their adoption together is still not enough. Our paper presents a study of recent advances in the integration of IoT and Blockchain in Food Supply Chain Management (FSCM) over the past five years. We identify key research trends, analyze the benefits and limitations of IoT–blockchain integration, and highlight major challenges hindering large-scale adoption. Finally, we propose future research directions to address these challenges and improve the adoption of IoT–blockchain solutions in FSCs. This study aims to serve as a reference for researchers and practitioners seeking to understand and advance the integration of these emerging technologies in FSCM.
Open AccessInternet of Things and Blockchain Adoption in Food Supply Chain: A Survey
The characteristics of Food Supply Chains (FSC) make them hard to manage properly, and many efforts have been conducted to alleviate the difficulties related to their management, especially when it comes to integrating the latest Information and Communications Technologies. The Internet of Things (IoT) has shown to be very beneficial in providing a holistic and real-time vision of FSCs. Blockchain, with its decentralization and immutability, is another promising technology, that is showing a great potential in managing FSCs. A lot of research has been carried out to prove the advantages of each of these technologies on its own. However, the research investigating their adoption together is still not enough. Our paper presents a study of recent advances in the integration of IoT and Blockchain in Food Supply Chain Management (FSCM) over the past five years. We identify key research trends, analyze the benefits and limitations of IoT–blockchain integration, and highlight major challenges hindering large-scale adoption. Finally, we propose future research directions to address these challenges and improve the adoption of IoT–blockchain solutions in FSCs. This study aims to serve as a reference for researchers and practitioners seeking to understand and advance the integration of these emerging technologies in FSCM.
- Open Access
Efficient $k$-NN Search in IoT Data: Overlap Optimization in Tree-Based Indexing Structures
The proliferation of interconnected devices in the Internet of Things (IoT) has led to an exponential increase in data, commonly known as Big IoT Data. Efficient retrieval of this heterogeneous data demands a robust indexing mechanism for effective organization. However, a significant challenge remains: the overlap in data space partitions during index construction. This overlap increases node access during search and retrieval, resulting in higher resource consumption, performance bottlenecks, and impedes system scalability. To address this issue, we propose three innovative heuristics designed to quantify and strategically reduce data space partition overlap. The volume-based method (VBM) offers a detailed assessment by calculating the intersection volume between partitions, providing deeper insights into spatial relationships. The distance-based method (DBM) enhances efficiency by using the distance between partition centers and radii to evaluate overlap, offering a streamlined yet accurate approach. Finally, the object-based method (OBM) provides a practical solution by counting objects across multiple partitions, delivering an intuitive understanding of data space dynamics. Experimental results demonstrate the effectiveness of these methods in reducing search time, underscoring their potential to improve data space partitioning and enhance overall system performance.
Open AccessEfficient $k$-NN Search in IoT Data: Overlap Optimization in Tree-Based Indexing Structures
The proliferation of interconnected devices in the Internet of Things (IoT) has led to an exponential increase in data, commonly known as Big IoT Data. Efficient retrieval of this heterogeneous data demands a robust indexing mechanism for effective organization. However, a significant challenge remains: the overlap in data space partitions during index construction. This overlap increases node access during search and retrieval, resulting in higher resource consumption, performance bottlenecks, and impedes system scalability. To address this issue, we propose three innovative heuristics designed to quantify and strategically reduce data space partition overlap. The volume-based method (VBM) offers a detailed assessment by calculating the intersection volume between partitions, providing deeper insights into spatial relationships. The distance-based method (DBM) enhances efficiency by using the distance between partition centers and radii to evaluate overlap, offering a streamlined yet accurate approach. Finally, the object-based method (OBM) provides a practical solution by counting objects across multiple partitions, delivering an intuitive understanding of data space dynamics. Experimental results demonstrate the effectiveness of these methods in reducing search time, underscoring their potential to improve data space partitioning and enhance overall system performance.
- 19 September 2023
- Published by Elsevier in Internet of Things
- Vol. 24
IoVT-based efficient solution for optimal active smart camera selection in a tracking mission
- 19 September 2023
- Published by Elsevier in Internet of Things
- Vol. 24
IoVT-based efficient solution for optimal active smart camera selection in a tracking mission
- 16 June 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (18) , 20562-20599
Tree-based indexing technique for efficient and real-time label retrieval in the object tracking system
- 16 June 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (18) , 20562-20599
Tree-based indexing technique for efficient and real-time label retrieval in the object tracking system
- Open Access
Introduction of a tree-based technique for efficient and real-time label retrieval in the object tracking system
This paper addresses the issue of the real-time tracking quality of moving objects in large-scale video surveillance systems. During the tracking process, the system assigns an identifier or label to each tracked object to distinguish it from other objects. In such a mission, it is essential to keep this identifier for the same objects, whatever the area, the time of their appearance, or the detecting camera. This is to conserve as much information about the tracking object as possible, decrease the number of ID switching (ID-Sw), and increase the quality of object tracking. To accomplish object labeling, a massive amount of data collected by the cameras must be searched to retrieve the most similar (nearest neighbor) object identifier. Although this task is simple, it becomes very complex in large-scale video surveillance networks, where the data becomes very large. In this case, the label retrieval time increases significantly with this increase, which negatively affects the performance of the real-time tracking system. To avoid such problems, we propose a new solution to automatically label multiple objects for efficient real-time tracking using the indexing mechanism. This mechanism organizes the metadata of the objects extracted during the detection and tracking phase in an Adaptive BCCF-tree. The main advantage of this structure is: its ability to index massive metadata generated by multi-cameras, its logarithmic search complexity, which implicitly reduces the search response time, and its quality of research results, which ensure coherent labeling of the tracked objects. The system load is distributed through a new Internet of Video Things infrastructure-based architecture to improve data processing and real-time object tracking performance. The experimental evaluation was conducted on a publicly available dataset generated by multi-camera containing different crowd activities.
Open AccessIntroduction of a tree-based technique for efficient and real-time label retrieval in the object tracking system
This paper addresses the issue of the real-time tracking quality of moving objects in large-scale video surveillance systems. During the tracking process, the system assigns an identifier or label to each tracked object to distinguish it from other objects. In such a mission, it is essential to keep this identifier for the same objects, whatever the area, the time of their appearance, or the detecting camera. This is to conserve as much information about the tracking object as possible, decrease the number of ID switching (ID-Sw), and increase the quality of object tracking. To accomplish object labeling, a massive amount of data collected by the cameras must be searched to retrieve the most similar (nearest neighbor) object identifier. Although this task is simple, it becomes very complex in large-scale video surveillance networks, where the data becomes very large. In this case, the label retrieval time increases significantly with this increase, which negatively affects the performance of the real-time tracking system. To avoid such problems, we propose a new solution to automatically label multiple objects for efficient real-time tracking using the indexing mechanism. This mechanism organizes the metadata of the objects extracted during the detection and tracking phase in an Adaptive BCCF-tree. The main advantage of this structure is: its ability to index massive metadata generated by multi-cameras, its logarithmic search complexity, which implicitly reduces the search response time, and its quality of research results, which ensure coherent labeling of the tracked objects. The system load is distributed through a new Internet of Video Things infrastructure-based architecture to improve data processing and real-time object tracking performance. The experimental evaluation was conducted on a publicly available dataset generated by multi-camera containing different crowd activities.