The Approach-dependent, Time-dependent, Label-constrained Shortest Path Problem and Enhancements for the CART Algorithm with Application to Transportation Systems
In this dissertation, we consider two important problems pertaining to the analysis of transportation systems. The first of these is an approach-dependent, time-dependent, label-constrained shortest path problem that arises in the context of the Route Planner Module of the Transportation Analysis Si...
Main Author: | Jeenanunta, Chawalit |
---|---|
Other Authors: | Industrial and Systems Engineering |
Format: | Others |
Published: |
Virginia Tech
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10919/27773 http://scholar.lib.vt.edu/theses/available/etd-05182004-031158/ |
Similar Items
-
Dynamic Shortest Paths Methods for the Time-Dependent TSP
by: Christoph Hansknecht, et al.
Published: (2021-01-01) -
Resource constrained shortest paths and extensions
by: Garcia, Renan
Published: (2009) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01) -
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
by: Ovidiu Cosma, et al.
Published: (2021-01-01) -
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
by: Xianbiao Hu, PhD, et al.
Published: (2015-01-01)