Solving Unsplittable Network Flow Problems with Decision Diagrams

In unsplittable network flow problems, certain nodes must satisfy a combinatorial requirement that the incoming arc flows cannot be split or merged when routed through outgoing arcs. This so-called “no-split no-merge” requirement arises in unit train scheduling where train consists should remain intact at stations that lack necessary equipment and manpower to attach/detach them. Solving … Read more

Branch-and-price for clash-free periodic supply vessel planning problem with split delivery and variable service time

Efficient scheduling and routing of vessels are crucial in the oil and gas industries. In this paper, we consider a periodic supply vessel planning problem in which the weekly demands at multiple offshore facilities are satisfied with a fleet of heterogeneous vessels. Preemptive service at the base, variable service at facilities, and split delivery are … Read more

Scalable Timing-Aware Network Design via Lagrangian Decomposition

This paper addresses instances of the temporal fixed-charge multi-commodity flow (tfMCF) problem that arise in a very large scale dynamic transportation application. We model the tfMCF as a discrete-time Resource Task Network (RTN) with cyclic schedule, and formulate it as a mixed-integer program. These problems are notoriously hard to solve due to their time-expanded nature, … Read more

Incorporating Holding Costs in Continuous-TimeService Network Design: New Model, Relaxation, and Exact Algorithm

The continuous-time service network design problem (CTSNDP) occurs widely in practice. It aims to minimize the total operational cost by optimizing the schedules of transportation services and the routes of shipments for dispatching, which can occur at any time point along a continuous planning horizon. In order to be cost effective, shipments often wait to … Read more

Integrated Pricing and Routing on a Network

We consider an integrated pricing and routing problem on a network. The problem is motivated by applications in freight transportation such as package delivery and less-than-truckload shipping services. The decision maker sets a price for each origin-destination pair of the network, which determines the demand flow that needs to be served. The flows are then … Read more

Mixed Integer Programming models for planning maintenance at offshore wind farms under uncertainty

We introduce the Stochastic Maintenance Fleet Transportation Problem for Offshore wind farms (SMFTPO), in which a maintenance provider determines an optimal, medium-term planning for maintaining multiple wind farms while controlling for uncertainty in the maintenance tasks and weather conditions. Since the maintenance provider is typically not the owner of a wind farm, it needs to … Read more

A mean-risk MINLP for transportation network protection

This paper focuses on transportation network protection to hedge against extreme events such as earthquakes. Traditional two-stage stochastic programming has been widely adopted to obtain solutions under a risk-neutral preference through the use of expectations in the recourse function. In reality, decision makers hold different risk preferences. We develop a mean-risk two-stage stochastic programming model … Read more

The Value of Flexibility in Robust Location-Transportation Problems

This article studies a multi-period capacitated fixed-charge location-transportation problem in which, while the location and capacity of each facility need to be determined immediately, the determination of final production and distribution of products can be delayed until actual orders are received in each period. In contexts where little is known about future demand, robust optimization, … Read more

Choice Based Revenue Management for Parallel Flights

This paper describes a revenue management project with a major airline that operates in a fiercely competitive market involving two major hubs and having more than 30 parallel daily flights. The market has a number of unusual characteristics including (1) almost half of customers choose not to purchase the tickets after booking; (2) about half … Read more

Algorithms for the Cross-dock Door Assignment Problem

In a cross-dock facility, goods are moved by forklift from incoming truck platforms (strip doors) to temporary holding areas and then to outgoing truck platforms (stack doors) or directly from strip doors to stack doors. Costs within the cross-dock may be minimized by appropriate assignment of strip doors to incoming trucks and stack doors to … Read more