Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Genetic algorithm for Traveling Salesman Problem
Haojie Xu, Yisu Ge, Guodao Zhang
(2022), pp. 33-40
Closed Access | Times Cited: 41

Showing 26-50 of 41 citing articles:

Supply Center Planning Model Using Fuzzy-AHP and VRP
Heung-Suk Hwang, Bae-Suk Choi, Kiwook Lee, et al.
(2008), pp. 109-109
Closed Access | Times Cited: 4
A new genetic algorithm for routing the shortest route via several designated points
J. Inagaki, Miki Haseyama, H. Kitajima
(2002)
Closed Access | Times Cited: 5
Genetic coding for solving both the stacker crane problem and its k-variant
Lei Zheng, Weimin Zheng
(2002) Vol. 2, pp. 1061-1066
Closed Access | Times Cited: 5
A combination of genetic algorithm and simulated evolution techniques for clustering
Jay Bhuyan
(1995)
Open Access | Times Cited: 6
Intelligent control based on genetic algorithms-case study on mobile robot
Qingchun Meng, Sng Honglian, Changjiu Zhou, et al.
(2002), pp. 252-256
Closed Access | Times Cited: 4
An Improved Immune Genetic Algorithm and its Application on TSP
Ahmed S. Ghorab
(2021), pp. 84-88
Closed Access | Times Cited: 2
Cluster-based routing using Bacteriologic Algorithm in Wireless Sensor Network
Rati Wongsathan, Isaravuth Seedadan, Sutichart Pattarangoon
(2010), pp. V1-9
Closed Access | Times Cited: 1
An IoT network coordinated AI engine to produce loading and delivery schedules for capacitated vehicle routing problems
Ernesto Gutierrez-Miravete, A. Satyanarayana Murthy
2021 International Conference on Computational Science and Computational Intelligence (CSCI) (2020), pp. 1075-1081
Closed Access | Times Cited: 1
GA-based Applications for Routing with an Upper Bound Constraint
J. Inagaki, Miki Haseyama
1993 IEEE International Symposium on Circuits and Systems (2005) Vol. e84 d, pp. 2239-2242
Closed Access | Times Cited: 1
A GA-based routing method with an upper bound constraint
J. Inagaki, Miki Haseyama, H. Kitajima
(2003) Vol. 2, pp. II-491
Closed Access | Times Cited: 1
Local Disaster Mitigation Technology with Travel Support Application

Proceedings of the ... International ISCRAM Conference (2023)
Open Access
Genetic computing for the film copy deliverer problem
Lei Zhang, Weimin Zheng
(2002)
Closed Access | Times Cited: 1
Notice of Retraction: Impact of the number of generations on the fitness value and the time required to find the optimal solution in standard GA applications
Ivana Stojanovska, Agni Dika
(2010), pp. 589-593
Closed Access
Dedicated hardware architecture for cycle crossover operation
Masaya Yoshikawa, Kentaro Otsuka, Hidekazu Terai
(2008), pp. 338-341
Closed Access
Optimization of Transportation Schedule
Aatmaj Janardanan, Deepa Rajendran, Varun Menon Nallur
2018 International Conference on Emerging Trends and Innovations In Engineering And Technological Research (ICETIETR) (2018), pp. 1-4
Closed Access

Yoshihide Sekimoto, Ryosuke Shibasaki
Theory and Applications of GIS (2003) Vol. 11, Iss. 2, pp. 123-132
Open Access
Previous Page - Page 2

Scroll to top