Back to search

Georgia Institute of Technology

Scalable Approaches to Time-Dependent Path and Routing Problems

Abstract

dc:description.abstract

Many combinatorial optimization problems involve an aspect of time, whether due to changing conditions, updated information, or being under a continuous decision-making process. A popular domain for time-based decision making is logistics, where it is not only important to decide along which routes products need to be transported, but also when the transportation should occur. The timing for these problems is critical to take advantage of changing operational conditions such as traffic, capacity, and costs. Unfortunately, introducing time as an additional dimension significantly increases the size of models over their static counterparts. In fact, solving such models is often done via heuristics as existing solution methods are computationally intractable. This dissertation aims to provide insights into how scalable solution methodologies can be developed for such problems in path and routing problems.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Industrial and Systems Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • He, Edward Yuhang
Advisors dc:contributor.advisor
  • Boland, Natashia
  • Savelsbergh, Martin W. P.
  • Nemhauser, George L.
Committee members dc:contributor.committeemember
  • Hewitt, Michael
  • Toriello, Alejandro

Subjects

dc:subject × 10

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/65011

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

He, Edward Yuhang. Scalable Approaches to Time-Dependent Path and Routing Problems. Doctoral thesis, Georgia Institute of Technology, 2021. http://hdl.handle.net/1853/65011