EURO Journal on Transportation and Logistics最新文献_第8页

Bundle selection approaches for collaborative practical-oriented Pickup and Delivery Problems 面向协作实际的取货和交付问题的捆绑选择方法

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2022-01-01 DOI: 10.1016/j.ejtl.2022.100087

Cornelius Rüther, Julia Rieck

{"title":"Bundle selection approaches for collaborative practical-oriented Pickup and Delivery Problems","authors":"Cornelius Rüther, Julia Rieck","doi":"10.1016/j.ejtl.2022.100087","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100087","url":null,"abstract":"<div><p>Due to the increasing price pressure in the less-than-truckload (LTL) market, horizontal cooperation is an effective and efficient way for small- and medium-sized LTL carriers to enhance their profits by exchanging requests. For this purpose, a decentralized auction-based collaboration framework has proven to provide a good approach. In this paper, such a collaboration framework is adopted and extended by applying it to a practical-oriented routing problem, the Pickup and Delivery Problem with Time Windows and Heterogeneous Vehicle Fleets. Particularly, we analyse the bundle selection process made by the auctioneers, which is a stochastic problem and specify which requests are supposed to be offered together in a bundle to the cooperating carriers. For the purpose of solving the selection problem properly, we implement a new procedure required due to the characteristics of the considered routing problem: a scenario-based bundle selection approach. In order to make this approach applicable, two pre-selection techniques (cluster- and neural network-based) are developed. Our approach is evaluated on 240 collaboration network instances created from well-known pickup and delivery research data sets generated by Li and Lim (2001). The collaboration framework results are compared with respect to the profit to individual transportation planning of each carrier (lower threshold) as well as centralized transportation planning of all carriers (upper threshold). It can be shown that the auction-based collaboration approach is up to 43.49% better than the individual planning as well as exhausts at least 53.5% of the centralized transportation planning potential on average.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100087"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000127/pdfft?md5=219891a1a09df27bd5c55b71adba023a&pid=1-s2.0-S2192437622000127-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750385","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}

引用次数: 3

Pedestrian evacuation planning: Unveiling evacuation routes via column generation 行人疏散规划:通过柱生成揭示疏散路线

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2022-01-01 DOI: 10.1016/j.ejtl.2022.100089

Nicolás Cabrera , Jorge A. Huertas , Andrés L. Medaglia

{"title":"Pedestrian evacuation planning: Unveiling evacuation routes via column generation","authors":"Nicolás Cabrera , Jorge A. Huertas , Andrés L. Medaglia","doi":"10.1016/j.ejtl.2022.100089","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100089","url":null,"abstract":"<div><p>Evacuation drills are critical to evaluate emergency preparedness and infrastructure capacity. Before conducting drills, it is necessary to design the evacuation routes that people are likely to follow in a real evacuation. In this paper, we present a path-oriented optimization model for evacuation planning. To solve this model, we propose a column-oriented approach in which a master problem assigns people to evacuation paths, while an auxiliary problem generates feasible evacuation paths. To recreate possible evacuation drills, we embed the column generation method in an optimization-based simulation procedure that mimics the evacuation dynamics and unveils critical evacuation routes that are likely to become congested. To illustrate the applicability of our method, we recreated a real evacuation drill conducted in a university campus. Our results support evacuation planners that often make infrastructure decisions with the goal of enhancing evacuation dynamics with the commendable goal of saving lives.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100089"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000140/pdfft?md5=0c0b68dd3b83b953177defb0deb80716&pid=1-s2.0-S2192437622000140-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750817","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}

引用次数: 0

Introduction to the special issue on integration of human factors and ergonomics “人因与工效学的整合”专题导论

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2022-01-01 DOI: 10.1016/j.ejtl.2022.100098

Nabil Absi, Valeria Borodin, Diego Cattaruzza

引用次数: 0

Scheduling cross-docking operations under uncertainty: A stochastic genetic algorithm based on scenarios tree 不确定条件下的交叉对接调度:基于场景树的随机遗传算法

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2022-01-01 DOI: 10.1016/j.ejtl.2022.100095

Andrea Gallo , Riccardo Accorsi , Renzo Akkerman , Riccardo Manzini

{"title":"Scheduling cross-docking operations under uncertainty: A stochastic genetic algorithm based on scenarios tree","authors":"Andrea Gallo , Riccardo Accorsi , Renzo Akkerman , Riccardo Manzini","doi":"10.1016/j.ejtl.2022.100095","DOIUrl":"10.1016/j.ejtl.2022.100095","url":null,"abstract":"<div><p>A cross-docking terminal enables consolidating and sorting fast-moving products along supply chain networks and reduces warehousing costs and transportation efforts. The target efficiency of such logistic systems results from synchronizing the physical and information flows while scheduling receiving, shipping and handling operations. Within the tight time-windows imposed by fast-moving products (e.g., perishables), a deterministic schedule hardly adheres to real-world environments because of the uncertainty in trucks arrivals. In this paper, a stochastic MILP model formulates the minimization of penalty costs from exceeding the time-windows under uncertain truck arrivals. Penalty costs are affected by products' perishability or the expected customer’ service level. A validating numerical example shows how to solve (1) dock-assignment, (2) while prioritizing the unloading tasks, and (3) loaded trucks departures with a small instance. A tailored stochastic genetic algorithm able to explore the uncertain scenarios tree and optimize cross-docking operations is then introduced to solve scaled up instaces. The proposed genetic algorithm is tested on a real-world problem provided by a national delivery service network managing the truck-to-door assignment, the loading, unloading, and door-to-door handling operations of a fleet of 271 trucks within two working shifts. The obtained solution improves the deterministic schedule reducing the penalty costs of 60%. Such results underline the impact of unpredicted trucks’ delay and enable assessing the savings from increasing the number of doors at the cross-dock.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100095"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000206/pdfft?md5=3e74f4f8fc472c168a441a70a38ee1eb&pid=1-s2.0-S2192437622000206-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123994938","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}

引用次数: 0

How incidents impact congestion on roadways: A queuing network approach 交通事故如何影响道路挤塞:排队网络方法

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2022-01-01 DOI: 10.1016/j.ejtl.2021.100067

Pedro Cesar Lopes Gerum , Melike Baykal-Gürsoy

{"title":"How incidents impact congestion on roadways: A queuing network approach","authors":"Pedro Cesar Lopes Gerum , Melike Baykal-Gürsoy","doi":"10.1016/j.ejtl.2021.100067","DOIUrl":"10.1016/j.ejtl.2021.100067","url":null,"abstract":"<div><p>Motivated by the need for transportation infrastructure and incident management planning, we study traffic density under non-recurrent congestion. This paper provides an analytical solution approximating the stationary distribution of traffic density in roadways where deterioration of service occurs unpredictably. The proposed solution generalizes a queuing model discussed in the literature to long segments that are not space-homogeneous. We compare single and tandem queuing approaches to segments of different lengths and verify whether each model is appropriate. A single-queue approach works sufficiently well in segments with similar traffic behavior across space. In contrast, a tandem-queue approach more appropriately describes the density behavior for long segments with sections having distinct traffic characteristics. These models have a comparable fit to the ones generated using a lognormal distribution. However, they also have interpretable parameters, directly connecting the distribution of congestion to the dynamics of roadway behavior. The proposed models are general, adaptable, and tractable, thus being instrumental in infrastructure and incident management.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100067"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437621000339/pdfft?md5=bf8fb15f364e85dfc18519374bf52450&pid=1-s2.0-S2192437621000339-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128871886","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}

引用次数: 2

Design of a two-echelon last-mile delivery model 最后一英里两梯次配送模式的设计

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2022-01-01 DOI: 10.1016/j.ejtl.2022.100079

Juan C. Pina-Pardo , Matheo Moreno , Miguel Barros , Alexandre Faria , Matthias Winkenbach , Milena Janjevic

{"title":"Design of a two-echelon last-mile delivery model","authors":"Juan C. Pina-Pardo , Matheo Moreno , Miguel Barros , Alexandre Faria , Matthias Winkenbach , Milena Janjevic","doi":"10.1016/j.ejtl.2022.100079","DOIUrl":"10.1016/j.ejtl.2022.100079","url":null,"abstract":"<div><p>Due to high congestion in cities and growing demand for last-mile delivery services, several companies have been implementing two-echelon distribution strategies over the past few years. Notably, the installation of urban transshipment points has gained increasing attention, used by logistics operators to transfer goods from large freight trucks to smaller and more agile vehicles for last-mile delivery. Nevertheless, the main challenge is how to decide the number and location of these facilities under the presence of demand uncertainty. In this paper, we develop a two-stage stochastic program to design two-echelon last-mile delivery networks under demand uncertainty. This approach decomposes the problem into strategic decisions (facility location) and operational decisions (daily distribution of goods). To address large-scale instances, we solve the model through the sample average approximation (SAA) technique and estimate the optimal routing costs (of the SAA counterpart) using a continuous approximation method. Using a real-world case study with more than 1300 customers from New York City, our results provide several managerial insights regarding the mix of transportation modes, facility location, and the impact of allowing the outsourcing of customer demand. We provide extensive validation of the two-stage stochastic program results through a simulation-based approach and the calculation of the value of the stochastic solutions.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100079"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000073/pdfft?md5=9db1ec3f64761169d561fd9a8b1ca2d6&pid=1-s2.0-S2192437622000073-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132547114","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}

引用次数: 5

Coordinating feeder and collector public transit lines for efficient MaaS services 协调支线和集运公共交通线路，提供高效的MaaS服务

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2022-01-01 DOI: 10.1016/j.ejtl.2021.100057

K. Gkiotsalitis

{"title":"Coordinating feeder and collector public transit lines for efficient MaaS services","authors":"K. Gkiotsalitis","doi":"10.1016/j.ejtl.2021.100057","DOIUrl":"https://doi.org/10.1016/j.ejtl.2021.100057","url":null,"abstract":"<div><p>Coordinating the schedules of feeder and collector public transit lines can reduce the passenger travel times. With advances in smart mobility, mobility-as-a-service (MaaS) schemes allow passengers to book a combined ticket for all their trip legs. This detailed information about the origins and destinations of door-to-door trips offers the opportunity to coordinate the schedules of public transport lines to reduce the passenger travel times. In this study, we model the coordination problem of feeder and collector lines by explicitly considering the regularity of the feeder lines and the transfer times of passengers. The coordination problem is modeled as a nonlinear non-convex problem and reformulated to an easy-to-solve convex optimization problem. Because of the travel times uncertainty, we also introduce a stochastic optimization formulation based on the sample average approximation approach. We test the performance of our approach in a case study with feeder and collector lines in Singapore showing an improvement potential of 5%–10% in passenger travel times.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100057"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S219243762100025X/pdfft?md5=b7cc6620e4ff97bfc17b561dd3c183a5&pid=1-s2.0-S219243762100025X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750799","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}

引用次数: 5

Solving vehicle routing problems with stochastic and correlated travel times and makespan objectives 解决具有随机和相关行程时间和完工时间目标的车辆路线问题

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100029

Iurii Bakach , Ann Melissa Campbell , Jan Fabian Ehmke , Timothy L. Urban

引用次数: 6

Vehicle sharing systems: A review and a holistic management framework 车辆共享系统:检讨及整体管理架构

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100033

Selin Ataç , Nikola Obrenović , Michel Bierlaire

引用次数: 21

A new approach for the traveling salesperson problem with hotel selection 旅游销售人员选择酒店问题的新方法

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100062

Augusto Pizano Vieira Beltrão , Luiz Satoru Ochi , José André de Moura Brito , Gustavo Silva Semaan , Nelson Maculan , Augusto César Fadel

{"title":"A new approach for the traveling salesperson problem with hotel selection","authors":"Augusto Pizano Vieira Beltrão , Luiz Satoru Ochi , José André de Moura Brito , Gustavo Silva Semaan , Nelson Maculan , Augusto César Fadel","doi":"10.1016/j.ejtl.2021.100062","DOIUrl":"10.1016/j.ejtl.2021.100062","url":null,"abstract":"<div><p>The Traveling Salesperson Problem with Hotel Selection (TSPHS) corresponds to a variant of the classic Traveling Salesman Problem (TSP) where the salesperson must establish a route in order to visit and attend all customers and return to the point of origin. At the end of each working day, if they had not attended all customers, the salesperson must go to a hotel (and stay there overnight). The objective of TSPHS is to first minimize the number of trips and then to minimize the total time spent. The present work proposes a new heuristic algorithm called BRKGA-LS, that combines characteristics and procedures of well-established metaheuristics and methods of vehicle routing problems. Based on computational experiments, carried out with 131 instances of the literature, the global optimum was achieved in about 90% of the cases where it is known (86 out of 95 instances), and the algorithm was able to improve the results of the literature in 11 of all 36 instances. Additionally, a hypothesis test was performed to validate the results and the good performance of the BRKGA-LS in comparison to other algorithms in the literature. Therefore, the proposed algorithm is a promising alternative for solving the problem addressed.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100062"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437621000297/pdfft?md5=c9d6e1498c7729aed22b3055df250d5f&pid=1-s2.0-S2192437621000297-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116511152","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}

引用次数: 1