公平な経路計画:複数巡回セールスマン問題の再考
Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
複数巡回セールスマン問題において、巡回路長の公平な分配を促す2つの新しい変種(ε-Fair-MTSPとΔ-Fair-MTSP)を提案し、大域的最適解を保証するアルゴリズムを開発した。ベンチマークと電気自動車 fleet ルーティングで有効性を示し、min-max MTSPの実用的な代替となる。
著者: Abhay Singh Bhadoriya, Deepjyoti Deka, Kaarthik Sundar
分類: math.OC, cs.RO
原文アブストラクト
The Multiple Traveling Salesman Problem (MTSP) extends the traveling salesman problem by assigning multiple salesmen to visit a set of targets from a common depot, with each target visited exactly once while minimizing total tour length. A common variant, the min-max MTSP, focuses on workload balance by minimizing the longest tour, but it is difficult to solve optimally due to weak linear relaxation bounds. This paper introduces two new parametric fairness-driven variants of the MTSP: the $\varepsilon$-Fair-MTSP and the $\Delta$-Fair-MTSP, which promote equitable distribution of tour lengths while controlling overall cost. The $\varepsilon$-Fair-MTSP is formulated as a mixed-integer second-order cone program, while the $\Delta$-Fair-MTSP is modeled as a mixed-integer linear program. We develop algorithms that guarantee global optimality for both formulations. Computational experiments on benchmark instances and real-world applications, including electric vehicle fleet routing, demonstrate their effectiveness. Furthermore, we show that the algorithms presented for the fairness-constrained MTSP variants can be used to obtain the Pareto front of a bi-objective optimization problem in which one objective minimizes the total tour length and the other balances the lengths of the individual tours. Overall, these fairness-constrained MTSP variants provide a practical and flexible alternative to the min-max MTSP.
