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 20 of 143 for “"network design problem"”.
-
The Continuous Time Service Network Design Problem
The service network design problem (SNDP) addresses the planning of operations for freight transportation carriers. Given a set of requests to transport commodities from specific origins to specific destinations, SNDP determines a continuous movement of vehicles to service demand. Demand becomes …
-
Applying metaheuristics to feeder bus network design problem
This thesis proposes the design and analysis of four metaheuristics for solving the Feeder Bus Network Design Problem. They are Simulated Annealing, Tabu Search, Genetic Algorithm and the more recent metaheuristic, Ant Colony Optimization. The results are compared to those published in literature. …
-
Approaches to solving the express shipment service network design problem
… of material that must be moved in a multimodal network, and the large geographical area of service. These challenges necessitate the use of large jet aircraft fleets, thus prompting the desire of package deliver companies to use these aircraft as efficiently as possible. In this dissertation, …
-
The network design problem: The traffic-responsive signal control scheme
… Programming (BNP) and its application to the Network Design Problem (NDP): the Traffic-Responsive Signal Control (TRSC) scheme. The TRSC scheme considers the effect of signal controls on traffic flows in the standard traffic assignment problem through the integration of traffic control and …
-
The commuter rail circulator network design problem: formulation, solution methods, and applications
… demand centers. The commuter rail circulator network design problem (CRCNDP) addresses a particular aspect of the commuter rail trip, seeking to improve the performance of the entire system through accurately modeling the portion of the trip from rail station to the final destination. This …
-
Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem
… to solve the multi-module (survivable) network design problem. Many real-world decision-making problems can be modeled as network design problems, especially on networks with capacity requirements on arcs or edges. In most cases, network design problems of this type that have been …
-
Discrete Optimization and Agent-Based Simulation for Regional Evacuation Network Design Problem
… to devise effective and controlled evacuation networks to be utilized during extreme event egress. To solve our proposed model, we develop a solution methodology based on Benders Decomposition and test its performance through an experimental design using the Central Texas region as our case …
-
Pessimistic Hazmat Network Design Problem with Emergency Team Location Considering Uncertain Response Time
Focusing on a road network where hazmat shipments need to be transported from the origins to destinations, this thesis proposes a pessimistic approach to mitigate the risk associated with the transportation of hazardous materials (hazmat). More specifically, two stakeholders are involved in the …
-
Space-Time Transportation System Modelling: from Traveler’s Characteristics to the Network Design Problem
Traditional network design problems only consider the long-term stationary travel patterns (e.g., fixed OD demand) and short-term variations of human mobility are ignored. This study aims to integrate human mobility characteristics and travel patterns into network design problems using a space-time …
-
Implementation and evaluation of nonlinear bilevel programming model of equilibrium network design problem
… involves private-public interactions using a network design problem framework. Specifically, the objective of the research is to specify the transportation investment decision making process using a bilevel nonlinear programming model of the continuous equilibrium network design problem. …
-
Robustness approach to the integrated network design problem, signal optimization and dynamic traffic assignment problem
… and various metaheuristics for the integrated network design (NDP), signal setting design (SSD) and dynamic traffic assignment (DTA) problem (NDP-SSD) when accounting for the bi-level nature and the long-term origin-destination demand uncertainty. The NDP determines the optimal budget …
-
A Fast Multi-Objective Optimization Approach to Solve the Continuous Network Design Problem with Microscopic Simulation
… impacts opens the possibility to address the Network Design Problem from a new multi-objective point of view. Computation time, however, has hindered the use of this tool. The aim of this thesis was to find a continuous optimization method that would require only a very limited number of …
-
A dual approximation framework for dynamic network analysis: congestion pricing, traffic assignment calibration and network design problem
… DTA to predict traffic flows within their networks when conducting traffic analysis or evaluating management measures. To analyze DTA-based optimization applications, it is critical to obtain the dual (or gradient) information as dual information can typically be employed as a search …
-
A combined simulated annealing and TABU search strategy to solve network design problem with two classes of users
A methodology to solve a transportation network design problem (TCNDP) with two classes of users (passenger cars and trucks) is developed. Given an existing highway system, with a capital investment budget constraint, the methodology selects the best links to be expanded by an extra lane by …
-
A Procedure of Solving Transit Network Design Problem Based on a Non-Dominated Sorting Algorithm of NSGA II
This thesis focuses on the transit network design problem, where the focus is on understanding the trade-off between user costs and system owner cost. Given the focus on understanding this trade-off, a solution procedure based on the use of the Non-Dominated Sorting Genetic Algorithm (NGSA II) is …
-
Efficient algorithms for solving multi-objective optimization and large-scale transportation problems
… programs and solving large-scale transportation problems. In Chapter 2, we present a novel fast and robust algorithm for solving bi-objective mixed integer programs that extends and merge ideas from two existing methods: the $\epsilon$-Tabu Method and the Boxed Line Method. In Chapter 3, we study …
Page 1 of 8