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 21 for “"subgradient optimization"”.
-
Improving Lower Bound for Aircraft Routing Optimization. An Application of Lagrange Relaxation
Aircraft routing is a complicated optimization problem which can be modelled as a form of resource-constrained integer multi-commodity network flow problem. When optimizing this problem, a good lower bound is useful to assess the quality of feasible solutions and for determining convergence of the …
-
Optimal configuration of digital communication network
… problem. The Lagrangian relaxation method and subgradient optimization procedure have been used to find reasonably good feasible solutions. Although the reliability for computer communication networks is as important as the cost factor, only the cost factor is considered in the context of this …
-
Context-free vector assignment location problems
… VAPMP: (a) linear programming relaxation, (b) subgradient optimization of the Lagrangian dual, and (c) vertex substitution. The subgradient optimization of the Lagrangian dual is shown to be an efficient procedure</p><p>iii</p><p>iv which obtained and verified optimal solutions to almost all …
-
Multi-period optimization of pavement management systems
… of the Lagrangean multipliers are found by a subgradient optimization method, while the Ford-Bellman network algorithm is employed at each iteration of the subgradient optimization procedure to solve the longest-path network problem as well as to obtain an improved lower and upper bound. If …
-
A discrete equal-capacity p-Median problem
… of a reformulated problem via a conjugate subgradient optimization procedure. We obtain Benders’ cuts from the above procedures and proceed to a modified Benders’ approach to solve the continuous relaxation of the original problem. Finally a branch-and-bound algorithm that enumerates over …
-
Inexact subgradient methods.
… evaluation of the objective function and its subgradients can be computationally burdensome. For example, in a stochastic program, the objective function is typically defined through a multi-dimensional integration. Solution procedures for stochastic programs are usually based on functional …
-
Multiobjective Optimization for Complex Systems
… of structures are proposed. Using multiobjective optimization theory, relationships between the efficient solutions of the overall system and the efficient solutions of its subproblems are derived. A system with a particular structure is then selected and further analysis is performed regarding …
-
Stochastic shortest path algorithm based on Lagrangian relaxation
… close to the optimal is achieved through subgradient optimization. Among the candidate paths obtained, the best solution becomes the ultimate solution of our algorithm for the original cost function under parameter variation. The algorithm presented in this work can handle any graph …
-
Mathematical Modeling and Optimization of Aerospace Maintenance Scheduling
… sequencing constraints. We employ a projected subgradient optimization method to solve the resulting dual problems, using adaptive step-size strategies to improve convergence stability. The LR approach provides lower bounds for the optimal solution, allowing us to assess the quality of …
-
Solving midterm and short-term nurse scheduling problems
… based heuristic, which uses a combination of subgradient optimization and Bundle methods, with variable fixing strategy and IP-based heuristic. The second methodology is a branch-and-price algorithm that makes use of several new branching rules, an extremely effective rounding heuristic, a …
-
Three Essays in Resort and Sea Cargo Revenue Management
… approximations resulting in practical policy optimization methods for resort revenue management. This research contributes to resort revenue management by introducing a novel setting and an integrated model capturing different industry aspects, including ancillary spending, free upgrades, …
-
Subgradient-based Decomposition Methods for Stochastic Mixed-integer Programs with Special Structures
… Each node in the framework has control of an optimization model which may include stochastic parameters, and the nodes must coordinate toward a single objective in which a single optimal or close-to-optimal solution is desired. However, because of competitive issues, confidentiality …
-
Computational Study of Mean-Risk Stochastic Programs
… over the risk-neutral one. We derive two new subgradient based algorithms for the ASD and QDEV models, respectively. These algorithms are based on decomposing the stochastic program stage-wise and using a single (aggregated) cut in the master program to approximate the mean and deviation terms …
-
Limited Memory Space Dilation and Reduction Algorithms
… of the difference between two successive subgradients, is recognized as being one of the most effective procedures for solving nondifferentiable optimization problems. However, the method needs to store the space dilation matrix and update it at every iteration, resulting in a substantial …
-
Computational methods for protein structure prediction and energy minimization
… are limited, we derive new solution methods via optimization theory.Identifying residues that interact with ligands is useful as a first step to understanding protein function and as an aid to designing small molecules that target the protein for interaction. Several studies have shown sequence …
-
Optimization of Cable Harness Routing
… soft constraints. The problem is a large-scale optimization problem, and Lagrangian relaxation is utilized in the solution process. A deflected subgradient method is used to solve the Lagrangian dual problem, and to provide upper and lower bounds on the optimal objective value. Ergodic sequences …
-
Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing
… 0-1 problems in concert with deflected/conjugate subgradient algorithms. In addition, we propose two general purpose lifting mechanisms for tightening the mathematical programming formulations associated with such minimax optimization problems. Next, we explore novel continuous nonconvex as well …
-
Using machine learning to improve a column generation framework for a tail assignment optimizer
… research effort spent on algorithms for solving optimization problems appearing in an airline industry is vast, the use of machine learning for improving these algorithms is a new and under-explored topic. A popular and widely researched problem in the airline industry is the tail assignment …
-
Integrated Aircraft Fleeting, Routing, and Crew Pairing Models and Algorithms for the Airline Industry
The air transportation market has been growing steadily for the past three decades since the airline deregulation in 1978. With competition also becoming more intense, airline companies have been trying to enhance their market shares and profit margins by composing favorable flight schedules and by …
Page 1 of 2