1 code implementation • 21 Mar 2024 • Yuji Zou, Jin-Kao Hao, Qinghua Wu
The latency location routing problem integrates the facility location problem and the multi-depot cumulative capacitated vehicle routing problem.
no code implementations • 14 Mar 2024 • Pengfei He, Jin-Kao Hao, Qinghua Wu
The capacitated location-routing problem involves determining the depots from a set of candidate capacitated depot locations and finding the required routes from the selected depots to serve a set of customers whereas minimizing a cost function that includes the cost of opening the chosen depots, the fixed utilization cost per vehicle used, and the total cost (distance) of the routes.
no code implementations • 10 Jul 2020 • Yongliang Lu, Jin-Kao Hao, Qinghua Wu
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications.