Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Remy Spliet"'
Autor:
Luuk A. van Duuren, Jonathan Ozik, Remy Spliet, Nicholson T. Collier, Iris Lansdorp-Vogelaar, Reinier G. S. Meester
Publikováno v:
Frontiers in Physiology, Vol 12 (2022)
BackgroundFecal immunochemical testing (FIT) is an established method for colorectal cancer (CRC) screening. Measured FIT-concentrations are associated with both present and future risk of CRC, and may be used for personalized screening. However, eva
Externí odkaz:
https://doaj.org/article/98e278d0c32546669dda86c6d724ea67
Autor:
Twan Dollevoet, Remy Spliet
Publikováno v:
Operations Research Forum, 4(2):42. Springer International Publishing AG
We provide a preprocessing method to reduce the vehicle capacity for instances of the capacitated vehicle routing problem. This improves the LP bound of many formulations of the capacitated vehicle routing problem. It also speeds up common algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7fa00b49a4c83250ceb91f19695ae6b
https://pure.eur.nl/en/publications/af6cce8b-68d9-4b1a-a60b-7be4e2947cff
https://pure.eur.nl/en/publications/af6cce8b-68d9-4b1a-a60b-7be4e2947cff
Autor:
Ymro Nils Hoogendoorn, Remy Spliet
Publikováno v:
EUR Research Portal
We present an improved integer L-shaped method for the vehicle routing problem with stochastic demands. It exhibits speedups up to a factor of 325 compared to the current state-of-the-art, which allows us to solve previously unsolved benchmark instan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e3b8d2cce6f2636b723502123737c0d6
https://pure.eur.nl/en/publications/b888baea-ecfd-429f-916e-1ac4265dd311
https://pure.eur.nl/en/publications/b888baea-ecfd-429f-916e-1ac4265dd311
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2628ba13e08ef456d58bd559c10d8211
https://doi.org/10.2139/ssrn.4011237
https://doi.org/10.2139/ssrn.4011237
Publikováno v:
European Journal of Operational Research, 273(2), 731-739. Elsevier
More and more retailers allow customers to order goods online and then pick them up in a store. In this setting, these orders are typically served from a dedicated warehouse. This often means that the stores are visited by different vehicles to reple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e8b98b8ed90b5239578bea38543d09e
https://doi.org/10.1016/j.ejor.2018.08.027
https://doi.org/10.1016/j.ejor.2018.08.027
Publikováno v:
Transportation Science, 55(1), 179-195. INFORMS Institute for Operations Research and the Management Sciences
Collaborative transportation can significantly reduce transportation costs as well as greenhouse gas emissions. However, allocating the cost to the collaborating companies remains difficult. We consider the cost-allocation problem, which arises when
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81bc83fe7ca30f5d18cac5200d1f9072
https://pure.eur.nl/en/publications/dc82ac06-0e34-44f1-9d58-7cc708a4c37a
https://pure.eur.nl/en/publications/dc82ac06-0e34-44f1-9d58-7cc708a4c37a
Autor:
Kevin Dalmeijer, Remy Spliet
Publikováno v:
Computers and Operations Research, 89, 140-152. Elsevier Ltd.
A branch-and-cut algorithm for the TWAVRP is presented.Novel valid inequalities, the precedence inequalities, are introduced.It is shown that separating precedence inequalities speeds up the algorithm.Experiments show the algorithm is a factor 193.9
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97f43375233ac84671c51b36b90489ee
https://pure.eur.nl/en/publications/ed967740-8e58-4327-8322-253aa54aaec5
https://pure.eur.nl/en/publications/ed967740-8e58-4327-8322-253aa54aaec5
Autor:
Thomas R. Visser, Remy Spliet
Publikováno v:
Transportation Science, 54(4), 1091-1112. INFORMS Institute for Operations Research and the Management Sciences
In this paper, we introduce several new methods for efficiently evaluating moves in neighborhood search heuristics for routing problems with time-dependent travel times. We consider both the case that route duration is constrained and the case that r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8be9c9e123b00a1a241ddc61b20f5fa1
https://pure.eur.nl/en/publications/8b77d0c3-068f-4bc0-b818-8863d7284e35
https://pure.eur.nl/en/publications/8b77d0c3-068f-4bc0-b818-8863d7284e35
Publikováno v:
SSRN Electronic Journal.
In many delivery and service settings, the customer must be home when the provider arrives. If the customer is not at home, the delivery or service fails and the provider may have to return at a later point, needlessly creating additional vehicle mil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0a85f639851452a2917545214470e4a
https://doi.org/10.2139/ssrn.3478456
https://doi.org/10.2139/ssrn.3478456
Autor:
Remy Spliet, Adriana F. Gabor
Publikováno v:
Transportation Science, 49(4), 721-731. INFORMS Institute for Operations Research and the Management Sciences
In many distribution networks, it is vital that time windows in which deliveries are made are assigned to customers for the long term. However, at the moment of assigning time windows demand is not known. In this paper we introduce the time window as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1faef83341f922555509cb60913fda2c
https://doi.org/10.1287/trsc.2013.0510
https://doi.org/10.1287/trsc.2013.0510