Planning of Container Crossdocking for an Express Shipment Service Network

In air transportation, container crossdocking refers to a loaded container that is transferred at an airport from an incoming flight to an outgoing flight without handling the freight on the container. It reduces handling time and handling cost relative to unloading the container and sorting the freight, and is an economical alternative if a sufficient … Read more

A new family of route formulations for split delivery vehicle routing problems

We propose a new family of formulations with route-based variables for the split delivery vehicle routing problem with and without time windows. Each formulation in this family is characterized by the maximum number of different demand quantities that can be delivered to a customer during a vehicle visit. As opposed to previous formulations in the … Read more

Optimal Reconfiguration with Variant Transmission Times on Network

Contraflow means lane reversals on networks. In lane reversal reconfiguration, the capacity of arc increases by reorienting arcs towards demand nodes, which maximizes the flow value and reduces the travel time. In this work, we survey the existing pieces of literature on single and multi-commodity contraflow problems with symmetric and asymmetric travel times on parallel … Read more

An Exact Approach for Solving Pickup-and-Delivery Traveling Salesman Problems with Neighborhoods

This paper studies a variant of the traveling salesman problem called the pickup-and-delivery traveling salesman problem with neighborhoods that combines traditional pickup and delivery requirements with the flexibility of visiting the customers at locations within compact neighborhoods of arbitrary shape. We derive two optimality conditions for the problem, a local condition that verifies whether a … Read more

Distributionally Robust Chance Constrained $p$-Hub Center Problem

The $p$-hub center problem is a fundamental model for the strategic design of hub location. It aims at constructing $p$ fully interconnected hubs and links from nodes to hubs so that the longest path between any two nodes is minimized. Existing literature on the $p$-hub center problem under uncertainty often assumes a joint distribution of … Read more

Courier satisfaction in rapid delivery systems using dynamic operating regions

Rapid delivery systems where an order is delivered to a customer from a local distribution point within minutes or hours have experienced rapid growth recently and often rely on gig economy couriers. The prime example is a meal delivery system. During an operating day, couriers in such a system are used to deliver orders placed … Read more

Exact Solutions to a Carsharing Pricing and Relocation Problem under Uncertainty

In this article we study the problem of jointly deciding carsharing prices and vehicle relocations. We consider carsharing services operating in the context of multi-modal urban transportation systems. Pricing decisions take into account the availability of alternative transport modes, and customer preferences with respect to these. In order to account for the inherent uncertainty in … Read more

An efficient solution methodology for the airport slot allocation problem with preprocessing and column generation

Airport coordination is a demand control mechanism that maximizes the use of existing infrastructure at congested airports. Aircraft operators submit a list of regular flights that they wish to operate over a five to seven-month period and a designated coordinator is responsible for allocating the available airport slots, which represent the permission to operate a … Read more

Efficient Formulations for Multiple Allocation Hub Network Interdiction Problems

In this paper, we study a network interdiction problem on a multiple allocation, uncapacitated hub network. The problem is formulated as a bilevel Stackelberg game between an attacker and a defender, where the attacker identifies r out of p hubs to interdict so as to maximize the worst-case post-interdiction performance of the system with the … Read more

A Novel Model for Transfer Synchronization in Transit Networks and a Lagrangian-based Heuristic Solution Method

To realize the benefits of network connectivity in transfer-based transit networks, it is critical to minimize transfer disutility for passengers by synchronizing timetables of intersecting routes. We propose a mixed-integer linear programming timetable synchronization model that incorporates new features, such as dwell time determination and vehicle capacity limit consideration, which have been largely overlooked in … Read more