Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Marilène Cherkesly"'
Autor:
Marilène Cherkesly, Timo Gschwind
Publikováno v:
European Journal of Operational Research. 301:647-666
In this paper, we introduce, model and solve the pickup and delivery problem with time windows, multiple stacks, and handling operations (PDPTWMS-H). In the PDPTWMS-H, a fleet of vehicles based at a depot is used to complete a set of requests which c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cd6abbd647e7d70d47887d187df4008
https://doi.org/10.1016/j.ejor.2021.11.021
https://doi.org/10.1016/j.ejor.2021.11.021
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
Autor:
Claudio Contardo, Marilène Cherkesly
Publikováno v:
Journal of Global Optimization. 81:23-83
We introduce the conditional p-dispersion problem (c-pDP), an incremental variant of the p-dispersion problem (pDP). In the c-pDP, one is given a set N of n points, a symmetric dissimilarity matrix D of dimensions $$n\times n$$ , an integer $$p\ge 1$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e9aeb04d1289cd8688b08910e6dca6a
https://doi.org/10.1007/s10898-020-00962-4
https://doi.org/10.1007/s10898-020-00962-4
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96ae23df954adbdcd581f2f9ca5c0823
https://doi.org/10.2139/ssrn.4251162
https://doi.org/10.2139/ssrn.4251162
Publikováno v:
Computers & Operations Research. 107:1-18
This paper introduces two classes of location problems with interconnected facilities. These problems differ from classical location problems in the sense that the facilities to be located must be interconnected, i.e. located within a prescribed dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d24397209e42d1d177a17dbd6a01a02f
https://doi.org/10.1016/j.cor.2019.03.002
https://doi.org/10.1016/j.cor.2019.03.002
Autor:
Yasmina Maizi, Marilène Cherkesly
Publikováno v:
WSC
Traditionally, the design of supply chains for humanitarian operations has been developed distinctly for the different disaster management phases, with little attention to the relief to development continuum. For the immediate response phase, this de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a28ae2377c75e17f7b8e1a031b7a074
https://doi.org/10.1109/wsc48552.2020.9384003
https://doi.org/10.1109/wsc48552.2020.9384003
Publikováno v:
Computers & Operations Research, 77, 127-140. PERGAMON-ELSEVIER SCIENCE LTD
This paper introduces the pickup and delivery problem with time windows and handling operations. In this problem, the loading compartment of a vehicle is modeled as a linear LIFO stack. When an item is picked up, it is positioned on top of the stack.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0466cec59e2c6a9dc560baf07567cef8
https://doi.org/10.1016/j.cor.2016.07.014
https://doi.org/10.1016/j.cor.2016.07.014
Publikováno v:
Production and Operations Management.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4197e95f0f1232bf1f5e8de23b6c878
https://doi.org/10.1111/poms.13008
https://doi.org/10.1111/poms.13008
Publikováno v:
Transportation Science. 49:752-766
This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and last-in-first-out (LIFO) loading constraints (PDPTWL). The LIFO loading rule ensures that no handling is required prior to unloading a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::343e4d10b6133d278776963f05a223d0
https://doi.org/10.1287/trsc.2014.0535
https://doi.org/10.1287/trsc.2014.0535
Publikováno v:
Computers & Operations Research. 62:23-35
In this paper, we solve the pickup and delivery problem with time windows and last-in-first-out (LIFO) loading. LIFO loading minimizes handling while unloading items from the vehicle: the items are loaded according to a linear stack structure, and an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bab5d6b8d54df37582d8d535d2d03f8
https://doi.org/10.1016/j.cor.2015.04.002
https://doi.org/10.1016/j.cor.2015.04.002