Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
729 résultats — page 2 de 37
Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering
The personalized crew rostering problem (CRP) consists of assigning pairings (sequences of flights, deadheads, connections, and rests, forming one or several...
référence BibTeXAn improved integral column generation algorithm using machine learning for aircrew pairing
The crew pairing problem (CPP) is solved in the first step of the crew scheduling process. It consists of creating a set of pairings (sequence of flights, co...
référence BibTeX
We consider logistic collaborations where multiple carriers collaborate by consolidating demands, combining delivery routes, and serving new customers. Logis...
référence BibTeX
Nous représentons une chaîne d'approvisionnement en boucle fermée composée d'un fabricant et d'un détaillant comme un jeu dynamique joué sur un arbre d'évén...
référence BibTeX
Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...
référence BibTeX
We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...
référence BibTeXVessel service planning in seaports
Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocati...
référence BibTeX
Scholars and practitioners have long recognised the importance of data-driven operations and supply chain management (OSCM), which typically centres on produ...
référence BibTeXStochastic dual dynamic programming for multi-echelon lot-sizing with component substitution
This work investigates lot-sizing with component substitution under demand uncertainty. The integration of component substitution with lot-sizing in an uncer...
référence BibTeX
We consider the problem of designing vehicle routes in a distribution system that are at the same time cost-effective and visually attractive. In this pape...
référence BibTeXA branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows
In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon vehicle routing problem with time windows. This problem arises i...
référence BibTeX
This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for...
référence BibTeX
Two-stage stochastic programs are a class of stochastic problems where data uncertainty is often discretized into scenarios, making them amenable to solution...
référence BibTeX
We study a distributionally robust version of the classical capacitated facility location problem with a distributional ambiguity set defined as a Wasserst...
référence BibTeX
We study a new variant of the vehicle routing problem, which arises in hospital-wide scheduling of physical therapists. Multiple service locations exist for...
référence BibTeX
Column generation (CG) algorithms are well known to suffer from convergence issues due, mainly, to the degenerate structure of their master problem and the ...
référence BibTeX
We consider an integrated optimization problem including the production, inventory, and outbound transportation decisions where a central plant fulfills the ...
référence BibTeX
Column generation (CG) is widely used for solving large-scale optimization problems. This article presents a new approach based on a machine learning (ML) t...
référence BibTeXA Simulation model for short and long term humanitarian supply chain operations management
Traditionally, the design of supply chains for humanitarian operations has been developed distinctly for the different disaster management phases, with littl...
référence BibTeX
The monthly crew pairing problem (CPP) consists of determining a least-cost set of feasible crew pairings (sequences of flights starting and ending at a crew...
référence BibTeX