Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Service Consistency In Vehicle Routing, Kunlei Lian
Service Consistency In Vehicle Routing, Kunlei Lian
Graduate Theses and Dissertations
This thesis studies service consistency in the context of multi-period vehicle routing problems (VRP) in which customers require repeatable services over a planning horizon of multiple days. Two types of service consistency are considered, namely, driver consistency and time consistency. Driver consistency refers to using the fewest number of different drivers to perform all of the visits required by a customer over a planning horizon and time consistency refers to visiting a customer at roughly the same time on each day he/she needs service. First, the multi-objective consistent VRP is defined to explore the trade-offs between the objectives of travel …
Incorporating A New Class Of Uncertainty In Disaster Relief Logistics Planning, Emre Kirac
Incorporating A New Class Of Uncertainty In Disaster Relief Logistics Planning, Emre Kirac
Graduate Theses and Dissertations
In recent years, there has been a growing interest among emergency managers in using Social data in disaster response planning. However, the trustworthiness and reliability of posted information are two of the most significant concerns, because much of the user-generated data is initially not verified. Therefore, a key tradeoff exists for emergency managers when considering whether to incorporate Social data in disaster planning efforts. By considering Social data, a larger number of needs can be identified in a shorter amount of time, potentially enabling a faster response and satisfying a class of demand that might not otherwise be discovered. However, …
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 …