Have a personal or library account? Click to login
Traveling salesman problem parallelization by solving clustered subproblems Cover

Traveling salesman problem parallelization by solving clustered subproblems

Foundations of Computing and Decision Sciences
Volume 48 (2023): Issue 4 (December 2023)
By: Vadim Romanuke  
Open Access
|Dec 2023

Authors

Vadim Romanuke

v.romanuke@amw.gdynia.pl

Polish Naval Academy, Gdynia, Poland
DOI: https://doi.org/10.2478/fcds-2023-0020 | Journal eISSN: 2300-3405 | Journal ISSN: 0867-6356
Journal RSS Feed
Language: English
Page range: 453 - 481
Submitted on: Aug 20, 2022
Accepted on: May 14, 2023
Published on: Dec 21, 2023
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
traveling salesman problem,
clustered subproblems,
transition nodes,
parallelization,
route length,
genetic algorithm
Related subjects:
Computer sciences,
Artificial intelligence,
Software development

© 2023 Vadim Romanuke, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 48 (2023): Issue 4 (December 2023)Next article