Handle |
Handle
http://hdl.handle.net/11134/20002:860655270
|
Persons |
|
Title |
|
Origin Information |
|
Parent Item |
|
Resource Type |
|
Digital Origin |
|
Description |
Description
This thesis considers three combinatorial optimization problems of substantial practical importance. First, a new approach to efficiently obtain a large number of ranked solutions to a 3-dimensional assignment problem is presented, and is applied to generate fuel assembly loading patterns. Second, we formulate the problem of dynamically scheduling maritime surveillance assets, and solve it using branch-and-cut and approximate dynamic programming (ADP) with rollout, and investigate the tradeoffs between the two. Third, a multi-objective ship routing problem is also investigated, where we propose a solution combining approximate dynamic programming techniques and clustering techniques to contain the computational and storage complexity. Lastly, this dissertation develops a seminal approach to adaptive Kalman filtering via the use of post-fit residuals given data samples -- an approach not yet discussed prior to this work.
|
Genre |
|
Organizations |
|
Held By |
|
Use and Reproduction |
Use and Reproduction
These Materials are provided for educational and research purposes only.
|
Note |
|
Degree Name |
|
Degree Level |
|
Degree Discipline |
|
Local Identifier |
|