Used to solve MDMTSP-CFA, MDMTSP-CFD, SDMTSP
SDMTSP: Single-depot multiple traveling salesman problem, agents must start and end traveling at the depot
MDMTSP: Dedicated multi-depot MTSP, agent must start traveling at their dedicated depots.
MDMTSP-CFD: one MDMTSP variation, in which agents start and commence travels from their dedicated depots
MDMTSP-CFA: one MDMTSP variation, in which agents start traveling from any locations.
- Python >= 3.10
- Numpy
- Google OR-Tools
- PyTorch >= 2.1.2
- tqdm
- TensorboardX
cd partition-git
Model will be saved at ../savemodel
python train.py --problem cfa
python train.py --problem cfd
python train.py --problem sdmtsp
cd partition-git
Code will automatically load the learned model under ../savemodel/
python eval.py --problem cfa --anum 10 --cnum 100
python eval.py --problem cfd --anum 20 --cnum 200
python eval.py --problem sdmtsp --anum 20 --cnum 200
- The number of depots and current positions are not included in the total number of locations.
- Before running the code, use ulimit -n 99999 to enable high parallel processing.
- The three pretrained RouteMaker for MDMTSP-CFA, MDMTSP-CFD, SDMTSP can be downloaded from https://pan.baidu.com/s/1Tc935Verqe0HW5NGfhQZgw?pwd=fkjf with extract password: fkjf
- In the very rare event that RouteMaker fails to converge, please delete the faulty model and retrain a new one.