Diego Cattaruzza
YOU?
Author Swipe
View article: A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem Open
The commodity constrained split delivery vehicle routing problem (C‐SDVRP) is a routing problem where customer demands are composed of multiple commodities. A fleet of capacitated vehicles must serve customer demands in a way that minimize…
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…
Neighborhood Exploration Strategies for a Sequence-aware MOEA/D to Solve a bVRPTW Open
National audience
View article: Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems
Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems Open
We consider mixed-integer linear quantile minimization problems that yield large-scale problems that are very hard to solve for real-world instances. We motivate the study of this problem class by two important real-world problems: a maint…
View article: Instances and detailed results for the whole testbed of "A Branch-Price-and-Cut algorithm for the Kidney Exchange Problem"
Instances and detailed results for the whole testbed of "A Branch-Price-and-Cut algorithm for the Kidney Exchange Problem" Open
Instances and detailed results for the whole testbed of "A Branch-Price-and-Cut algorithm for the Kidney Exchange Problem". The .zip contains a readme with the informations about the format used to generate the instances. The .xlsx contain…
Synchronized Deliveries with a Bike and a Self-Driving Robot Open
Online e-commerce giants are continuously investigating innovative ways to improve their practices in last-mile deliveries. Inspired by the current practices at JD.com (the largest online retailer by revenue in China), we investigate a del…
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…
Improving neighborhood exploration into MOEA/D framework to solve a bi‐objective routing problem Open
Local search (LS) algorithms are efficient metaheuristics to solve combinatorial problems. The performance of LS highly depends on the neighborhood exploration of solutions. Many methods have been developed over the years to improve the ef…
View article: Models for the Interdiction Problem for the Minimum Spanning
Models for the Interdiction Problem for the Minimum Spanning Open
International audience
View article: The Interdiction Problem for the Minimum Spanning Tree
The Interdiction Problem for the Minimum Spanning Tree Open
International audience
Lower bounds for the joint batching, routing and sequencing problem Open
International audience
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…
Lower and upper bounds for the joint batching, routing and sequencing problem Open
Warehouses are nowadays the scene of complex logistic problems integrating different decision layers. This paper addresses the Joint Order Batching, Picker Routing and Sequencing Problem with Deadlines (JOBPRSP-D) in rectangular warehouses…
View article: Instances and detailed results for the whole testbed of "A Branch-Price-and-Cut algorithm for the Multi-Commodity two-echelon Distribution Problem"
Instances and detailed results for the whole testbed of "A Branch-Price-and-Cut algorithm for the Multi-Commodity two-echelon Distribution Problem" Open
Instances and detailed results for the whole testbed of "A Branch-Price-and-Cut algorithm for the Multi-Commodity two-echelon Distribution Problem"