Solving multiple travelling salesman problem through deep convolutional neural network
Abstract The multiple travelling salesman problem (mTSP) is a classical optimisation problem that is widely applied in various fields. Although the mTSP was solved using both classical algorithms and artificial neural networks, reiteration is inevitable for these methods when presented with new samp...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-03-01
|
| Series: | IET Cyber-systems and Robotics |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/csy2.12084 |