Skip to main content


Log in

Application of proposed hybrid active genetic algorithm for optimization of traveling salesman problem

  • Application of soft computing
  • Published:
Soft Computing Aims and scope Submit manuscript


In the technological development era, the solution to various complex problems is uncertain, and more attention should be paid for changing certain conditions. Therefore, a precise solution to a complex problem is critical. The traveling salesman problem (TSP) is often fuse for an outbreak of a better solution. Inspired by the successful genetic algorithm (GA) applications, this study proposes a new approach to improve the convergence rate by incorporating a unique feature, namely 'sub-tour division'. The new method consists of multiple zones of TSPs (i.e., active and inactive), which are used to sort and group the critical region for finding the solutions. To illustrate the performance of the new approach, the traveling distance between various cities in India is considered as a problem. The simulation findings show that the new approach provides a more accurate and robust solution to a complex problem than alternative methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Data availability

The datasets generated and analyzed during the current study are available from the corresponding author on reasonable request.


Download references


The corresponding author is grateful to the co-authors for their suggestions at every study stage.


There is no specific funding from any provider source for this study.

Author information

Authors and Affiliations



R.J. and K.P.S. conceptualized and designed the study, analyzed the data, and drafted and revised the manuscript. R.J., A.M., K.B.R., M.L.M.E., G.S.D. and X.G. reviewed and critically revised the manuscript. All authors approved the submission of the final manuscript.

Corresponding author

Correspondence to Rahul Jain.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jain, R., Singh, K.P., Meena, A. et al. Application of proposed hybrid active genetic algorithm for optimization of traveling salesman problem. Soft Comput 27, 4975–4985 (2023).

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: