Network Optimization
Transportation Scheduling

Slide 2


Railroad Blocking Problem

Airline Schedule Design Problem

Airline Schedule Design Problem (contd.)

Railroad Blocking Problem

Blocking Problem

Size of the Problem

Difficulty of the Problem

Prior Research

Our Approaches

Basic Approach

An Illustration

Basic Approach (contd.)

Basic Approach (contd.)

Computational Results

Benefits of Network Based Methods

Future Work

Additional Applications


Fleet Assignment Model (FAM)

Input to Flight Assignment Model

Output of Flight Assignment Model

Through Flights

Additional Through Flights

Current Solution Technique

The Combined Through Fleet Assignment Model (ctFAM)

Our Approach for ctFAM

Single A-B Swaps (Before the swap)

Single A-B Swaps (After the swap)

Finding Improving A-B Swaps

Finding Improving Changes (contd.)

Multi A-B Swaps

Identifying Profitable AB-Swaps

Neighborhood Search for the ctFAM

Computational Results on ctFAM

ctFAM with Time Windows

ctFAM with Time windows (contd.)

Computational Results

Neighborhood Search in Airline Scheduling

Locomotive Scheduling Problems

Locomotive Schedule Planning Problem

Some Features

Decision Variables

Hard Constraints

Problem Size

Two-Stage Optimization

Problem Decomposition

Computational Results

Computational Results (contd.)

Summary of Computational Results

Next Research Phase


Research Papers