Operations Research, Systems Engineering and Industrial Engineering Commons^™

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 …

Improving Mobility And Safety In Traditional And Intelligent Transportation Systems Using Computational And Mathematical Modeling, Shahrbanoo Rezaei

Doctoral Dissertations

In traditional transportation systems, park-and-ride (P&R) facilities have been introduced to mitigate the congestion problems and improve mobility. This study in the second chapter, develops a framework that integrates a demand model and an optimization model to study the optimal placement of P&R facilities. The results suggest that the optimal placement of P&R facilities has the potential to improve network performance, and reduce emission and vehicle kilometer traveled. In intelligent transportation systems, autonomous vehicles are expected to bring smart mobility to transportation systems, reduce traffic congestion, and improve safety of drivers and passengers by eliminating human errors. The safe operation …

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 …