[AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time
-
Updated
Jul 24, 2024 - Python
[AAAI 2024] GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time
This repo is focused on solving the prize collecting travelling salesman problem with two constructive heuristics and a local search method.
Add a description, image, and links to the prize-collecting-travelling-salesman-problem topic page so that developers can more easily learn about it.
To associate your repository with the prize-collecting-travelling-salesman-problem topic, visit your repo's landing page and select "manage topics."