Zobrazeno 1 - 10
of 162
pro vyhledávání: '"Stefan Ropke"'
Autor:
Stefan Ropke, Bernardo Martin-Iradi
Publikováno v:
Martin-Iradi, B & Ropke, S 2022, ' A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing ', European Journal of Operational Research, vol. 297, no. 2, pp. 511-531 . https://doi.org/10.1016/j.ejor.2021.04.041
In this study, the periodic train timetabling problem is formulated using a time-space graph formulation that exploits the properties of a symmetric timetable. Three solution methods are proposed and compared where solutions are built by what we defi
Publikováno v:
Wang, Y, Ropke, S, Wen, M & Bergh, S 2022, ' The mobile production vehicle routing problem : Using 3D printing in last mile distribution ', European Journal of Operational Research, vol. 305, no. 3, pp. 1407-1423 . https://doi.org/10.1016/j.ejor.2022.06.038
We study a new variant of the vehicle routing problem, called the Mobile Production Vehicle Routing Problem (MoP-VRP). In this problem, vehicles are equipped with 3D printers, and production takes place on the way to the customer. The objective is to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd04f2b8a4b3ffe7552f9f68b700d1a6
Publikováno v:
Transportation Science, 53(5), 1354-1371. INFORMS Inst.for Operations Res.and the Management Sciences
Dabia, S, Ropke, S & Van Woensel, T 2019, ' Cover inequalities for a vehicle routing problem with time windows and shifts ', Transportation Science, vol. 53, no. 5, pp. 1354-1371 . https://doi.org/10.1287/trsc.2018.0885
Transportation Science, 53(5), 1354-1371. INFORMS Institute for Operations Research and the Management Sciences
Dabia, S, Røpke, S & van Woensel, T 2019, ' Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts ', Transportation Science, vol. 53, no. 5, pp. 1354-1371 . https://doi.org/10.1287/trsc.2018.0885
Dabia, S, Ropke, S & Van Woensel, T 2019, ' Cover inequalities for a vehicle routing problem with time windows and shifts ', Transportation Science, vol. 53, no. 5, pp. 1354-1371 . https://doi.org/10.1287/trsc.2018.0885
Transportation Science, 53(5), 1354-1371. INFORMS Institute for Operations Research and the Management Sciences
Dabia, S, Røpke, S & van Woensel, T 2019, ' Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts ', Transportation Science, vol. 53, no. 5, pp. 1354-1371 . https://doi.org/10.1287/trsc.2018.0885
This paper introduces the vehicle routing problem with time windows and shifts (VRPTWS). At the depot, several shifts with nonoverlapping operating periods are available to load the planned trucks. Each shift has a limited loading capacity. We solve
Publikováno v:
Sacramento, D, Pisinger, D & Røpke, S 2019, ' An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones ', Transportation Research. Part C: Emerging Technologies, vol. 102, pp. 289-315 . https://doi.org/10.1016/j.trc.2019.02.018
Unmanned Aerial Vehicles, commonly known as drones, have attained considerable interest in recent years due to the potential of revolutionizing transport and logistics. Amazon were among the first to introduce the idea of using drones to deliver good
Publikováno v:
Koza, D F, Desaulniers, G & Røpke, S 2020, ' Integrated Liner Shipping Network Design and Scheduling ', Transportation Science, vol. 54, no. 2, pp. 512-533 . https://doi.org/10.1287/trsc.2018.0888
In global liner shipping networks, a large share of transported cargo is transshipped at least once between container vessels, and the total transportation time of these containers depends on how well the corresponding services are synchronized. We p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3a54a1c3ce8781433067e616ab5fac0
https://orbit.dtu.dk/en/publications/f55091d5-0d2d-42b8-acba-efb32e50f764
https://orbit.dtu.dk/en/publications/f55091d5-0d2d-42b8-acba-efb32e50f764
Publikováno v:
Transportation Science. 52:769-787
We introduce a decision support tool for liner shipping companies to optimally determine the sailing speed and needed fleet for a global network. We incorporate cargo routing decisions with tight transit time restrictions on each container such that
Publikováno v:
Wen, M, Larsen, R, Røpke, S, Petersen, H L & Madsen, O B G 2019, ' Centralised horizontal cooperation and profit sharing in a shipping pool ', Journal of the Operational Research Society, vol. 70, no. 5, pp. 737-750 . https://doi.org/10.1080/01605682.2018.1457481
Horizontal cooperation in logistics has attracted an increasing amount of attention in both industry and the research community. The most common form of cooperation in the tramp shipping market is the shipping pool, formed by a fleet of ships from di
Publikováno v:
Journal of Heuristics. 24:783-815
Adaptive large neighborhood search (ALNS) is a useful framework for solving difficult combinatorial optimisation problems. As a metaheuristic, it consists of some components that must be tailored to the specific optimisation problem that is being sol
Publikováno v:
Transportation Research Part B: Methodological: an international journal
Iris, Ç, Christensen, J, Pacino, D & Røpke, S 2018, ' Flexible ship loading problem with transfer vehicle assignment and scheduling ', Transportation Research. Part B: Methodological, vol. 111, pp. 113-134 . https://doi.org/10.1016/j.trb.2018.03.009
Iris, Ç, Christensen, J, Pacino, D & Røpke, S 2018, ' Flexible ship loading problem with transfer vehicle assignment and scheduling ', Transportation Research. Part B: Methodological, vol. 111, pp. 113-134 . https://doi.org/10.1016/j.trb.2018.03.009
This paper presents the flexible containership loading problem for seaport container terminals. The integrated management of loading operations, planning of the transport vehicles to use and their scheduling is what we define as the Flexible Ship Loa
Publikováno v:
Iris, C, Pacino, D & Røpke, S 2017, ' Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem ', Transportation Research. Part E: Logistics and Transportation Review, vol. 105, pp. 123-147 . https://doi.org/10.1016/j.tre.2017.06.013
This paper focuses on the integrated berth allocation and quay crane assignment problem in container terminals. We consider the decrease in the marginal productivity of quay cranes and the increase in handling time due to deviation from the desired p