ROUTING IN TIME-DEPENDENT AND LABELED NETWORKS

PDF Version Also Available for Download.

Description

We study routing problems in time-dependent and edge and/or vertex-labeled transportation networks. Labels allow one to express a number of discrete properties of the edges and nodes. The main focus is a unified algorithm that efficiently solves a number of seemingly unrelated problems in transportation science. Experimental data gained from modeling practical situations suggest that the formalism allows interesting compromises between the conflicting goals of generality and efficiency. 1. We use edge/vertex labels in the framework of Formal Language Constrained Path Problems to handle discrete choice constraints. The label set is usually small and does not depend on the graph. ... continued below

Physical Description

15 p.

Creation Information

Barrett, C. L. (Christopher L.); Bisset, K. R. (Keith R.); Jacob, R. (Riko); Konjevod, G. (Goran) & Marathe, M. V. (Madhav V.) January 1, 2001.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

We study routing problems in time-dependent and edge and/or vertex-labeled transportation networks. Labels allow one to express a number of discrete properties of the edges and nodes. The main focus is a unified algorithm that efficiently solves a number of seemingly unrelated problems in transportation science. Experimental data gained from modeling practical situations suggest that the formalism allows interesting compromises between the conflicting goals of generality and efficiency. 1. We use edge/vertex labels in the framework of Formal Language Constrained Path Problems to handle discrete choice constraints. The label set is usually small and does not depend on the graph. Edge labels induct! path labels, which allows us to impose feasibility constraints on the set of paths considered as shortest path candidates. Second, we propose monotonic piecewise-linear traversal functions to represent the time-dependent aspect of link delays. The applications that can be modeled include scheduled transit and time-windows. 3. Third, we combine the above models and capture a variety of natural problems in transportatiou science such as time-window constrained trip-chaining. The results demonstrate the robustness of the proposed formalisms. As evidence for our claims of practical efficiency in a realistic setting, we report preliminary computational experience from TRANSIMS case studies of Portland, Oregon.

Physical Description

15 p.

Source

  • "Submitted to: ACM-SIAM Symposium on Discrete Algorithms (SODA 02), San Francisco, CA, January 2002."

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Report No.: LA-UR-01-4698
  • Grant Number: none
  • Office of Scientific & Technical Information Report Number: 975701
  • Archival Resource Key: ark:/67531/metadc932172

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • January 1, 2001

Added to The UNT Digital Library

  • Nov. 13, 2016, 7:26 p.m.

Description Last Updated

  • Dec. 12, 2016, 1:07 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 2

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Barrett, C. L. (Christopher L.); Bisset, K. R. (Keith R.); Jacob, R. (Riko); Konjevod, G. (Goran) & Marathe, M. V. (Madhav V.). ROUTING IN TIME-DEPENDENT AND LABELED NETWORKS, article, January 1, 2001; United States. (digital.library.unt.edu/ark:/67531/metadc932172/: accessed May 28, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.