Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
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 …
Locating And Protecting Facilities Subject To Random Disruptions And Attacks, Hugh Medal
Locating And Protecting Facilities Subject To Random Disruptions And Attacks, Hugh Medal
Graduate Theses and Dissertations
Recent events such as the 2011 Tohoku earthquake and tsunami in Japan have revealed the vulnerability of networks such as supply chains to disruptive events. In particular, it has become apparent that the failure of a few elements of an infrastructure system can cause a system-wide disruption. Thus, it is important to learn more about which elements of infrastructure systems are most critical and how to protect an infrastructure system from the effects of a disruption. This dissertation seeks to enhance the understanding of how to design and protect networked infrastructure systems from disruptions by developing new mathematical models and …