Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

University of Tennessee, Knoxville

Industrial Engineering

Doctoral Dissertations

Integer Programming

Publication Year

Articles 1 - 3 of 3

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Utilization Of Integer Programming For Scheduling Maintenance At Nuclear Power Plants, Timothy Gallacher Dec 2023

Utilization Of Integer Programming For Scheduling Maintenance At Nuclear Power Plants, Timothy Gallacher

Doctoral Dissertations

This thesis develops a thought that naturally explores three specific motifs for solving the complexities of scheduling maintenance at Nuclear Power Plants (NPP). The first chapter of this paper will develop the initial thought around creating a schedule for a given work week, including all the various constraints inherent to this problem. Such constraints include but are not limited to personnel availability, allowable component out-of-service time, and the Plant Risk Assessment. The objective function being to minimize the total cost of worker’s compensation for that given week.

The second chapter addresses the question of whether this simple schedule can be …


Exploiting Symmetry In Linear And Integer Linear Programming, Ethan Jedidiah Deakins May 2023

Exploiting Symmetry In Linear And Integer Linear Programming, Ethan Jedidiah Deakins

Doctoral Dissertations

This thesis explores two algorithmic approaches for exploiting symmetries in linear and integer linear programs. The first is orbital crossover, a novel method of crossover designed to exploit symmetry in linear programs. Symmetry has long been considered a curse in combinatorial optimization problems, but significant progress has been made. Up until recently, symmetry exploitation in linear programs was not worth the upfront cost of symmetry detection. However, recent results involving a generalization of symmetries, equitable partitions, has made the upfront cost much more manageable.

The motivation for orbital crossover is that many highly symmetric integer linear programs exist, and …


Optimization Methods For Day Ahead Unit Commitment, Jonathan David Schrock May 2022

Optimization Methods For Day Ahead Unit Commitment, Jonathan David Schrock

Doctoral Dissertations

This work examines a variety of optimization techniques to better solve the day ahead unit commitment problem. The first method looks at the impact of almost identical generators on the problem and how to exploit that fact for computational gain. The second work seeks to improve the fidelity of the problem by better modeling the impact of pumped storage hydropower. Lastly, the relationship between the length of the planning horizon and the quality of the solutions is investigated.