Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Efficiently Estimating Survival Signature And Two-Terminal Reliability Of Heterogeneous Networks Through Multi-Objective Optimization, Daniel Bruno Lopes Da Silva
Efficiently Estimating Survival Signature And Two-Terminal Reliability Of Heterogeneous Networks Through Multi-Objective Optimization, Daniel Bruno Lopes Da Silva
Graduate Theses and Dissertations
The two-terminal reliability problem is a classical reliability problem with applications in wired and wireless communication networks, electronic circuit design, computer networks, and electrical power distribution, among other systems. However, the two-terminal reliability problem is among the hardest combinatorial problems and is intractable for large, complex networks. Several exact methods to solve the two-terminal reliability problem have been proposed since the 1960s, but they have exponential time complexity in general. Hence, practical studies involving large network-type systems resort to approximation methods to estimate the system's reliability. One attractive approach for quantifying the reliability of complex systems is to use signatures, …
Curriculum Optimization Via Activity-On-Node Network Modeling, Caroline Rhomberg
Curriculum Optimization Via Activity-On-Node Network Modeling, Caroline Rhomberg
Industrial Engineering Undergraduate Honors Theses
University degree plans must be carefully planned so that they allow students the best chance of succeeding. Although for the better, with the advancement of technology and its incorporation into the classroom, it can be argued that the complexity and difficulty of some long-established engineering core classes has changed. With this trend certain combinations of engineering courses have become unfavorable in terms of course withdrawal and fail rates stemming from the interaction of course challenges. A wealth of data has been collected on this topic and will be utilized in this project. As one can imagine, the probability of success …
A Tabu Search, Augment-Merge Heuristic To Solve The Stochastic Location Arc Routing Problem, Tiffany L. Yang
A Tabu Search, Augment-Merge Heuristic To Solve The Stochastic Location Arc Routing Problem, Tiffany L. Yang
Graduate Theses and Dissertations
The location arc routing problem (LARP) is a network optimization problem combining strategic facility location decisions and tactical or operational vehicle routing decisions for customer demand located on arcs of a network. The LARP seeks to locate facilities, or depots, and create vehicle delivery routes to minimize costs. The total cost is comprised of three components: fixed facility locations costs, fixed route creation (or vehicle acquisition) costs, and variable arc traversal costs. The applications of the LARP are varied and often include public services such as mail delivery, garbage collection, and street sweeping. In all of these applications, the magnitude …