EDP Sciences logo
Web of Conferences logo
Search
Menu
All issues Volume 360 (2026) EPJ Web Conf., 360 (2026) 01021 References
Open Access
Issue
EPJ Web Conf.
Volume 360, 2026
1st International Conference on “Quantum Innovations for Computing and Knowledge Systems” (QUICK’26)
Article Number 01021
Number of page(s) 13
DOI https://doi.org/10.1051/epjconf/202636001021
Published online 23 March 2026
  1. S. M. Almufti and A. A. Shaban, Comparative analysis of metaheuristic algorithms for solving the travelling salesman problems. Int. J. Sci. World 11(2), 26–30 (2025). https://doi.org/10.14419/7fk7k945 [Google Scholar]
  2. A. Ferhat, F. Zitouni, R. Lakbichi, A. Limane, S. Harous and O. Kazar, Impact of problem size on exploration–exploitation balance in metaheuristics for the travelling salesman problem. Proc. PAIS (2025). https://doi.org/10.1109/PAIS66004.2025.11126504 [Google Scholar]
  3. M. Goel, J. Singh and A. Kumar Bairwa, Performance evaluation of heuristic and metaheuristic algorithms on large-scale travelling salesman problem instances. IEEE Access 13, 156988–157010 (2025). https://doi.org/10.1109/ACCESS.2025.3606531 [Google Scholar]
  4. A. Laghlita, H. Mansouri, M. Tobi and M. Sayyouri, Comparative study of metaheuristic algorithms on traveling salesman problem instances. Proc. ICCSC (2025). https://doi.org/10.1109/ICCSC66714.2025.11134979 [Google Scholar]
  5. N. Tram, V. Snasel, A. Kumar, S. Das and V. D. Nguyen, An efficient method for solving the traveling salesman problem using modern optimization algorithms. IEEE Access 14, 13396–13412 (2026). https://doi.org/10.1109/ACCESS.2026.3656221 [Google Scholar]
  6. W. Li, L. Xia, Y. Huang et al., An ant colony optimization algorithm with adaptive greedy strategy to optimize path problems. J. Ambient Intell. Humanized Comput. 13, 1557–1571 (2022). https://doi.org/10.1007/s12652-021-03120-0 [Google Scholar]
  7. K. Panwar, Comparative analysis of enhanced metaheuristics for the colored traveling salesman problem. Evol. Intell. 19, 30 (2026). https://doi.org/10.1007/s12065-026-01143-0 [Google Scholar]
  8. A. Bhattacharya, D. Siddiqui and P. P. Sarangi, Benchmarking improved metaphor-less optimization algorithms on traveling salesman problem. Proc. CVMI (2025). https://doi.org/10.1109/CVMI66673.2025.11337504 [Google Scholar]
  9. M. Aktas¸ and F. Kiliç, Discrete starfish optimization algorithm for symmetric travelling salesman problem. IEEE Access 13, 102675–102687 (2025). https://doi.org/10.1109/ACCESS.2025.3579248 [Google Scholar]
  10. X.-L. Shi, W.-N. Chen, F.-F. Wei and J. Zhang, A distributed ant colony system with pheromone transfer for multiagent traveling salesmen problem. IEEE Trans. Evol. Comput. (2025). https://doi.org/10.1109/TEVC.2025.3562437 [Google Scholar]
  11. V. J. Phoanata, P. Y. Pamungkas and J. Limsanto, Zebra optimization algorithm for solving travelling salesman problem. Proc. ICDXA (2025). https://doi.org/10.1109/ICDXA69105.2025.11329881 [Google Scholar]
  12. T. Zhu, L. Yao, J. Sun, J. Liu and Z. Wu, A hybrid algorithm for the traveling salesman problem. Proc. CBASE (2025). https://doi.org/10.1109/CBASE67452.2025.11335427 [Google Scholar]
  13. A. Pinandito, A. P. Kharisma, H. Tolle and C. P. Wulandari, Improving ant colony optimization route finding performance in parcel delivery mobile application. Proc. APWiMob (2025). https://doi.org/10.1109/APWiMob67231.2025.11269157 [Google Scholar]
  14. F. M. Vera et al., Application of the ant colony optimization algorithm in urban route optimization. Proc. ETCM (2025). https://doi.org/10.1109/ETCM67548.2025.11304304 [Google Scholar]
  15. S. R. A. H. N. Kishore, A. Sasireka, G. Vinoly, S. S. V. K and M. Saratha, Optimized path estimation in TSP using a hybrid genetic algorithm and ant colony optimization. Proc. GITCON (2025). https://doi.org/10.1109/GITCON65266.2025.11376746 [Google Scholar]
  16. M.-M. Gao, W.-J. Yu, B. Sun, T. Qian and Y. Bai, Pheromone mutation-based ant colony optimization for multiple traveling salesman problem. Proc. MiTA (2025). https://doi.org/10.1109/MiTA66017.2025.11100229 [Google Scholar]
  17. Q.-J. Jiang, Z.-K. Shao, T.-L. Jin and J.-Y. Li, Parameter tuning for ant colony optimization based multiple traveling salesman problem optimization. Proc. ICAIS-ISAS (2025). https://doi.org/10.1109/ICAISISAS64483.2025.11051455 [Google Scholar]
  18. H.-Y. Pan et al., A multimodal ant colony optimization framework for multi-solution traveling salesman problem. IEEE Trans. Evol. Comput. (2025). https://doi.org/10.1109/TEVC.2025.3638360 [Google Scholar]
  19. C. Wang, H. Zhang, J. Wang and L. Zhang, Ant colony optimization with deep heuristic information for electric vehicle routing problems. IEEE Internet Things J. 12(24), 54436–54449 (2025). https://doi.org/10.1109/JIOT.2025.3620353 [Google Scholar]
  20. R. Sato, C. Gordon, K. Saito, H. Kawashima, T. Nikuni and S. Watabe, Two-step quantum search algorithm for solving traveling salesman problems. IEEE Trans. Quantum Eng. 6, 1–12 (2025). https://doi.org/10.1109/TQE.2025.3548706 [Google Scholar]
  21. I. A. Santo, S. C. Lim, M. S. Nabi, M. S. Hossen, H. Bannah and F. Kabir, Travelling salesman problem in the classical to quantum era: A comparative review of algorithms and computational complexity. Proc. InCIT (2025), 243–250. https://doi.org/10.1109/InCIT66780.2025.11276031 [Google Scholar]
  22. R Saini, A. Mani, M. S. Prasad, S. Bhattacharyya and J. Platos, Evolutionary algorithm for the traveling salesman problem with innovative encoding on hybrid quantum-classical machines. IEEE Access 13, 54223–54239 (2025). https://doi.org/10.1109/ACCESS.2025.3554690 [Google Scholar]
  23. P. Singh, Quantum wavefunction optimization algorithm: application in solving traveling salesman problem. Int. J. Mach. Learn. Cybern. 16, 3557–3585 (2025). https://doi.org/10.1007/s13042-024-02466-z [Google Scholar]
  24. B. Majid, S. A. Sofi and Z. Jabeen, Noise resilient quantum learning: adaptive policy guided error mitigation in quantum reinforcement learning for the traveling salesman problem. Appl. Soft Comput. 187, 114279 (2026). https://doi.org/10.1016/j.asoc.2025.114279 [Google Scholar]
  25. S. Chander, Comparative analysis of quantum approximate optimization algorithms for solving the travelling salesperson problem. Proc. qCCL (2025), 9–16. https://doi.org/10.1109/qCCL65142.2025.11159046 [Google Scholar]
  26. R. Xu and J.-C. Créput, Quantum self-organizing map for solving the Euclidean traveling salesman problem. Proc. CoDIT (2025), 2780–2785. https://doi.org/10.1109/CoDIT66093.2025.11321639 [Google Scholar]
  27. F. Fagiolo and N. Vescera, Ansatz optimization using simulated annealing in variational quantum algorithms for the traveling salesman problem. Proc. QAI (2025), 282–287. https://doi.org/10.1109/QAI63978.2025.00051 [Google Scholar]
  28. K. Smith-Miles, Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications. Appl. Math. Model. 142, 115965 (2025). https://doi.org/10.1016/j.apm.2025.115965 [Google Scholar]
  29. J. P. T. Stenger, S. T. Crowe, J. A. Diaz, R. Rodriguez, D. Gunlycke and J. N. Ptasinski, Efficient encoding of the traveling salesperson problem on a quantum computer. Quantum Rep. 7(3), 32 (2025). https://doi.org/10.3390/quantum7030032 [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.