Operations Research, Systems Engineering and Industrial Engineering Commons^™

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 …