Nabil Absi
YOU?
Author Swipe
View article: The Dynamic Rail‐Road Dial‐A‐Ride Problem
The Dynamic Rail‐Road Dial‐A‐Ride Problem Open
We consider an original dynamic dial‐a‐ride service designed for sparsely populated areas. The service relies on vehicles capable of switching between road and an existing abandoned rail network. It defines a Dial‐A‐Ride Problem (DARP) wit…
View article: Collaborative lot-sizing for industrial symbiosis
Collaborative lot-sizing for industrial symbiosis Open
International audience
View article: From MoCap and Unity to ergonomic scores and KPI
From MoCap and Unity to ergonomic scores and KPI Open
International audience
View article: The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm Open
The Storage Location Assignment Problem (SLAP) and the Picker Routing Problem (PRP) have received significant attention in the literature due to their pivotal role in the performance of the Order Picking (OP) activity, the most resource-in…
View article: Complexity analysis of integrated dynamic lot sizing and maintenance planning problems
Complexity analysis of integrated dynamic lot sizing and maintenance planning problems Open
International audience
View article: Optimization of human-aware logistics and manufacturing systems: A comprehensive review of modeling approaches and applications
Optimization of human-aware logistics and manufacturing systems: A comprehensive review of modeling approaches and applications Open
Historically, Operations Research (OR) discipline has mainly been focusing on economic concerns. Since the early 2000s, human considerations are gaining increasing attention, pushed by the growing societal concerns of sustainable developme…
View article: A note on the complexity of the picker routing problem in multi-block warehouses and related problems
A note on the complexity of the picker routing problem in multi-block warehouses and related problems Open
The Picker Routing Problem (PRP), which consists of finding a minimum-length tour between a set of storage locations in a warehouse, is one of the most important problems in the warehousing logistics literature. Despite its popularity, the…
View article: Instances and detailed results for the whole testbed of "The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm"
Instances and detailed results for the whole testbed of "The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm" Open
This repository contains the instances and detailed results used for the computational experiments in the article "The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm". Two sets of instances…
View article: Instances and detailed results for the whole testbed of "The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm"
Instances and detailed results for the whole testbed of "The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm" Open
This repository contains the instances and detailed results used for the computational experiments in the article "The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm". Two sets of instances…
View article: Optimization of Human-Aware Manufacturing and Logistics Systems: A Survey on the Modeling Frameworks of Human Aspects
Optimization of Human-Aware Manufacturing and Logistics Systems: A Survey on the Modeling Frameworks of Human Aspects Open
International audience
View article: Branch-Cut-and-Price Algorithm for an Integrated Storage Location Assignment and Picker Routing Problem
Branch-Cut-and-Price Algorithm for an Integrated Storage Location Assignment and Picker Routing Problem Open
International audience
View article: Branch-Cut-and-Price algorithm for an Operational Storage Location Assignment Problem
Branch-Cut-and-Price algorithm for an Operational Storage Location Assignment Problem Open
The Storage Location Assignment Problem in warehousing have been seldomly tackled by exact methods when considering the exact demand over a time horizon (e.g. the set of orders with different items to retrieve). In this presentation we pre…
View article: The consistent electric-Vehicle routing problem with backhauls and charging management
The consistent electric-Vehicle routing problem with backhauls and charging management Open
We consider a consistent vehicle routing problem for the delivery of parcels with electric vehicles. Stemming from a real-world problem, we assume that vehicles can only be charged with electricity between their delivery tours in the morni…
View article: Timed route approaches for large multi-product multi-step capacitated production planning problems
Timed route approaches for large multi-product multi-step capacitated production planning problems Open
International audience
View article: The Steiner bi-objective shortest path problem
The Steiner bi-objective shortest path problem Open
In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with a subset T⊂V of terminals. Arcs are labeled with travel time and cost. The goal is to find a complete set…
View article: Two-echelon distribution with a single capacitated city hub
Two-echelon distribution with a single capacitated city hub Open
In this paper, we investigate the synchronization between the two echelons in two-echelon urban distribution systems. The first echelon aims at transferring goods from a warehouse to a (single) city hub located in the city center. The seco…
View article: A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing
A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing Open
This paper is part of the special section devoted to the ROADEF/EURO challenge on inventory routing. We propose an extended formulation that we address with a heuristic branch-cut-and-price method. Among the difficulties that we had to fac…