We provide the code for a generic meta-training procedure to learn robust NCO heuristics, applicable to both reinforcement and supervised learning frameworks. Our code is based on the following repositories:
- Attention, Learn to Solve Routing Problems! and
- An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem
For the paper associated with this codebase, please check On the Generalization of Neural Combinatorial Optimization Heuristics. If you find this code useful, please cite our paper as:
@inproceedings{
manchanda_generalization_2022,
title = {On the Generalization of Neural Combinatorial Optimization Heuristics},
author = {Sahil Manchanda and Sofia Michel and Darko Drakulic and Jean-Marc Andreoli},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD)},
year = {2022},
url={https://arxiv.org/abs/2301.03313},
}