Operations Research, Systems Engineering and Industrial Engineering Commons^™

Milk Collection Problem: Integrating The Traveling Salesman And Set Covering Problem - A Case Study In West Virginia, Usa, Md Rabiul Hasan

Graduate Theses, Dissertations, and Problem Reports

Route determination for perishable products is complex due to its unique characteristics, such as limited shelf-life regulatory requirements, or possibility of getting damaged. This research investigates a novel problem of collecting raw milk from a rural network of dairy farms. The research problem is grounded in a real scenario of milk collection in West Virginia, USA. The milk in this scenario is produced by small farms incapable of realizing transportation economies of density out in mostly rural areas throughout the state. Maximum coverage area and milk processing overhead costs are used to identify suitable locations for intermediate milk collection centers …

Spatio-Temporal Deep Learning Approaches For Addressing Track Association Problem Using Automatic Identification System (Ais) Data, Md Asif Bin Syed

Graduate Theses, Dissertations, and Problem Reports

In the realm of marine surveillance, track association constitutes a pivotal yet challenging task, involving the identification and tracking of unlabelled vessel trajectories. The need for accurate data association algorithms stems from the urge to spot unusual vessel movements or threat detection. These algorithms link sequential observations containing location and motion information to specific moving objects, helping to build their real-time trajectories. These threat detection algorithms will be useful when a vessel attempts to conceal its identity. The algorithm can then identify and track the specific vessel from its incoming signal. The data for this study is sourced from the …

Simulated Annealing Heuristics For The Dynamic Generalized Quadratic Assignment Problem, Yugesh Dhungel

Graduate Theses, Dissertations, and Problem Reports

The Dynamic Generalized Quadratic Assignment Problem (DGQAP) is the task of assigning a set of facilities to a set of locations in a multi-period planning horizon such that the sum of the transportation and assignment/reassignment costs is minimized. The facilities may have different space requirements, and the capacities of locations may vary during the multiple-period planning horizon. Also, multiple facilities may be assigned to each location without violating the space capacity of the location. This research presents a formulation and applications of DGQAP in various layout and assignment problems encountered in the literature. Two Simulated Annealing (SA) metaheuristics named SA …

Models And Solution Approaches For Integrated Student To School Assignment And School Bus Routing Problem Focusing On Special Needs Students, Azadeh Ansari

Graduate Theses, Dissertations, and Problem Reports

This dissertation addresses the integrated problem of assigning students to schools and generating school bus routes particularly focusing on the special needs students is addressed. Special needs students generally require supplementary accommodations and must be picked up from and dropped off at their home addresses. This will increase the number of nodes in the network and therefore introduces additional complexities to the problems of assignment and routing for students. An integrated single objective mathematical model is first developed that simultaneously assigns the students to schools based on their needs and generates efficient bus routes to deliver the students to their …

Transit Agencies Performance Assessment And Implications, Parisa Hajibabaee

Graduate Theses, Dissertations, and Problem Reports

Although most transit systems operate in small urban and rural areas in the United States, these systems have rarely received the same attention as their urban counterparts, both in terms of ensuring the efficiency and effectiveness of their operations and understanding the factors that affect their performance. This thesis's main goals are to assess the performance of rural and small urban public transit agencies and help them evaluate adopting a ridehailing program, thereby improving their performance. We applied operations research and decision-making tools to two public transit projects in small urban and rural areas. The first project focuses on three …

Metaheuristics For The Generalized Quadratic Assignment Problem, Roseline Mostafa

Graduate Theses, Dissertations, and Problem Reports

The generalized quadratic assignment problem (GQAP) is the task of assigning a set of facilities to a set of locations such that the sum of the assignment and transportation costs is minimized. The facilities may have different space requirements, and the locations may have varying space capacities. Also, multiple facilities may be assigned to each location such that space capacity is not exceeded. In this research, an application of the GQAP is presented for assigning a set of machines to a set of locations on the plant floor. Two meta-heuristics are proposed for solving the GQAP: tabu search (TS) and …

Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer

Graduate Theses, Dissertations, and Problem Reports

In the pharmaceutical manufacturing world, a deadline could be the difference between losing a multimillion-dollar contract or extending it. This, among many other reasons, is why good scheduling methods are vital. This problem report addresses Flexible Flowshop (FF) scheduling using Simulated Annealing (SA) in conjunction with the Steepest Descent heuristic (SD).

FF is a generalized version of the flowshop problem, where each product goes through S number of stages, where each stage has M number of machines. As opposed to a normal flowshop problem, all ‘jobs’ do not have to flow in the same sequence from stage to stage. The …

Chemometric Calibration Of Surface Enchanced Raman Spectra For Quantitative Analysis, Xiaofei Shi

Graduate Theses, Dissertations, and Problem Reports

Raman spectroscopy, recognized as a powerful analytical technique, has been widely employed in many fields especially in the detection of hazard material containing in food or water. However, multiplexed analyte quantification based on Raman spectra remains a challenge due to the difficulties in accurate and precise modeling of the relationship between multiple analyte concentrations and dense spectral data with noise.

In this work, a statistical procedure was developed to efficiently generate high-quality calibration models quantifying the analyte concentrations versus spectra relationship. The resulting calibration models are able to provide estimated concentration ranges (which reflect both point and uncertainty estimates) for …