Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
806 results — page 9 of 41
This paper focuses on the traveling salesman problem with time windows (TSPTW) that arises in postal services and parcel deliveries and has features differin...
BibTeX reference
Clustering is an automated and powerful technique for data analysis. It aims to divide a given set of data points into clusters which are homogeneous and/o...
BibTeX reference
This paper introduces two classes of location problems with interconnected facilities. These problems differ from classical location problems in the sense ...
BibTeX reference
Employee scheduling is an important activity in the service industry as it has a significant impact on costs, sales, and profitability. While a large amount ...
BibTeX reference
This paper addresses the winner determination problem (WDP) for TL transportation procurement auctions under uncertain shipment volumes and uncertain carrier...
BibTeX reference
The classical p-median problem assumes that service to customers is always provided by the closest facility, while in practice, customers often interact for...
BibTeX reference
In this paper we consider a version of the capacitated vehicle routing problem (CVRP) where travel times are assumed to be uncertain and statistically corre...
BibTeX reference
Within state-of-the-art optimization solvers such as IBM--CPLEX the ability to solve both convex and nonconvex Mixed-Integer Quadratic Programming (MIQP) pro...
BibTeX reference
The multiple depot vehicle scheduling problem (MDVSP) has been widely studied in the context of public transit systems. It consists of building vehicle sched...
BibTeX reference
In global liner shipping networks a large share of transported cargo is transshipped at least once between container vessels, and the total transportation ti...
BibTeX reference
Let \({\mathcal D(G)}\), \({\mathcal D}^L(G)={\mathcal Diag(Tr)} - {\mathcal D(G)}\) and \({\mathcal D}^Q(G)={\mathcal Diag(Tr)} + {\mathcal D(G)}\) b...
Let \(G\) be a graph of order \(n\). The energy \(\mathcal{E}(G)\) of a simple graph \(G\) is the sum of
absolute values of the eigenvalues of its ...
In this paper, we focus on the problem that has been described in the second international nurse rostering competition: a personalized nurse scheduling prob...
BibTeX reference
In this paper, we describe an algorithm for the personalized nurse scheduling problem. We focus on the deterministic counterpart of the specific problem t...
BibTeX reference
Given an integer solution, the integral simplex using decomposition (ISUD) seeks a descent direction that leads to an improved adjacent integer solution. It ...
BibTeX referenceIntegral column generation
The integral simplex using decomposition (ISUD) algorithm was recently developed to solve efficiently set partitioning problems containing a number of variab...
BibTeX reference
The bid construction problem (BCP) for combinatorial total truckload transportation service procurement auctions consists of determining one or several bids ...
BibTeX reference
A performance-based mechanism as a support for an environmental protection law is proposed to promote product recovery and to subside the pollution caused by...
BibTeX referenceAre ECVs breaking even? Competitiveness of electric commercial vehicles in retail logistics
In this paper, we evaluate the competitiveness of electric commercial vehicle (ECV) in medium-duty mid-haul logistics for a specific case study. This is done...
BibTeX referenceThe impact of synchronizing drivers breaks and recharging operations for electric vehicles
Electric commercial vehicles (ECVs) are gaining importance as they are seen to provide a sustainable mean of transportation. However, practitioners still see...
BibTeX reference