Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
The Multi-Depot Minimum Latency Problem With Inter-Depot Routes, Timothy W. Duket
The Multi-Depot Minimum Latency Problem With Inter-Depot Routes, Timothy W. Duket
Open Access Theses
The Minimum Latency Problem (MLP) is a class of routing problems that seeks to minimize the wait times (latencies) of a set of customers in a system. Similar to its counterparts in the Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP), the MLP is NP-hard. Unlike these other problem classes, however, the MLP is customer-oriented and thus has impactful potential for better serving customers in settings where they are the highest priority. While the VRP is very widely researched and applied to many industry settings to reduce travel times and costs for service-providers, the MLP is a more recent …