Rough-Cut Capacity Planning in Multimodal Freight Transportation Networks

Abstract

A main challenge in transporting cargo for United States Transportation Command (USTRANSCOM) is in mode selection or integration. Demand for cargo is time sensitive and must be fulfilled by an established due date. Since these due dates are often in flexible, commercial carriers are used at an enormous expense, in order to fill the gap in organic transportation asset capacity. This dissertation develops a new methodology for transportation capacity assignment to routes based on the Resource Constrained Shortest Path Problem (RCSP). Routes can be single or multimodal depending on the characteristics of the network, delivery timeline, modal capacities, and costs. The difficulty of the RCSP requires use of metaheuristics to produce solutions. An Ant Colony System to solve the RCSP is developed in this dissertation. Finally, a method for generating near Pareto optimal solutions with respect to the objectives of cost and time is developed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 30, 2012
Accession Number
ADA566840

Entities

People

  • Robert B. Hartlage

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Engineered Resilient Systems
  • Ground and Sea Platforms
  • Human Systems
  • Space

DTIC Thesaurus Topics

  • Air Force
  • Computers
  • Department Of Defense
  • Evolutionary Algorithms
  • Flow Network
  • Freight Transportation
  • Linear Programming
  • Logistics
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Particle Swarm Optimization
  • Reliability
  • Supply Chain
  • Supply Chain Management
  • Transportation Infrastructure
  • United States Transportation Command

Readers

  • Aerospace logistics and air mobility.
  • Operations Research