EURO Journal on Transportation and Logistics最新文献

Although optimization techniques have been successfully applied for a number of airline operations, aircraft recovery remains a challenge for both practitioners and researchers due to its complexity and the usual need of a quick response in practical settings. In this paper, we consider the case of a Brazilian oil and gas company that uses a heterogeneous fleet of helicopters for passenger transportation from a few mainland aerodromes to maritime units. The major difficulties in rescheduling delayed flights are resource limitations and realistic features of the company combined with safety and management practices. The problem consists of determining joint daily flight reschedules for all aerodromes that satisfy operational constraints and recovers all pending flights, while minimizing flight transfers among aerodromes, usage of helicopters and overall flight delays. We propose a mixed integer programming (MIP) model, aiming to appropriately represent the problem, and MIP-based local search and two-phase heuristics to cope with larger realistic problem instances. Computational results obtained with instances collected in the case study show the potential of these approaches to deal with this real-life aircraft recovery problem.

A concept of relevance to spot markets for truck-based freight transportation services is the price of anarchy (PoA), which defines the performance inferiority of decentralized market mechanisms for consummating transactions (vis-à-vis centralized mechanisms). To examine this concept in the context of transportation spot markets, this study uses a combination of behavioral experiments and mathematical optimization. The paper's contributions to the research literature for that context involve (1) addressing the case of freight transportation service providers having service requests information spanning multiple periods; (2) analyzing multiple performance measures; (2) accounting for the performance effects of human behavior; and (3) introducing new behavioral experiments as well as novel and effective analytical procedures to tackle truck-to-load assignment problems. Among the paper's most salient findings is that when performance is measured as the market participants' financial outcome, human behavior in buyer-seller interactions could result in a doubling of the PoA.

With the current advances in aircraft design and Lithium-Ion batteries, electric aircraft are expected to serve as a replacement for conventional, short-range aircraft. This paper addresses the main operational challenges for short-range flights operated with electric aircraft: determining the investment needs for a fleet of electric aircraft, and the logistics of charging stations and swap batteries required to support these flights. A mixed-integer linear program with two phases is proposed. In the first phase, a schedule for flight and battery recharge is developed for a fleet of electric aircraft. In the second phase, optimal times for battery charging are determined, together with an optimal sizing of the number of charging stations and swap batteries. We illustrate our model for short-range flights to and from an European airport and for an electric aircraft designed based on the operational characteristics of a conventional, narrow-body aircraft.

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.

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.

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.

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.

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.

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.