Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Shortest Path Problem (SPP)"”.
-
Efficient path search in intermodal transportation optimization
… effective algorithm for solving transportation problem in a graph of intermodal centers (IMC's). We consider discrete model of the real time dynamic situation when all the arcs of the input graph can be affected by changes in their costs, the transportation means have limited and different …
-
Robust Binary Linear Programming Under Implementation Uncertainty
… focuses on binary linear programming problems (BLP) affected by uncertainties preventing the implementation of the solutions exactly as prescribed. This type of uncertainty is termed implementation uncertainty and occurs due to model fidelity limitations. This dissertation presents a …
-
The dynamic, resource-constrained shortest path problem on an acyclic graph with application in column generation and literature review on sequence-dependent scheduling
… two independent topics: a resource-constrained shortest-path problem (RCSP) and a literature review on scheduling problems involving sequence-dependent setup (SDS) times (costs). RCSP is often used as a subproblem in column generation because it can be used to solve many practical problems. This …
-
Health Service Support Networks Under Antiaircraft Threat
… threat environments. Two novel optimization problems are proposed including the 2-Leg Aeromedical Evacuation Problem (2-LAEP) and the Air Evacuation Location Routing (AELR) problem. 2-LAEP is used to find a path from an airfield to a casualty location and onward to a hospital which minimizes …