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:

Evolutionary algorithm to traveling salesman problems
Yen-Far Liao, Dun-Han Yau, Chieh‐Li Chen
Computers & Mathematics with Applications (2012) Vol. 64, Iss. 5, pp. 788-797
Open Access | Times Cited: 62

Showing 26-50 of 62 citing articles:

Free-form surface inspection path planning using improved ant colony optimisation algorithm
Yueping Chen, Bo Tan
Engineering Research Express (2022) Vol. 4, Iss. 3, pp. 035039-035039
Open Access | Times Cited: 4

Optimal Sensor Placement Based on Relaxation Sequential Algorithm
Hong Yin, Kangli Dong, Anqi Pan, et al.
Communications in computer and information science (2017), pp. 125-134
Closed Access | Times Cited: 5

Constructive and Clustering Methods to Solve Capacitated Vehicle Routing Problem
M. A. H. Akhand, Tanzima Sultatana, M. I. R. Shuvo, et al.
Oriental journal of computer science and technology (2017) Vol. 10, Iss. 3, pp. 549-562
Open Access | Times Cited: 5

Using Evolving Algorithms to Cryptanalysis Nonlinear Cryptosystems
Riyam Noori Jawad, Faez Hassan Ali
Baghdad Science Journal (2020) Vol. 17, Iss. 2(SI), pp. 0682-0682
Open Access | Times Cited: 5

A Multi-objective Iterated Local Search Approach to Solve the Insular Traveling Salesman Problem
Sebastian Rodriguez-Zbinden, Elizabeth Montero, Carola Blázquez, et al.
2022 IEEE Congress on Evolutionary Computation (CEC) (2021), pp. 2339-2346
Closed Access | Times Cited: 5

Algorithms and Methods Inspired from Nature for Solving Supply Chain and Logistics Optimization Problems
Georgios Dounias, Vassilios S. Vassiliadis
International Journal of Natural Computing Research (2014) Vol. 4, Iss. 3, pp. 26-51
Closed Access | Times Cited: 4

A dual local search framework for combinatorial optimization problems with TSP application
Jamal Ouenniche, P. K. Ramaswamy, Michel Gendreau
Journal of the Operational Research Society (2017) Vol. 68, Iss. 11, pp. 1377-1398
Open Access | Times Cited: 4

Cryptanalysis of Stream Cipher Cryptosystem Based on Soft Computing Techniques
Prof .DrSalim Ali Abbas Al-Ageelee, RiyamNoori Jwad
IOSR Journal of Computer Engineering (2017) Vol. 19, Iss. 01, pp. 78-84
Open Access | Times Cited: 4

A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem
Muhammad Isnaini Hadiyul Umam, Budi Santosa
IOP Conference Series Materials Science and Engineering (2018) Vol. 337, pp. 012005-012005
Open Access | Times Cited: 4

Algorithms and Methods Inspired from Nature for Solving Supply Chain and Logistics Optimization Problems
Georgios Dounias, Vassilios S. Vassiliadis
IGI Global eBooks (2015), pp. 245-275
Closed Access | Times Cited: 3

Advances on Particle Swarm Optimization in Solving Discrete Optimization Problems
M. A. H. Akhand, Md. Masudur Rahman, Nazmul Siddique
Studies in computational intelligence (2022), pp. 59-88
Closed Access | Times Cited: 3

Evolutionary Algorithm with Cross-Generation Environmental Selection for Traveling Salesman Problem
Zi Yang Bo, Qiang Yang, Ya-Hui Jia, et al.
Proceedings of the Genetic and Evolutionary Computation Conference Companion (2024), pp. 635-638
Closed Access

Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks
Hongzong Li, Jiasen Wang, Jun Wang
(2021), pp. 456-465
Closed Access | Times Cited: 4

Traveling Salesman Problem of optimal debris removal sequence using non-population gradient search
Liqiang Hou, Arun K. Misra
Acta Astronautica (2023) Vol. 215, pp. 373-386
Closed Access | Times Cited: 1

Computational Intelligence and Combinatorial Optimization Problems in Transportation Science
Manolis N. Kritikos, Pantelis Z. Lappas
Learning and analytics in intelligent systems (2020), pp. 325-367
Closed Access | Times Cited: 3

A Discrete Particle Swarm Optimization Algorithm for Archipelago Berth Allocation Problem
Jianliang Peng, LI Ren-jian
Journal of Computers (2014) Vol. 9, Iss. 7
Closed Access | Times Cited: 2

The Applicability of Genetic Algorithm in Cryptanalysis: A Survey
Asif Hameed, Auqib Hamid, Firdoos Ahmad
International Journal of Computer Applications (2015) Vol. 130, Iss. 9, pp. 42-46
Open Access | Times Cited: 2

Solving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
A. Salehi, Behrooz Masoumi
Journal of artificial intelligence and data mining (2020) Vol. 8, Iss. 3, pp. 313-329
Closed Access | Times Cited: 2

Iterated local search adapted to clustering and routing problems
Mariana de Siqueira Guersola, María Teresinha Arns Steiner
(2015), pp. 1-6
Closed Access | Times Cited: 1

ANN Based Features Selection Approach Using Hybrid GA-PSO for Sirna Design
Ranjan Sarmah, Mahendra Kumar Modi, Shahin Ara Begum
International Journal of Computer Science and Information Technology (2017) Vol. 9, Iss. 4, pp. 57-75
Open Access | Times Cited: 1

An Improved Hybrid Particle Swarm Optimization for Travel Salesman Problem
Bo Wei, Ying Xing, Xuewen Xia, et al.
Communications in computer and information science (2020), pp. 514-525
Closed Access | Times Cited: 1

Path Planning of Armor Cash Carrier Based on Intelligent Algorithm
Leqian Wu
2021 IEEE International Conference on Emergency Science and Information Technology (ICESIT) (2021), pp. 329-332
Closed Access | Times Cited: 1

Scroll to top