Boukthir Haddar

Faculté des sciences et Techniques de Sidi Bouzid · Infrmatique

This paper focuses on the Traveling Repairman Problem (TRP), an extension of the Traveling Salesman Problem (TSP), which has gained significant attention in various practical fields such as humanitarian logistics, machine scheduling, computer networking, and service-based distribution. Previous research on the TRP has primarily focused on exact and...

Bin packing problem (BPP) is one of the fastest-growing research issues within the field of combinatorial optimization. Over the last years, several studies carried out various BPP variants, mathematical models, and proposed methods to the BPPs. The classical BPP consists of packing a set of rectangular items in a minimum number of rectangular bins...

This paper deals with an optimization problem encountered in the field of transport of goods and services, namely the K-traveling repairman problem (K-TRP). This problem is a generalization of the metric traveling repairman problem (TRP) which is also known as the deliveryman problem and the minimum latency problem. The K-TRP and the related proble...

Several studies for the classical Bin Packing Problem (BPP) have been proposed in the literature. However, there is a lack of studies which consider realistic constraints that often arise in practice. This paper deals with the BPP with partial and total conflict between objects. We approach the problem by presenting and solving mixed integer linear...

In this paper we propose a new hybrid heuristic approach that combines the Quantum Particle Swarm Optimization technique with a local search method to solve the Multidimensional Knapsack Problem. The approach also incorporates a heuristic repair operator that uses problem-specific knowledge instead of the penalty function technique commonly used fo...

This study proposes a new hybrid heuristic approach that combines the quantum particle swarm optimization (QPSO) technique with a local search phase to solve the binary generalized knapsack sharing problem (GKSP). The approach also incorporates a heuristic repair operator that uses problem-specific knowledge instead of the penalty function techniqu...

The Knapsack Sharing Problem (KSP) is a variant of the well-known NP-Hard knapsack problem that has received a lot of attention from the researches as it appears into several real-world problems such as allocating resources, reliability engineering, cloud computing, etc. In this paper, we propose a hybrid approach that combines an Iterative Linear...

This paper proposes a new hybrid tree search algorithm to the Multidimensional Knapsack Problem MKP that effectively combines tabu search with a dynamic and adaptive neighborhood search procedure. The authors' heuristic, based on a filter-and-fan F&F procedure, uses a Linear Programming-based Heuristic to generate a starting solution to the F&F pro...

Wireless networks, specifically those based on the IEEE 802.11 standard (Wi-Fi), are experiencing rapid growth due to their low cost and high-speed connectivity. To cover larger areas, many AP's are required which need the use of handoff between different AP's. Therefore, handoff latency has become essential issue in wireless LANs. This delay affec...