Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Guy Desaulniers"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 7, Iss 4, Pp 325-357 (2019)
We consider a personalized employee scheduling problem with characteristics present in retail stores consisting of multiple departments. In the setting under study, each department generally covers its demand in employees over the planning horizon of
Externí odkaz:
https://doaj.org/article/cec71d8ac0fa4315b597c5df966cf960
Publikováno v:
EURO Journal on Computational Optimization, Vol 1, Iss 3, Pp 283-312 (2013)
We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particular, we compare subalgorithms for s
Externí odkaz:
https://doaj.org/article/681475cce94b4a6ab9301d182c93da08
Publikováno v:
Transportation Science. 57:552-572
We study a new variant of the well-studied vehicle routing problem with time windows (VRPTW), called the fragility-constrained VRPTW, which assumes that (1) the capacity of a vehicle is organized in multiple identical stacks; (2) all items picked up
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28bb6c3d0c436e5bb2b09ee1594b02c4
https://doi.org/10.1287/trsc.2022.1168
https://doi.org/10.1287/trsc.2022.1168
Publikováno v:
European Journal of Operational Research
The Inventory Routing Problem (IRP) is a broad class of complex routing problems where the quanti- ties of delivered products must also be determined. In this paper, we consider the classic IRP where a single supplier must determine when to visit its
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83d4d50947b0e54903c224fed16c1957
https://doi.org/10.1016/j.ejor.2022.02.011
https://doi.org/10.1016/j.ejor.2022.02.011
Publikováno v:
INFORMS Journal on Computing. 34:2313-2331
The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This primal algorithm generates a sequence of integer solutions with decreasing costs, leading to an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f00c92c1e643c9e01c2338ff0c22b68
https://doi.org/10.1287/ijoc.2022.1174
https://doi.org/10.1287/ijoc.2022.1174
Publikováno v:
INFORMS Journal on Computing. 34:1157-1175
We study a new variant of the vehicle routing problem, which arises in hospital-wide scheduling of physical therapists. Multiple service locations exist for patients, and resource synchronization for the location capacities is required as only a limi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cbee29c4f71abe7eaee8c408070e4dd
https://doi.org/10.1287/ijoc.2021.1119
https://doi.org/10.1287/ijoc.2021.1119
Publikováno v:
INFORMS Journal on Computing. 34:1141-1156
Column generation (CG) algorithms are well known to suffer from convergence issues due, mainly, to the degenerate structure of their master problem and the instability associated with the dual variables involved in the process. In the literature, sev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc5daa661a8f3b5254be7c887c81c371
https://doi.org/10.1287/ijoc.2021.1094
https://doi.org/10.1287/ijoc.2021.1094
Publikováno v:
Transportation Science. 56:245-264
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 in city logistics when high-capacity and low-capacity vehicles are used to transport items from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f491f1b620f7d9690227ed47e07a52c
https://doi.org/10.1287/trsc.2021.1092
https://doi.org/10.1287/trsc.2021.1092
Publikováno v:
Transportation Science. 55:1411-1429
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, connections, and rests forming one or multiple days of work for an anonymous crew member) that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::247a26f8d255f3e8ba7dd17213f9cbd6
https://doi.org/10.1287/trsc.2021.1084
https://doi.org/10.1287/trsc.2021.1084