Models and algorithms for complex system optimization problems : applications to hospital layout and LED traffic signal maintenance

"December 2010.""A Thesis presented to the Faculty of the Graduate School at the University of Missouri In Partial Fulfillment of the Requirements for the Degree Master of Science, Industrial Engineering."Thesis supervisor: Dr. Mustafa Sir.Due to rising healthcare costs, it is increasingly important to design health care buildings to be efficient and effective. One aspect of a healthcare facility's design is the size and layout of the building and departments. In this paper we review hospital design and the various layout methods that can be applied to hospitals. We formulate a mixed-integer linear programming model to determine the optimal size (i.e. width and length of each floor and number of floors) and department layout of a hospital. The model has multiple objectives; we consider department size requirements to determine a cost-efficient facility size and then place departments to minimize inter-departmental flows. Finally, we use the model to design a multi-floor hospital with seven departments and test the computation time for a variety of scenarios. The Energy Policy Act of 2005 specifies that all traffic signals manufactured after January 1, 2006 must realize the energy efficiency achieved by LED technology [10]. These new LED traffic signals use less energy and last longer than their predecessors, but they deteriorate gradually and require customized maintenance schedules to optimize their useful life and maximize public safety. In the second half of this paper we review the advantages of LED traffic signals and the current literature on their maintenance. We present three models and algorithms to compute optimal maintenance schedules. The first model is designed to model routine maintenance and includes routing costs. The second model is an approximation of the first model that can be solved for scenarios which include very large quantities of traffic signals. The final model allows for two actions, inspection and replacement, and introduces stochastic deterioration. We test the computation time of each algorithm and assess the resulting schedules.Includes bibliographical references (pages 163-165)

A Polyhedral Study of Mixed 0-1 Set

We consider a variant of the well-known single node fixed charge network flow set with constant capacities. This set arises from the relaxation of more general mixed integer sets such as lot-sizing problems with multiple suppliers. We provide a complete polyhedral characterization of the convex hull of the given set

Essays on Integer Programming in Military and Power Management Applications

This dissertation presents three essays on important problems motivated by military and power management applications. The array antenna design problem deals with optimal arrangements of substructures called subarrays. The considered class of the stochastic assignment problem addresses uncertainty of assignment weights over time. The well-studied deterministic counterpart of the problem has many applications including some classes of the weapon-target assignment. The speed scaling problem is of minimizing energy consumption of parallel processors in a data warehouse environment. We study each problem to discover its underlying structure and formulate tailored mathematical models. Exact, approximate, and heuristic solution approaches employing advanced optimization techniques are proposed. They are validated through simulations and their superiority is demonstrated through extensive computational experiments. Novelty of the developed methods and their methodological contribution to the field of Operations Research is discussed through out the dissertation