Heuristic Path-Enumeration Approach for Container Trip Generation and Assignment

Authors

  • EunSu Lee North Dakota State University
  • Peter Oduor none
  • Kambiz Farahmand North Dakota State University
  • Denver Tolliver North Dakota State University

DOI:

https://doi.org/10.5399/osu/jtrf.50.3.4118

Abstract

A commonly ignored key ingredient in large-scale container network assignment is an impedance-driven geovisualization of optimal routes. In this study, we propose linear optimization models for both trip generation and trip assignment using dynamic programming on a GIS platform, which includes maps and data that are used to develop and generate trips. The proposed models are applied to intermodal railroad routes mostly in the United States. Dendritic optimal networks are figures visually depicting all optimal branches for the network.

Downloads

Published

2011-09-01

Issue

Section

Articles