EURO Journal on Transportation and Logistics最新文献

{"title":"Integrating weather impact in air traffic controller shift scheduling in remote and conventional towers","authors":"Eulalia Hernández-Romero ,&nbsp;Billy Josefsson ,&nbsp;Anastasia Lemetti ,&nbsp;Tatiana Polishchuk ,&nbsp;Christiane Schmidt","doi":"10.1016/j.ejtl.2022.100076","DOIUrl":"10.1016/j.ejtl.2022.100076","url":null,"abstract":"<div><p>Weather affects the work of air traffic controllers, however, for staff scheduling in Remote Tower Centers (RTCs) it has not been taken into account. We study the impact of various weather phenomena on air traffic controller (ATCO) taskload through structured interviews with ATCOs. We deduce taskload-driven impact factors and the corresponding thresholds for the intensity of the weather phenomena at several Swedish airports. To account for the uncertainty in the weather prediction, we obtain probabilistic weather data from Ensemble Prediction Systems (EPSs). Then we adjust our prior Mixed Integer Programming (MIP) model for RTC staff scheduling to account for uncertain impactful weather occurrences and yield a distribution for the necessary number of ATCOs for RTC staff scheduling. Our framework can be used for conventional towers as well.</p><p>We quantify the impact of weather by comparing the number of controllers necessary to operate at five Swedish airports from a remote tower during two example days in 2020, with and without taking weather events into account. In our calculations we use historical weather and flight data to show that ignoring weather impact may lead to significant understaffing at a RTC.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100076"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S219243762200005X/pdfft?md5=385176c287a3ec2e383a0c73ff130e99&pid=1-s2.0-S219243762200005X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132768239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Truck driver scheduling with interdependent routes and working time constraints","authors":"Carlo S. Sartori,&nbsp;Pieter Smet,&nbsp;Greet Vanden Berghe","doi":"10.1016/j.ejtl.2022.100092","DOIUrl":"10.1016/j.ejtl.2022.100092","url":null,"abstract":"<div><p>In transportation and logistic applications, scheduling hours of service for multiple, interdependent truck drivers to ensure compliance with regulatory resting requirements and service time windows is an extremely challenging task. Models previously designed to schedule truck drivers with interdependent routes have been capable of capturing such scenarios. However, until now, there has been no efficient way to schedule drivers when facing multiple types of interdependency constraints. To overcome this challenge, we introduce properties of truck driver schedules under working time constraints for single-day journeys. A two-stage algorithm exploits these properties to quickly produce schedules for a large number of truck routes. The algorithm minimizes the latest completion time of multiple truck schedules while ensuring that all drivers can complete their route with sufficient recovery periods and within their working hours. Computational experiments demonstrate the superiority of the approach compared to both existing algorithms and a mathematical programming approach.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100092"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000176/pdfft?md5=0d262dcb40a7b46b665533d646aa451c&pid=1-s2.0-S2192437622000176-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133412455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features","authors":"Giorgio Gnecco ,&nbsp;Yuval Hadas ,&nbsp;Marcello Sanguineti","doi":"10.1016/j.ejtl.2022.100090","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100090","url":null,"abstract":"<div><p>A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value – a solution concept in cooperative game theory – is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100090"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Introduction to the special issue on Advances in Facility Location and Logistics","authors":"Isabel Correia,&nbsp;Teresa Melo,&nbsp;Olivier Péton","doi":"10.1016/j.ejtl.2022.100093","DOIUrl":"10.1016/j.ejtl.2022.100093","url":null,"abstract":"","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100093"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000188/pdfft?md5=fedf698b7f26d32907f2b76aa7d700c8&pid=1-s2.0-S2192437622000188-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130656969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Integrated optimization of sequential processes: General analysis and application to public transport","authors":"Philine Schiewe ,&nbsp;Anita Schöbel","doi":"10.1016/j.ejtl.2022.100073","DOIUrl":"10.1016/j.ejtl.2022.100073","url":null,"abstract":"<div><p>Planning in public transportation is traditionally done in a sequential process: After the network design process, the lines and their frequencies are planned. When these are fixed, a timetable is determined and based on the timetable, the vehicle and crew schedules are optimized. After each step, passenger routes are adapted to model the behavior of the passengers as realistically as possible. It has been mentioned in many publications that such a sequential process is sub-optimal, and integrated approaches, mainly heuristics, are under consideration. Sequential planning is not only common in public transportation planning but also in many other applied problems, among others in supply chain management, or in organizing hospitals efficiently.</p><p>The contribution of this paper hence is two-fold: on the one hand, we develop an integrated integer programming formulation for the three planning stages line planning, (periodic) timetabling, and vehicle scheduling which also includes the integrated optimization of the passenger routes. This gives us an exact formulation rewriting the sequential approach as an integrated problem. We discuss properties of the integrated formulation and apply it experimentally to data sets from the <span>LinTim</span> library. On small examples, we get an exact optimal objective function value for the integrated formulation which can be compared with the outcome of the sequential process.</p><p>On the other hand, we propose a mathematical formulation for general sequential processes which can be used to build integrated formulations. For comparing sequential processes with their integrated counterparts we analyze the <em>price of sequentiality</em>, i.e., the ratio between the solution obtained by the sequential process and an integrated solution. We also experiment with different possibilities for partial integration of a subset of the sequential problems and again illustrate our results using the case of public transportation. The obtained results may be useful for other sequential processes.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100073"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000024/pdfft?md5=c82aaf734647a5a861d594049ee30c82&pid=1-s2.0-S2192437622000024-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126289125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Formulating multi-class user equilibrium using mixed-integer linear programming","authors":"Xiao Lin ,&nbsp;Ludovic Leclercq ,&nbsp;Lóránt Tavasszy ,&nbsp;Hans van Lint","doi":"10.1016/j.ejtl.2022.100097","DOIUrl":"10.1016/j.ejtl.2022.100097","url":null,"abstract":"<div><p>We introduce an approach to formulate and solve the multi-class user equilibrium traffic assignment as a mixed-integer linear programming (MILP) problem. Compared to simulation approaches, the analytical MILP formulation makes the solution of network assignment problems more tractable. When applied in a multi-class context, it obviates the need to assume a symmetrical influence between classes and thereby allows richer traffic behavior to be taken into account. Also, it integrates naturally in optimization problems such as maintenance planning and traffic management. We develop the model and apply it for the Sioux Falls network, showing that it outperforms the traditional Beckmann-based and MSA approaches in smaller-scale problems. Further research opportunities lie in developing extensions of MILP-based assignment, with different variants of user equilibrium or dynamic assignment, and in improving the model and solution algorithms to allow large-scale application.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100097"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S219243762200022X/pdfft?md5=43a9871032da36374820fc98c5ee382c&pid=1-s2.0-S219243762200022X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128685876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A topological approach for identifying pricing controller locations to ensure controllability of transportation networks","authors":"Xavier Mazur ,&nbsp;Marco Rinaldi ,&nbsp;Richard D. Connors ,&nbsp;Francesco Viti","doi":"10.1016/j.ejtl.2022.100078","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100078","url":null,"abstract":"<div><p>To use efficiently the infrastructure of transportation networks, control strategies have been developed with the aim to reduce negative externalities, such as congestion and pollutant emissions. Previous works demonstrated that the maximum performance achievable by traffic control policies depends on the number and location of controllers employed, which implies the need to determine a set of controllers capable of fully controlling the underlying transportation network. Various approaches have been explored in the literature to locate controllers on networks, however a gap remains in terms of scalability as the methods proposed often exhibit heavy computational complexity. In this paper we aim to propose an approach capable of locating pricing controllers on transportation networks that is scalable, such that it can be applied on large instances, such as city-sized or regional networks. For this purpose, we propose a topology-based approach, adapted from the sensor location problem, as both problems share similar characteristics. We validate our proposed approach by analyzing the performance of controller sets produced on a wide range of artificially generated network ensembles. The analysis we provide reveals that the method proposed, while being easily applicable on large instances, is capable to locate an efficient controller set, and to redirect flows on the network so as to reduce the total time spent by road users.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100078"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000061/pdfft?md5=6eb81aa2e633f03d4a2cdb26a1dc8d5e&pid=1-s2.0-S2192437622000061-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A branch-and-price algorithm for a team orienteering problem with fixed-wing drones","authors":"Kaarthik Sundar ,&nbsp;Sujeevraja Sanjeevi,&nbsp;Christopher Montez","doi":"10.1016/j.ejtl.2021.100070","DOIUrl":"https://doi.org/10.1016/j.ejtl.2021.100070","url":null,"abstract":"<div><p>This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them, thereby preventing them to make on-the-spot turns and restricting them to a minimum turn radius. This paper presents the implications of these constraints on the drone routing problem formulation and proposes a systematic technique to address them in the context of the team orienteering problem. Furthermore, a novel branch-and-price algorithm with branching techniques specific to the constraints imposed due to fixed-wing drones are proposed. Extensive computational experiments on benchmark instances corroborating the effectiveness of the algorithms are also presented.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100070"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437621000352/pdfft?md5=f8cc52f6de1431e6cad4b32226c99ad7&pid=1-s2.0-S2192437621000352-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750801","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Ring hierarchical hub network design problem: Exact and heuristic solution methods","authors":"Alireza Eydi ,&nbsp;Amir Khaleghi ,&nbsp;Khaled Barzegar","doi":"10.1016/j.ejtl.2022.100096","DOIUrl":"10.1016/j.ejtl.2022.100096","url":null,"abstract":"<div><p>In this paper, we study the hierarchical hub network design problem with a ring-star-star structure. In this problem, the hubs are located in two layers. In the first layer, central hubs (main hubs) are located in a ring structure, and in the second layer, secondary hubs are located. Each secondary hub is allocated to a central hub. Other demand points can also be allocated to each of these hubs (central hubs or secondary hubs). The objective is to minimize transportation costs on the network. This problem applies to communication networks when establishing direct links between demand nodes is not cost-effective, and there are two levels of service for customers. Also, the ring structure is used to reduce costs associated with full communication between central hubs. We present a mixed-integer programming model for the problem and report the results of the problem solving for a numerical example on the CAB dataset. Also, we present three solution methods for the problem. First, by exploiting the decomposable structure of the proposed model, we introduce an accelerated Benders decomposition algorithm. Then, we present a hybrid genetic algorithm that uses the Dijkstra algorithm to evaluate solutions. Next, we present a hybrid variable neighborhood search algorithm that uses the Dijkstra algorithm to calculate the cost of each solution. Also, a relax-and-fix algorithm is proposed to find near-optimal feasible solutions for the problem. Computational results are presented on the USA423 dataset. The results show that the proposed relax-and-fix algorithm can solve instances with up to 100 nodes. Also, the proposed hybrid algorithms can solve instances with up to 423 nodes. The performance of the proposed hybrid variable neighborhood search is better than the proposed hybrid genetic algorithm in solving large-sized instances.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100096"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000218/pdfft?md5=2b394226a408a658bd462d6743c79ffb&pid=1-s2.0-S2192437622000218-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121099779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty","authors":"Jaehyeon Ryu ,&nbsp;Sungsoo Park","doi":"10.1016/j.ejtl.2021.100069","DOIUrl":"10.1016/j.ejtl.2021.100069","url":null,"abstract":"<div><p>We consider the robust single-source capacitated facility location problem with uncertainty in customer demands. A cardinality-constrained uncertainty set is assumed for the robust problem. To solve it efficiently, we propose an allocation-based formulation derived by Dantzig–Wolfe decomposition and a branch-and-price algorithm. The computational experiments show that our branch-and-price algorithm outperforms CPLEX in many cases, which solves the ordinary robust reformulation. We also examine the trade-off relationship between the empirical probability of infeasibility and the additional costs incurred and observe that the robustness of solutions can be improved significantly with small additional costs.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100069"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437621000340/pdfft?md5=973c919a5b186604228adc11c47ebfd9&pid=1-s2.0-S2192437621000340-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123253344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}