A Comparative Study on Population-Based Evolutionary Algorithms for Multiple Traveling Salesmen Problem with Visiting Constraints
Download
Download
Download
Full text for this resource is not available from the Research Repository.
Export
Bao, C, Yang, Qiang 
ORCID: 0000-0003-0277-3077, Gao, Xudong and Zhang, Jun ORCID: 0000-0001-7835-9871
(2021)
A Comparative Study on Population-Based Evolutionary Algorithms for Multiple Traveling Salesmen Problem with Visiting Constraints.
In: IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2021), 5 Dec 2021 - 7 Dec 2021, Orlando, FL, USA.
Dimensions Badge
Altmetric Badge
| Item type | Conference or Workshop Item (Paper) |
| URI | https://vuir.vu.edu.au/id/eprint/46476 |
| DOI | 10.1109/SSCI50451.2021.9660021 |
| Official URL | https://ieeexplore.ieee.org/document/9660021 |
| ISBN | 9781728190495 (print) 9781728190488 (online) |
| Subjects | Current > FOR (2020) Classification > 4602 Artificial intelligence Current > FOR (2020) Classification > 4605 Data management and data science Current > Division/Research > Institute for Sustainable Industries and Liveable Cities |
| Keywords | traveling salesman problem; accessibility constraints; vehicle routing problems; evolutionary algorithms; combinatorial optimization problem; VCMTSP |
| Download/View statistics | View download statistics for this item |
CORE (COnnecting REpositories)