Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context
Jiwoo Son, Minsu Kim, Sanghyeok Choi, Hyeonah Kim, Jinkyoo Park

TL;DR
Equity-Transformer introduces a sequential generation approach using Transformer models for large-scale min-max routing problems, effectively balancing workloads and significantly reducing runtime and costs in multi-agent routing tasks.
Contribution
The paper presents a novel Transformer-based method with inductive biases for equitable workload distribution in large-scale min-max routing problems, outperforming existing heuristics.
Findings
Achieves 335x runtime reduction in large-scale routing
Reduces cost values by approximately 53% compared to heuristics
Demonstrates effectiveness on min-max mTSP and mPDP tasks
Abstract
Min-max routing problems aim to minimize the maximum tour length among multiple agents by having agents conduct tasks in a cooperative manner. These problems include impactful real-world applications but are known as NP-hard. Existing methods are facing challenges, particularly in large-scale problems that require the coordination of numerous agents to cover thousands of cities. This paper proposes Equity-Transformer to solve large-scale min-max routing problems. First, we employ sequential planning approach to address min-max routing problems, allowing us to harness the powerful sequence generators (e.g., Transformer). Second, we propose key inductive biases that ensure equitable workload distribution among agents. The effectiveness of Equity-Transformer is demonstrated through its superior performance in two representative min-max routing tasks: the min-max multi-agent traveling…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsVehicle Routing Optimization Methods · Transportation and Mobility Innovations · Robotic Path Planning Algorithms
MethodsMulti-Head Attention · Attention Is All You Need · Linear Layer · Label Smoothing · Adam · Absolute Position Encodings · Residual Connection · Dropout · Position-Wise Feed-Forward Layer · Layer Normalization
