Decomposition has been used in solving numerous problems in mathematics, computer science, engineering, management, and operations research. In this dissertation, we use decomposition methods to solve three practical combinatorial optimization problems arising in telecommunication and airline planning. In the first part of the dissertation, we study a redundant multicast routing problem with group diverse constraint (RMRGD) that arises in many network applications such as communication systems, power supply distribution systems, transportation networks, etc. We propose three mixed integer programming (MIP) models, an edge-based, a path-based, and a tree-based model, to solve RMRGD. We proposed two decomposition methods based on the column generation and branch-and-price to solve the path-based and tree-based models. Our empirical results suggest that the edge-based model is superior in solving small and mid-sized problems, whereas the tree-based model performs better for large problems. In the second part of the dissertation, we study the flight conflict resolving problem (FCR). The purpose of flight conflict re-scheduling problem is to provide a flight schedule that minimizes the total penalty cost of schedule changes, while maintaining the FAA separation standard between aircrafts. We propose a set-partitioning-based flight sequence model (FSM) that selects an optimal set of flight sequences to minimize the total penalty cost. We also extend the FSM to consider equity among airlines because such corporate decision making (CDM)-feature is necessary and critical for the future aviation systems. The computation results show the proposed solution methods outperform other solution methods, and solve the real life test cases optimally within reasonable time In the third part of the dissertation, the aircraft maintenance routing problem is studied. The aircraft maintenance routing problem is aimed at scheduling the aircraft rotations so that adequate maintenance opportunities are provided to every aircraft in the fleet. In this dissertation, we present two new compact rotation-tour network representations for the daily aircraft maintenance routing problem (AMR) and the weekly aircraft maintenance routing problem (WAMR), and propose new mixed-integer linear programming formulations to solve these two problems. The computational study suggests the proposed models are able to solve large real-life test instances optimally in reasonable time.
Subject (authority = RUETD)
Topic
Industrial and Systems Engineering
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Rutgers University. Graduate School - New Brunswick
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.