Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
781 résultats — page 8 de 40
The classical p-median problem assumes that service to customers is always provided by the closest facility, while in practice, customers often interact for...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
The multiple depot vehicle scheduling problem (MDVSP) has been widely studied in the context of public transit systems. It consists of building vehicle sched...
référence BibTeX
In global liner shipping networks a large share of transported cargo is transshipped at least once between container vessels, and the total transportation ti...
référence BibTeX
Soient \({\mathcal D(G)}\)
, \({\mathcal D}^L(G)={\mathcal Diag(Tr)} - {\mathcal D(G)}\)
et \({\mathcal D}^Q(G)={\mathcal Diag(Tr)} + {\mathcal D(G)}\)
,...
Soit \(G\)
un graph d'ordre \(n\)
. L'énergie \(\mathcal{E}(G)\)
d'un graph simple \(G\)
est la somme de des valeurs absolues des valeurs propres de s...
In this paper, we focus on the problem that has been described in the second international nurse rostering competition: a personalized nurse scheduling prob...
référence BibTeX
In this paper, we describe an algorithm for the personalized nurse scheduling problem. We focus on the deterministic counterpart of the specific problem t...
référence BibTeX
Given an integer solution, the integral simplex using decomposition (ISUD) seeks a descent direction that leads to an improved adjacent integer solution. It ...
référence BibTeXIntegral column generation
The integral simplex using decomposition (ISUD) algorithm was recently developed to solve efficiently set partitioning problems containing a number of variab...
référence BibTeX
The bid construction problem (BCP) for combinatorial total truckload transportation service procurement auctions consists of determining one or several bids ...
référence BibTeX
On propose un mécanisme pour favoriser la récupération et la réutilisation de produits en fin de vie pour diminuer la pollution causée par la production de n...
référence BibTeXAre 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...
référence BibTeXThe 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...
référence BibTeX
This paper reviews the literature on vehicle routing problems and location-routing problems with intermediate stops. Besides providing concise paper excerpts...
référence BibTeX
The purpose of this paper is to develop a fast heuristic called FastCARP for the solution of very large-scale capacitated arc routing problems, with or witho...
référence BibTeXThe carousel scheduling problem
Scheduling problems on which constraints are imposed with regard to the temporal distances between successive executions of the same task have numerous appli...
référence BibTeX
In this article we consider a bi-objective vehicle routing problem in which, in addition to the classical minimization of the total routing cost, the operato...
référence BibTeX
Personnel scheduling consists of determining least-cost employee work schedules to cover the demand of one or several jobs in each period of a time horizon. ...
référence BibTeX