Learning to Solve Routing Problems via Distributionally Robust Optimization

23Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

Recent deep models for solving routing problems always assume a single distribution of nodes for training, which severely impairs their cross-distribution generalization ability. In this paper, we exploit group distributionally robust optimization (group DRO) to tackle this issue, where we jointly optimize the weights for different groups of distributions and the parameters for the deep model in an interleaved manner during training. We also design a module based on convolutional neural network, which allows the deep model to learn more informative latent pattern among the nodes. We evaluate the proposed approach on two types of wellknown deep models including GCN and POMO. The experimental results on the randomly synthesized instances and the ones from two benchmark dataset (i.e., TSPLib and CVRPLib) demonstrate that our approach could significantly improve the cross-distribution generalization performance over the original models.

Cite

CITATION STYLE

APA

Jiang, Y., Wu, Y., Cao, Z., & Zhang, J. (2022). Learning to Solve Routing Problems via Distributionally Robust Optimization. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9786–9794). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i9.21214

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free