Evidence map›Paper›PMID 42191747›Full record

ArticleScientific reports2026

A reinforcement learning-enhanced discrete zebra optimization algorithm for solving the traveling salesman problem.

Sajjad Ghatei, Shiva TaghipourEivazi, Ahmad Habibi Zadnavin, Ali Ghaffari

Abstract read
In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Sajjad GhateiDepartment of Computer Engineering, Ta.C., Islamic Azad University, Tabriz, Iran.
Shiva TaghipourEivaziDepartment of Computer Engineering, Ta.C., Islamic Azad University, Tabriz, Iran. taghipour@iau.ac.ir.
Ahmad Habibi ZadnavinDepartment of Computer Engineering, Ta.C., Islamic Azad University, Tabriz, Iran.
Ali GhaffariDepartment of Computer Engineering, Ta.C., Islamic Azad University, Tabriz, Iran.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In this study, a novel hybrid algorithm named the Reinforced Zebra Optimization Algorithm (RZOA) is proposed to solve the Traveling Salesman Problem (TSP). Initially, a discrete version of the Zebra Optimization Algorithm, referred to as DZOA, was developed, in which the continuous relationships of the original ZOA were transformed into a set of discrete operators to effectively update the routes. Subsequently, to enhance the intelligence of the operator selection process and to maintain a dynamic balance between exploration and exploitation, a mechanism based on Deep Reinforcement Learning was designed. Within the framework of the proposed RZOA, each zebra agent adaptively and self-learnedly makes decisions using a Deep Q-Network (DQN). Each agent observes both its own state and the overall population state, employs the DQN to select the optimal operator, and improves its decision-making policy dynamically through an experience replay memory. The state-action-reward structure was carefully designed to ensure an intelligent and balanced learning behavior between local and global search processes. The results of numerical experiments conducted on 42 standard benchmark datasets from the TSPLIB repository demonstrate that the proposed RZOA exhibits significant superiority over the compared algorithms in terms of solution quality, convergence speed, and performance stability. In particular, the proposed method achieves near-optimal performance with an average Percentage Deviation of the Best solution (PDB) below 1% and an average Percentage Deviation of the Average solution (PDA) typically below 0.5% for small and medium-scale instances, while maintaining PDA values within 4-5% for large-scale problems. Moreover, RZOA outperforms competing algorithms in the majority of benchmark cases, demonstrating superior robustness and consistency. Furthermore, the Friedman and Wilcoxon statistical analyses confirm this superiority at a 95% confidence level. Overall, by integrating the global search capability of the Zebra Optimization Algorithm with the adaptive decision-making power of the DQN, the proposed RZOA provides a novel, intelligent, and efficient approach for solving complex combinatorial optimization problems.

Indexed as

DiscretizationReinforcement LearningTraveling Salesman ProblemZebra Optimization Algorithm

Identifiers

PMID42191747
PMCPMC13522607

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.