PARCO: Learning Parallel Autoregressive Policies for Efficient Multi-Agent Combinatorial Optimization
<|reference_start|>PARCO: Learning Parallel Autoregressive Policies for Efficient Multi-Agent Combinatorial Optimization: Multi-agent combinatorial optimization problems such as routing and scheduling have great practical relevance but present challenges due to their NP-hard combinatorial nature, hard constraints on the number of possible agents, and hard-to-optimize objective functions. This paper introduces PARCO (Parallel AutoRegressive Combinatorial Optimization), a novel approach that learns fast surrogate solvers for multi-agent combinatorial problems with reinforcement learning by employing parallel autoregressive decoding. We propose a model with a Multiple Pointer Mechanism to efficiently decode multiple decisions simultaneously by different agents, enhanced by a Priority-based Conflict Handling scheme. Moreover, we design specialized Communication Layers that enable effective agent collaboration, thus enriching decision-making. We evaluate PARCO in representative multi-agent combinatorial problems in routing and scheduling and demonstrate that our learned solvers offer competitive results against both classical and neural baselines in terms of both solution quality and speed. We make our code openly available at https://github.com/ai4co/parco.<|reference_end|>
@article{berto2024parco:,
    title={PARCO: Learning Parallel Autoregressive Policies for Efficient
  Multi-Agent Combinatorial Optimization},
    author={Federico Berto, Chuanbo Hua, Laurin Luttmann, Jiwoo Son, Junyoung
  Park, Kyuree Ahn, Changhyun Kwon, Lin Xie, Jinkyoo Park},
    journal={arXiv preprint arXiv:2409.03811},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.03811},
    primaryClass={cs.MA cs.AI}
}