EURO Journal on Transportation and Logistics最新文献

{"title":"The benefit of complete trip information in free-floating carsharing systems","authors":"Claudia Archetti ,&nbsp;Maurizio Bruglieri ,&nbsp;Gianfranco Guastaroba ,&nbsp;M. Grazia Speranza","doi":"10.1016/j.ejtl.2023.100110","DOIUrl":"https://doi.org/10.1016/j.ejtl.2023.100110","url":null,"abstract":"<div><p>Free-floating and instant-access carsharing systems are two features of the most flexible carsharing systems. In the former, users are allowed to freely park the car in any legal parking spot within the boundaries defined by the service operator. In the latter, users are not requested to make any reservation in advance before picking up the car. This paper aims at evaluating the importance of complete trip information in free-floating instant-access carsharing systems. To this aim, we consider a system, referred to as the look-ahead system, where users can reserve a car in advance and are also allowed to directly pick up a car without any reservation. In both cases, the user is requested to specify complete trip details, including the estimated usage duration and the location where the car will be returned. Taking advantage of a complete knowledge of the trip details, the service operator can assign a reservation request to a car that is in use at the time of reservation, provided it will become available at the time and location the user will need it. In its nature, the operational setting we consider is dynamic, as trip information is revealed to the service operator at the time the user requests a car. We also investigate the possibility of suggesting to the user that makes a reservation a pickup location different from the desired one, provided it is not too distant from the latter. We compare the performance of the look-ahead system with the case no information is anticipated, which resembles the service provided by the main carsharing operators currently active in Milan (Italy). Additionally, we use, as a benchmark, the static case where all the information about the users requests (pickup and return locations, as well as delivery time) is known before the start of the planning horizon. We consider a system with no car relocations performed by ad-hoc operators. This enables us to measure the pure benefit of anticipated information, i.e., the benefit coming only from knowing in advance where and when the vehicles will be returned, purged from potential vehicles availability related to relocation operations. The matching between user requests and cars is obtained, for the look-ahead system, iteratively at fixed time intervals through the solution of a Binary Linear Program (BLP) and, for the benchmark case, through the solution of a single BLP. No optimization model is needed for the case where no information is anticipated. A simulation study, based on real-world data from the city of Milan, shows that the look-ahead system can satisfy a number of requests much greater than the case without anticipated information and close to the benchmark case. Moreover, we perform a sensitivity analysis on different parameters, including the maximum distance a user is available to walk and the minimum amount of anticipation requested to users for booking requests, showing their impact on the performance of the systems.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49766320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Solving the Traveling Salesman Problem with release dates via branch and cut","authors":"Agustín Montero ,&nbsp;Isabel Méndez-Díaz ,&nbsp;Juan José Miranda-Bront","doi":"10.1016/j.ejtl.2023.100121","DOIUrl":"https://doi.org/10.1016/j.ejtl.2023.100121","url":null,"abstract":"<div><p>In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time at which each requested good arrives is called <em>release date</em> and it is known in advance. The vehicle can perform multiple routes, however, it cannot depart to serve a customer before the associated release date. Thus, the release date of the customers in each route must not be greater than the starting time of the route. The objective is to determine a set of routes for the vehicle, starting and ending at the depot, where the completion time needed to serve all customers is minimized. We propose a new Integer Linear Programming model and develop a branch and cut algorithm with tailored enhancements to improve its performance. The algorithm proved to be able to significantly reduce the computation times when compared to a compact formulation tackled using a commercial mathematical programming solver, obtaining 24 new optimal solutions on benchmark instances with up to 30 customers within one hour. We further extend the benchmark to instances with up to 50 customers where the algorithm proved to be efficient. Building upon these results, the proposed model is adapted to new TSP-rd variants (Capacitated and Prize-Collecting TSP), with different objectives: completion time minimization and traveling distance minimization. To the best of our knowledge, our work is the first in-depth study to report extensive results for the TSP-rd through a branch and cut, establishing a baseline and providing insights for future approaches. Overall, the approach proved to be very effective and gives a flexible framework for several variants, opening the discussion about formulations, algorithms and new benchmark instances.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437623000183/pdfft?md5=94c46b35a7aa04ddfe0a25abf9715b0f&pid=1-s2.0-S2192437623000183-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138471862","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":"Statistical-machine-learning-based intelligent relaxation for set-covering location models to identify locations of charging stations for electric vehicles","authors":"Selcen Gülsüm Aslan Özşahin ,&nbsp;Babek Erdebilli","doi":"10.1016/j.ejtl.2023.100118","DOIUrl":"10.1016/j.ejtl.2023.100118","url":null,"abstract":"<div><p>Europe strengthens its policies on climate change, green transition, and sustainable energy by addressing the high greenhouse-gas emissions in the transportation sector. Europe aims to reduce such emissions and reach a state of carbon neutrality by 2030 and 2050, respectively. This is feasible only if electric vehicles dominate the transportation sector. Paving the way for electric vehicle deployment on roads is subject to the provision of electric-vehicle-charging stations on the roads such that sufficiently good driving experience without any obstacles can be achieved. To address this timely societal challenge, we proposed a novel methodology by using the well-known facility-location-allocation methodology named set-covering location models with statistical machine learning and developed it for the problem settings of identifying electric-vehicle-charging station locations. Statistical machine learning was employed in the proposed model to more precisely identify and determine feasible coverage sets. We demonstrated the efficiency of the proposed model for the Capital Region of Denmark, where the green transition is part of the political agenda and is of severe societal concern, by using the newly collected main road transportation dataset.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44780009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The warehouse reshuffling problem with swap moves and time limit","authors":"Jan-Niklas Buckow,&nbsp;Sigrid Knust","doi":"10.1016/j.ejtl.2023.100113","DOIUrl":"10.1016/j.ejtl.2023.100113","url":null,"abstract":"<div><p>In this paper, we study the warehouse reshuffling problem, where pallets in a storage have to be rearranged in an efficient way. A high-bay warehouse with an automated storage and retrieval system is considered, which is equipped with a twin shuttle stacker crane. This twin shuttle is designed to perform swap moves, where the pallet at a storage location is swapped with the pallet currently loaded on the stacker crane. We study a new problem variant, where the time for reshuffling is limited, and the desired assignment of pallets to storage locations is not given as input. The objective is to store the frequently accessed pallets closely to the input/output-point to keep the warehouse operations efficient. After proposing necessary and sufficient optimality conditions for assignments of pallets to storage locations, we present algorithms to deal with the time limit. Moreover, we prove NP-hardness of two special cases, introduce lower bound procedures, several construction heuristics and a simulated annealing algorithm. Finally, we present computational results on randomly generated instances based on a real-world company setting.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43908858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Data-driven optimization for transport and logistics systems","authors":"Shadi Sharif Azadeh,&nbsp;Nursen Aydin","doi":"10.1016/j.ejtl.2023.100119","DOIUrl":"10.1016/j.ejtl.2023.100119","url":null,"abstract":"","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S219243762300016X/pdfft?md5=d7dc98788dfa41d984157c6fecd1aba7&pid=1-s2.0-S219243762300016X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135388286","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":"Combining value function approximation and multiple scenario approach for the effective management of ride-hailing services","authors":"R.-Julius O. Heitmann ,&nbsp;Ninja Soeffker ,&nbsp;Marlin W. Ulmer ,&nbsp;Dirk C. Mattfeld","doi":"10.1016/j.ejtl.2023.100104","DOIUrl":"10.1016/j.ejtl.2023.100104","url":null,"abstract":"<div><p>The availability of various services for individual mobility is increasing, especially in urban areas. Dynamic ride-hailing services address these aspects and are gaining market share with providers such as MOIA, UberX Share, Sprinti or BerlKönig. To be able to offer competitive pricing for such a service and at the same time provide a high service quality (e.g. fast response times), effective capacity management is needed. In order to reach this goal, two challenges have to be met by the service provider. On the one hand, a proper demand control has to be installed, which optimizes the responses to transportation requests from customers. On the other hand, suitable fleet control needs to be set in place to optimize the route of the fleet so that the demand can be met. Papers in the literature do solve both but typically focus on one of these two challenges. As an example, value function approximation (VFA) can be used to learn a service offering decision while anticipating future incoming requests. A typical example of a routing-focused method is the multiple scenario approach (MSA) creating a routing which anticipates future requests using a sampling method. In this paper, we combine VFA and MSA to address the two challenges in an effective way. The resulting method is called anticipatory-routing-and-service-offering (ARS). We find that the combined method significantly outperforms the individual components, improving not only the total reward but also the accepted requests. It is found that this performance is particularly high with a heavy workload and thus resources are relatively scarce. We analyse how and under which conditions the components together or individually are particularly important.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44606842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Clustering and routing in waste management: A two-stage optimisation approach","authors":"Massimiliano Caramia ,&nbsp;Diego Maria Pinto ,&nbsp;Emanuele Pizzari ,&nbsp;Giuseppe Stecca","doi":"10.1016/j.ejtl.2023.100114","DOIUrl":"10.1016/j.ejtl.2023.100114","url":null,"abstract":"<div><p>This paper proposes a two-stage model to tackle a problem arising in Waste Management. The decision-maker (a regional authority) is interested in locating sorting facilities in a regional area and defining the corresponding capacities. The decision-maker is aware that waste will be collected and brought to the installed facilities by independent private companies. Therefore, the authority wants to foresee the behaviour of these companies in order to avoid shortsighted decisions. In the first stage, the regional authority divides the clients into clusters, further assigning facilities to these clusters. In the second stage, an effective route is defined to serve client pickup demand. The main idea behind the model is that the authority aims to find the best location–allocation solution by clustering clients and assigning facilities to these clusters without generating overlaps. In doing so, the authority tries to (i) assign the demand of clients to the facilities by considering a safety stock within their capacities to avoid shortages during the operational phase, (ii) minimise Greenhouse Gases emissions, (iii) be as compliant as possible with the solution found by the second stage problem, the latter aiming at optimising vehicle tour lengths. After properly modelling the problem, we propose a matheuristic solution algorithm and conduct extensive computational analysis on a real-case scenario of an Italian region. Validation of the approach is achieved with promising results.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46235824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improving search for gasoline during a hurricane evacuation event using social media","authors":"Abhinav Khare ,&nbsp;Rajan Batta ,&nbsp;Qing He","doi":"10.1016/j.ejtl.2023.100111","DOIUrl":"https://doi.org/10.1016/j.ejtl.2023.100111","url":null,"abstract":"<div><p>Panic-buying and shortages of essential commodities is common during early phases of a disaster or an epidemic. The goal of this paper is develop a methodology which includes social media information in optimization models of searching essential commodities during disasters and improves the efficiency of search. Specific contributions in the data processing of social media posts include the development of an event localizer that probabilistically infers the location and time of shortage of commodity based on social media information. Contributions in the mathematical model development include an integer programming formulation of the resultant search problem on a graph, with the two objective different objective functions: (a) Maximizing probability of finding the commodity (b) Minimizing expected time to find the commodity given the commodity is found. The methodology is validated using a case study on gasoline search during the Hurricane Irma evacuations. We found that social media posts can predict shortage at gas station for four major cities of Florida accurately with a MAPE of 12%. We also found that addition of social media information to the search process improved the average search time by 41.74%.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49766343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The data-driven time-dependent orienteering problem with soft time windows","authors":"Edison Avraham,&nbsp;Tal Raviv","doi":"10.1016/j.ejtl.2023.100112","DOIUrl":"https://doi.org/10.1016/j.ejtl.2023.100112","url":null,"abstract":"<div><p>In this paper, we study an extension of the orienteering problem where travel times are random and time-dependent and service times are random. Additionally, the service at each selected customer is subject to a soft time window; that is, violation of the window is allowed but subject to a penalty that increases in the delay. A solution is a tour determined before the vehicle departs from the depot. The objective is to maximize the sum of the collected prizes net of the expected penalty. The randomness of the travel and service times is modeled by a set of scenarios based on historical data that can be collected from public geographical information services. We present an exact solution method for the problem based on a branch-and-bound algorithm enhanced by a local search procedure at the nodes. A numerical experiment demonstrates the merits of the proposed solution approach. This study is the first to consider an orienteering problem with stochastic travel times and soft time windows, which are more relevant than hard time windows in stochastic settings.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49766344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Transshipment network design for express air cargo operations in China","authors":"Barış Yıldız ,&nbsp;Martin Savelsbergh ,&nbsp;Ali K. Dogru","doi":"10.1016/j.ejtl.2023.100120","DOIUrl":"https://doi.org/10.1016/j.ejtl.2023.100120","url":null,"abstract":"<div><p>We introduce a novel multimodal (ground and air transportation) network design model with transshipments for the transport of express cargo with heterogeneous service classes (i.e., next morning delivery, and next day delivery). We formulate this problem using a novel path-based mixed-integer program which seeks to maximize the demand (weight) served. We investigate the value of the proposed transshipment network under various operational conditions and by benchmarking against a direct shipment network and a network with a single transshipment point which mimics a classical star-shaped hub-and-spoke network. Our extensive computational study with real-world data from ShunFeng (SF) Express reveals that the integration of ground and air transportation improves the coverage and that transshipment enables serving a large number of origin–destination pairs with a small number of cargo planes. Importantly, we show that by simplifying handling, i.e., employing cross-docking rather than time-consuming sortation, a transshipment network can transport express cargo fast enough to meet demanding delivery deadlines. Finally, we find that increasing the efficiency of intra-city operations and extending the nightly operating time window are the most effective operational adjustments for further improving the performance of the proposed transshipment network.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437623000171/pdfft?md5=94a2142b6148f417ecf0bc3e857918df&pid=1-s2.0-S2192437623000171-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134656687","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}