Nacima Labadie - Academia.edu (original) (raw)

Papers by Nacima Labadie

Research paper thumbnail of NSGAII enhanced with a local search for the vehicle routing problem with time windows and synchronization constraints

IFAC-PapersOnLine, 2016

In the field of Home Health Care (HHC), the vehicle routing problem with time windows, synchroniz... more In the field of Home Health Care (HHC), the vehicle routing problem with time windows, synchronization, and precedence constraints (VRPTW-SP) involves finding the lowestcost set of routes to visit patients requesting one or more services in a specific time window and during a fixed time service. Each patient has preference weights associated to the vehicles who are available to provide the requested service. To solve the problem, different variations for multiobjective meta-heuristic based on the Non-dominated Sorting Genetic Algorithm (NSGAII) are proposed. The considered objectives are the minimization of travel costs and the maximization of patients preferences. This problem was solved in a previous work as a single-objective variant, despite the conflicting nature of these two criteria. Numerical results are presented for instances with up to 73 patients. Metrics such as spacing, hyper-volume and the number of non dominated solutions are used to measure the quality of solutions.

Research paper thumbnail of Optimisation des approvisionnements en contexte humanitaire

HAL (Le Centre pour la Communication Scientifique Directe), Feb 25, 2015

International audienc

Research paper thumbnail of An Evolutionary Algorithm with Path Relinking for a Bi-objective Multiple Traveling Salesman Problem with Profits

Springer eBooks, Oct 16, 2013

ABSTRACT This chapter deals with a bi-objective multiple traveling salesman problem with profits ... more ABSTRACT This chapter deals with a bi-objective multiple traveling salesman problem with profits (BOMTSPP), generalizing the classical TSP with profits (TSPP). The TSPP is in fact a generic name for TSP problems taking into account the length of the tour and profits collected at customers. However, all these problems are not really bi-objective: the two criteria are aggregated into a single objective or one of them is replaced by a constraint. Our BOMTSPP aims at building m cycles covering a subset of potential customers so that the total collected profit is maximized and the overall traveling distance is minimized. This new problem generalizes the TSPP in two directions: a true bi-objective treatment and the construction of multiple tours. The proposed solution method is an effective evolutionary algorithm, reinforced by a post-optimization procedure based on path-relinking (PR).

Research paper thumbnail of A bi-objective chance constrained programming model for efficient crop harvest scheduling

HAL (Le Centre pour la Communication Scientifique Directe), Aug 1, 2014

International audienceOne of the main purposes of the agricultural supply chains management is to... more International audienceOne of the main purposes of the agricultural supply chains management is to organize efficiently the processes of harvesting, transport and storage of the cereal production from the growing fields to the storage facilities. The current configuration of the supply chain, where farmers can improve a continuous process of harvesting, can be enhanced by organizing a buffer crop storage (work-in-process) directly in the growing fields. Crop harvesting must be completed as soon as possible, because delayed harvest increases both the risk of yield and quality losses. Motivated by a real life study case encountered at a typical French agricultural cooperative, this paper presents a bi-objective chance constrained programming model where the optimization criteria deal with crop quality degradation and inventory control, under climate uncertainty. Due to computational complexity and time limitations, scalarization techniques combined with (1 − \alpha)-pertinent scenarios are used. Numerical results reported that the bi-response chance constrained approach offers a spectrum of non-dominated solutions satisfying a desired confidence level

Research paper thumbnail of A GRASP-ELS Metaheuristic for the Vehicles Routing Problem with Conflicts

HAL (Le Centre pour la Communication Scientifique Directe), Jun 1, 2010

Research paper thumbnail of Special Issue "New Trends and Challenges in Intelligent Transportation Systems Optimisation, Modeling and Security

HAL (Le Centre pour la Communication Scientifique Directe), 2021

Research paper thumbnail of Méthodes de résolution pour les problèmes de tournées de véhicules appliqués aux services de soins à domicile

HAL (Le Centre pour la Communication Scientifique Directe), Feb 10, 2016

International audienc

Research paper thumbnail of Efficient Traffic Flow Guidance Feedback Strategy Considering Drivers’ Disobedience in ITS

Applied sciences, May 8, 2023

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Research paper thumbnail of The multi-trip vehicle routing problem with increasing profits for the blood transportation: An iterated local search metaheuristic

Computers & Industrial Engineering

This paper studies a multi-trip routing problem of a shuttle fleet to transport blood units from ... more This paper studies a multi-trip routing problem of a shuttle fleet to transport blood units from collection sites to a blood center. In this problem, the blood units intended to produce platelets and cryoprecipitate must be processed within eight hours from their donation and arrive at the blood center at a time less than its closing time to guarantee enough processing time. Since it is assumed that blood units are donated at a collection site following a constant ratio over its operating hours, this problem is modeled as a multi-trip vehicle routing problem with increasing profits for which a mixed-integer linear programming formulation is proposed. A hybrid iterated local search metaheuristic and an extended version are developed as solution methods. The extended version includes a mixed-integer linear programming component into the local search of the hybrid metaheuristic to optimize the decision on the departure times of the trips. The solution methods are tested on a new set of instances based on the blood collection system of Bogota, Colombia.

Research paper thumbnail of Two Echelon Vehicle Routing Problem with Grey Zones, C2P Stations and Alternative Fuel Vehicles (AFV)

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Problème de tournées de véhicules à deux échelons avec des zones grises, des stations C2P et véhicules à faibles émissions

Research paper thumbnail of Gestion des flux de céréales d’une coopérative agricole

HAL (Le Centre pour la Communication Scientifique Directe), Apr 11, 2012

International audienc

Research paper thumbnail of A Cluster-First Route-Second approach for the Shared Customer Collaboration Vehicle Routing Problem

HAL (Le Centre pour la Communication Scientifique Directe), 2018

The current business environment is involved in globalized commerce and requires higher levels of... more The current business environment is involved in globalized commerce and requires higher levels of response time, at the lowest logistic costs, by the firms and the supply chain. Thus, new trends have appeared for the management of the supply chain. In that sense, to increase the level of customer service and decrease logistics cost, strategic alliances or partnerships among companies are essentials. One strategy that had been an interest point of academy and industry in the last decade is cooperation and coordination, which according to the level of the supply chain allow joint work between companies in order to achieve a common goal [1]. Horizontal Cooperation (HC) allows companies at the same level of the supply chain to identify and exploit situations of mutual benefit through joint work. This have been taken as an important principle in order to consider joint route planning, purchasing groups and manufacturing consolidation centers [2,3]. To deal with this situation, a new variant of the vehicle routing problem (VRP) is introduced by [4], named Shared Customer Collaboration Routing Problem (SCC-VRP). This problem considers horizontal cooperation at the distribution level, to optimize the potential benefits derived from such alliances between companies. In this paper we developed a Cluster-first Route-second approach for the SCC-VRP. The cluster part assigns the demand of customers to the vehicle fleet able to serve such demand, while the routing part determines for each vehicle the order in which its assigned customers are visited.

Research paper thumbnail of A genetic algorithm based approach to vehicle routing problem with indirect deliveries in humanitarian logistics

HAL (Le Centre pour la Communication Scientifique Directe), Jun 6, 2016

Research paper thumbnail of A new metaheuristic for the Split Delivery Capacitated Arc Routing Problem

HAL (Le Centre pour la Communication Scientifique Directe), Oct 29, 2008

Research paper thumbnail of Problème de tournées de véhicules avec chargement bidimensionnel et contraintes de conflits partiels multi-objectif

HAL (Le Centre pour la Communication Scientifique Directe), Jun 6, 2012

Problème de tournées de véhicules avec chargement bidimensionnel et contraintes de conflits parti... more Problème de tournées de véhicules avec chargement bidimensionnel et contraintes de conflits partiels multi-objectif

Research paper thumbnail of Mathematical model and heuristics for the vehicle routing problem with conflicts

HAL (Le Centre pour la Communication Scientifique Directe), 2011

International audienc

Research paper thumbnail of Heuristiques pour le problème de tournées de véhicules avec conflits

HAL (Le Centre pour la Communication Scientifique Directe), Mar 5, 2010

Research paper thumbnail of Heuristiques pour le problème de placement en deux dimensions avec contraintes de conflits partiels

HAL (Le Centre pour la Communication Scientifique Directe), Mar 2, 2011

National audienc

Research paper thumbnail of Problème de tournées avec profits décroissants

HAL (Le Centre pour la Communication Scientifique Directe), Feb 13, 2013

International audienc

Research paper thumbnail of Problème bicritère de localisation de sites dangereux

HAL (Le Centre pour la Communication Scientifique Directe), Apr 11, 2012

Research paper thumbnail of NSGAII enhanced with a local search for the vehicle routing problem with time windows and synchronization constraints

IFAC-PapersOnLine, 2016

In the field of Home Health Care (HHC), the vehicle routing problem with time windows, synchroniz... more In the field of Home Health Care (HHC), the vehicle routing problem with time windows, synchronization, and precedence constraints (VRPTW-SP) involves finding the lowestcost set of routes to visit patients requesting one or more services in a specific time window and during a fixed time service. Each patient has preference weights associated to the vehicles who are available to provide the requested service. To solve the problem, different variations for multiobjective meta-heuristic based on the Non-dominated Sorting Genetic Algorithm (NSGAII) are proposed. The considered objectives are the minimization of travel costs and the maximization of patients preferences. This problem was solved in a previous work as a single-objective variant, despite the conflicting nature of these two criteria. Numerical results are presented for instances with up to 73 patients. Metrics such as spacing, hyper-volume and the number of non dominated solutions are used to measure the quality of solutions.

Research paper thumbnail of Optimisation des approvisionnements en contexte humanitaire

HAL (Le Centre pour la Communication Scientifique Directe), Feb 25, 2015

International audienc

Research paper thumbnail of An Evolutionary Algorithm with Path Relinking for a Bi-objective Multiple Traveling Salesman Problem with Profits

Springer eBooks, Oct 16, 2013

ABSTRACT This chapter deals with a bi-objective multiple traveling salesman problem with profits ... more ABSTRACT This chapter deals with a bi-objective multiple traveling salesman problem with profits (BOMTSPP), generalizing the classical TSP with profits (TSPP). The TSPP is in fact a generic name for TSP problems taking into account the length of the tour and profits collected at customers. However, all these problems are not really bi-objective: the two criteria are aggregated into a single objective or one of them is replaced by a constraint. Our BOMTSPP aims at building m cycles covering a subset of potential customers so that the total collected profit is maximized and the overall traveling distance is minimized. This new problem generalizes the TSPP in two directions: a true bi-objective treatment and the construction of multiple tours. The proposed solution method is an effective evolutionary algorithm, reinforced by a post-optimization procedure based on path-relinking (PR).

Research paper thumbnail of A bi-objective chance constrained programming model for efficient crop harvest scheduling

HAL (Le Centre pour la Communication Scientifique Directe), Aug 1, 2014

International audienceOne of the main purposes of the agricultural supply chains management is to... more International audienceOne of the main purposes of the agricultural supply chains management is to organize efficiently the processes of harvesting, transport and storage of the cereal production from the growing fields to the storage facilities. The current configuration of the supply chain, where farmers can improve a continuous process of harvesting, can be enhanced by organizing a buffer crop storage (work-in-process) directly in the growing fields. Crop harvesting must be completed as soon as possible, because delayed harvest increases both the risk of yield and quality losses. Motivated by a real life study case encountered at a typical French agricultural cooperative, this paper presents a bi-objective chance constrained programming model where the optimization criteria deal with crop quality degradation and inventory control, under climate uncertainty. Due to computational complexity and time limitations, scalarization techniques combined with (1 − \alpha)-pertinent scenarios are used. Numerical results reported that the bi-response chance constrained approach offers a spectrum of non-dominated solutions satisfying a desired confidence level

Research paper thumbnail of A GRASP-ELS Metaheuristic for the Vehicles Routing Problem with Conflicts

HAL (Le Centre pour la Communication Scientifique Directe), Jun 1, 2010

Research paper thumbnail of Special Issue "New Trends and Challenges in Intelligent Transportation Systems Optimisation, Modeling and Security

HAL (Le Centre pour la Communication Scientifique Directe), 2021

Research paper thumbnail of Méthodes de résolution pour les problèmes de tournées de véhicules appliqués aux services de soins à domicile

HAL (Le Centre pour la Communication Scientifique Directe), Feb 10, 2016

International audienc

Research paper thumbnail of Efficient Traffic Flow Guidance Feedback Strategy Considering Drivers’ Disobedience in ITS

Applied sciences, May 8, 2023

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Research paper thumbnail of The multi-trip vehicle routing problem with increasing profits for the blood transportation: An iterated local search metaheuristic

Computers & Industrial Engineering

This paper studies a multi-trip routing problem of a shuttle fleet to transport blood units from ... more This paper studies a multi-trip routing problem of a shuttle fleet to transport blood units from collection sites to a blood center. In this problem, the blood units intended to produce platelets and cryoprecipitate must be processed within eight hours from their donation and arrive at the blood center at a time less than its closing time to guarantee enough processing time. Since it is assumed that blood units are donated at a collection site following a constant ratio over its operating hours, this problem is modeled as a multi-trip vehicle routing problem with increasing profits for which a mixed-integer linear programming formulation is proposed. A hybrid iterated local search metaheuristic and an extended version are developed as solution methods. The extended version includes a mixed-integer linear programming component into the local search of the hybrid metaheuristic to optimize the decision on the departure times of the trips. The solution methods are tested on a new set of instances based on the blood collection system of Bogota, Colombia.

Research paper thumbnail of Two Echelon Vehicle Routing Problem with Grey Zones, C2P Stations and Alternative Fuel Vehicles (AFV)

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Problème de tournées de véhicules à deux échelons avec des zones grises, des stations C2P et véhicules à faibles émissions

Research paper thumbnail of Gestion des flux de céréales d’une coopérative agricole

HAL (Le Centre pour la Communication Scientifique Directe), Apr 11, 2012

International audienc

Research paper thumbnail of A Cluster-First Route-Second approach for the Shared Customer Collaboration Vehicle Routing Problem

HAL (Le Centre pour la Communication Scientifique Directe), 2018

The current business environment is involved in globalized commerce and requires higher levels of... more The current business environment is involved in globalized commerce and requires higher levels of response time, at the lowest logistic costs, by the firms and the supply chain. Thus, new trends have appeared for the management of the supply chain. In that sense, to increase the level of customer service and decrease logistics cost, strategic alliances or partnerships among companies are essentials. One strategy that had been an interest point of academy and industry in the last decade is cooperation and coordination, which according to the level of the supply chain allow joint work between companies in order to achieve a common goal [1]. Horizontal Cooperation (HC) allows companies at the same level of the supply chain to identify and exploit situations of mutual benefit through joint work. This have been taken as an important principle in order to consider joint route planning, purchasing groups and manufacturing consolidation centers [2,3]. To deal with this situation, a new variant of the vehicle routing problem (VRP) is introduced by [4], named Shared Customer Collaboration Routing Problem (SCC-VRP). This problem considers horizontal cooperation at the distribution level, to optimize the potential benefits derived from such alliances between companies. In this paper we developed a Cluster-first Route-second approach for the SCC-VRP. The cluster part assigns the demand of customers to the vehicle fleet able to serve such demand, while the routing part determines for each vehicle the order in which its assigned customers are visited.

Research paper thumbnail of A genetic algorithm based approach to vehicle routing problem with indirect deliveries in humanitarian logistics

HAL (Le Centre pour la Communication Scientifique Directe), Jun 6, 2016

Research paper thumbnail of A new metaheuristic for the Split Delivery Capacitated Arc Routing Problem

HAL (Le Centre pour la Communication Scientifique Directe), Oct 29, 2008

Research paper thumbnail of Problème de tournées de véhicules avec chargement bidimensionnel et contraintes de conflits partiels multi-objectif

HAL (Le Centre pour la Communication Scientifique Directe), Jun 6, 2012

Problème de tournées de véhicules avec chargement bidimensionnel et contraintes de conflits parti... more Problème de tournées de véhicules avec chargement bidimensionnel et contraintes de conflits partiels multi-objectif

Research paper thumbnail of Mathematical model and heuristics for the vehicle routing problem with conflicts

HAL (Le Centre pour la Communication Scientifique Directe), 2011

International audienc

Research paper thumbnail of Heuristiques pour le problème de tournées de véhicules avec conflits

HAL (Le Centre pour la Communication Scientifique Directe), Mar 5, 2010

Research paper thumbnail of Heuristiques pour le problème de placement en deux dimensions avec contraintes de conflits partiels

HAL (Le Centre pour la Communication Scientifique Directe), Mar 2, 2011

National audienc

Research paper thumbnail of Problème de tournées avec profits décroissants

HAL (Le Centre pour la Communication Scientifique Directe), Feb 13, 2013

International audienc

Research paper thumbnail of Problème bicritère de localisation de sites dangereux

HAL (Le Centre pour la Communication Scientifique Directe), Apr 11, 2012