Hiba Yahyaoui

Kedge Business School

This paper studies a novel sustainable vessel routing problem modeling considering the multi-compartment, split pickup and split delivery, and time windows concepts. In the presented problem, oil tankers transport crude oil from supply ports to demand ports around the globe. The objective is to find ship routes, as well as port arrival and departur...

This paper studies a novel sustainable vessel routing problem modeling considering the multi-compartment, split pickup and split delivery, and time windows concepts. In the presented problem, oil tankers transport crude oil from supply ports to demand ports around the globe. The objective is to find ship routes, as well as port arrival and departur...

We address in this paper a multi-compartment vehicle routing problem (MCVRP) that aims to plan the delivery of different products to a set of geographically dispatched customers. The MCVRP is encountered in many industries, our research has been motivated by petrol station replenishment problem. The main objective of the delivery process is to mini...

In this paper, a Multi-Compartment Vehicle Routing Problem (MCVRP) is discussed. The main objective of this problem is to minimize the total traveled distance while using a minimum number of trucks. Different product types are loaded into a fleet of homogeneous trucks with an identical capacity of compartments. For this problem, we present a mathem...

This article addresses the distribution network reconfiguration problem (DNRP) and the power flow method. The studied DNRP operates on standard configurations of electrical networks. The main objectives handled are the minimization of power loss, the number of switching operations and the deviations of bus voltages from their rated values. Metaheur...

In this paper, the authors address a delivery process with time requirements in the supply chain, stated as follows: orders launched from customers are centralized and assigned to firms’ depots for the delivery process. The consideration of a depot and a set of customers belonging to different firms, is seen as a VRPTW that serves n customers using...

We develop in this paper an energy ordering problem with multiple energy supplying sources and multiple traders trying to satisfy customers’ demands. Such a supply chain network is split of three main layers: the set of energy generation plants (suppliers), a set of traders trying to expect and satisfy customer’s demands dispatched. Following the n...

The Quadratic Multiple Knapsack Problem (QMKP) is a variant of the well-known NP-hard knapsack problem that assign profits not only to individual items but also to pairs of items. QMKP aims to maximize a quadratic objective function subject to a linear capacity constraint. In this paper, we focus on proposing a hyper-heuristic approach based in the...

In this paper, we address the Optimal Network Reconfiguration (ONR) problem that operates on standard configurations of electrical networks. The main objectives handled by the ONR are the minimization of power loss, the number of switching operations and the deviations of bus voltages from their rated values. Due to its multi-objective nature and c...

In this paper, we address a distribution network reconfiguration problem (DNRP) that operates on standard configurations of electrical networks. The main objectives handled by the DNRP are the minimization of power loss, the minimization of the number of switching operations and the minimization of the deviations of bus voltages from their rated va...

We address in this paper a hydrogen transportation management problem within the supply chain. The hydrogen in the liquid or gaseous state has to be transported to numerous destinations (storage points or final customers) while considering specific product requirements. We focus on the liquid hydrogen transportation problem modeled as a vehicle rou...

In this paper an iterated local search (ILS) is embedded with a variable neighborhood Descent (VND) hyper-heuristic. The proposed hyper-heuristic combines low-level heuristics. Several variants from the literature within the proposed ILS were implemented and tested. This article conducts an empirical study involving hard combinatorial optimization...

The One-Commodity Pickup-and-Delivery Traveling Salesman Problem (1-PDTSP) is a generalization of the standard travelling salesman problem. 1-PDTSP is to design an optimal tour that minimizes the overall travelled distance through the depot and a set of customers. Each customer requires either a pickup service or a delivery service. We propose a Ra...

The one-commodity pickup-and-delivery travelling salesman problem is a well known combinatorial optimization problem applied in numerous practical situations. It consists of a set of customers dispersed on a geographical area and a vehicle with a predefined capacity that must not be exceeded. The vehicle starts from a depot, and should visit each c...

In this paper a Variable Neighborhood Descent (VND) approach, is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategy was proposed to select iteratively the accurate neighborhood. Our approach was compared to VND state-of-the-art approaches. Statistical tests were also applied on the empirical results, to sh...