Metaheuristic, Models and Software for the Heterogeneous Fleet Pickup and Delivery Problem with Split Loads

This paper addresses a rich variant of the vehicle routing problem (VRP) that involves pickup and delivery activities, customer time windows, heterogeneous fleet, multiple products and the possibility of splitting a customer demand among several routes. This variant generalizes traditional VRP variants by incorporating features that are commonly found in practice. We present two mixed-integer … Read more

Hub Network Design Problem with Capacity, Congestion and Stochastic Demand Considerations

We introduce the hub network design problem with congestion, capacity, and stochastic demand considerations (HNDC), which generalizes the classical hub location problem in several directions. In particular, we extend state-of-the-art by integrating capacity acquisition decision and congestion cost effect into the problem and allowing dynamic routing for origin-destination pairs. Connecting strategic and operational level decisions, … Read more

Incremental Network Design with Multi-commodity Flows

We introduce a novel incremental network design problem motivated by the expansion of hub capacities in package express service networks: the \textit{incremental network design problem with multi-commodity flows}. We are given an initial and a target service network design, defined by a set of nodes, arcs, and origin-destination demands (commodities), and we seek to find … Read more

Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach

We study a delivery strategy for last-mile deliveries in urban areas which combines freight transportation with mass mobility systems with the goal of creating synergies contrasting negative externalities caused by transportation. The idea is to use the residual capacity on public transport means for moving freights within the city. In particular, the system is such … Read more

Lead-Time-Constrained Middle-Mile Consolidation Network Design with Fixed Origins and Destinations

Many large e-commerce retailers move sufficient freight volumes to operate private middle-mile consolidation networks for order fulfillment, transporting customer shipments from stocking locations to last-mile delivery partners in consolidated loads to reduce freight costs. We study a middle-mile network design optimization problem with fixed origins and destinations to build load consolidation plans that minimize cost … Read more

An integrated vertiport placement model considering vehicle sizing and queuing

The increasing levels of congestion and infrastructure costs in cities have created a need for more intelligent transport systems. Urban Air Mobility (UAM) offers a solution by introducing intra-urban aerial transport to overcome the existing congested infrastructure. The performance of UAM systems are highly dependent on vertiport locations, vehicle sizing and infrastructure specifications. This study … Read more

Optimisation of Step-free access Infrastructure in London Underground considering Borough Economic Inequality

Public transport is the enabler of social and economic development, as it allows the movement of people and provides access to opportunities that otherwise might have been unattainable. Access to public transport is a key aspect of social equity, with step-free access improving the inclusivity of the transport network in particular for mobility impaired population … Read more

Demand modelling and optimal vertiport placement for airport-purposed eVTOL services

Recent technological advances have only recently made Urban Air Mobility feasible as a realistic alternative to existing transport modes. Despite the growing interest, this disruptive service requires accurate strategic investments to ensure its viability in the short- and long-term. While airports have been identified as potential sites for vertiports, extending operations to the urban rest … Read more

Approximate Dynamic Programming for Crowd-shipping with In-store Customers

Crowd-shipping has gained significant attention as a last-mile delivery option over the recent years. In this study, we propose a variant of dynamic crowd-shipping model with in-store customers as crowd-shippers to deliver online orders within few hours. We formulate the problem as a Markov decision process and develop an approximate dynamic programming (ADP) policy using … Read more

A decomposition approach for integrated locomotive scheduling and driver rostering in rail freight transport

In this work, we consider the integrated problem of locomotive scheduling and driver rostering in rail freight companies. Our aim is to compute an optimal simultaneous assignment of locomotives and drivers to the trains listed in a given order book. Mathematically, this leads to the combination of a set-packing problem with compatibility constraints and a … Read more