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:

Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP
Soonchul Jung, Byung-Ro Moon
IEEE Transactions on Evolutionary Computation (2002) Vol. 6, Iss. 6, pp. 557-565
Closed Access | Times Cited: 62

Showing 26-50 of 62 citing articles:

An Indexed Bibliography of Genetic Algorithms in Economics
Jarmo T. Alander
(2012)
Closed Access | Times Cited: 8
Phenotype feedback genetic algorithm operators for heuristic encoding of snakes within hypercubes
Benjamin P. Carlson, Dean F. Hougen
(2010), pp. 791-798
Closed Access | Times Cited: 8
Problem-Independent Schema Synthesis for Genetic Algorithms
Yong-Hyuk Kim, Yung‐Keun Kwon, Byung-Ro Moon
Lecture notes in computer science (2003), pp. 1112-1122
Closed Access | Times Cited: 11
How autonomy oriented computing (AOC) tackles a computationally hard optimization problem
Xiao-Feng Xie, Jiming Liu
(2006), pp. 646-653
Closed Access | Times Cited: 9
A Survey on Chromosomal Structures and Operators for Exploiting Topological Linkages of Genes
Dong-il Seo, Byung-Ro Moon
Lecture notes in computer science (2003), pp. 1357-1368
Closed Access | Times Cited: 10
A novel memetic algorithm with random multi-local-search: a case study of TSP
Peng Zou, Zhi Zhou, Guoliang Chen, et al.
(2005), pp. 2335-2340
Closed Access | Times Cited: 9
The feature extraction of nonparametric curves based on niche genetic algorithms and multi-population competition
Wei Wei, Qi Wang, Hua Wang, et al.
Pattern Recognition Letters (2005) Vol. 26, Iss. 10, pp. 1483-1497
Closed Access | Times Cited: 9
A Quantitative Approach for Validating the Building-block Hypothesis
Chatchawit Aporntewan, Prabhas Chongstitvatana
(2005) Vol. 2, pp. 1403-1409
Open Access | Times Cited: 8
A Memetic-Clustering-Based Evolution Strategy for Traveling Salesman Problems
Yuping Wang, Jinhua Qin
Rough Sets and Knowledge Technology (2007), pp. 260-266
Closed Access | Times Cited: 7
A gestalt genetic algorithm
Christophe Philemotte, Hugues Bersini
(2007)
Closed Access | Times Cited: 7
Approaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms
Jyh-Da Wei
InTech eBooks (2008)
Open Access | Times Cited: 6
Evolutionary construction of de bruijn sequences
Meltem Sönmez Turan
(2011), pp. 81-86
Open Access | Times Cited: 5
A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application
Yan Pei, Hideyuki Takagi
(2011)
Open Access | Times Cited: 5
SDGP: A developmental approach for traveling salesman problems
Jin Ouyang, Thomas Weise, Alexandre Devert, et al.
(2013), pp. 78-85
Closed Access | Times Cited: 4
Ant-Based Crossover for Permutation Problems
Jürgen Branke, Christiane Barz, Ivesa Behrens
Lecture notes in computer science (2003), pp. 754-765
Open Access | Times Cited: 8
Finding the Optimal Gene Order in Displaying Microarray Data
Seung‐Kyu Lee, Yong-Hyuk Kim, Byung-Ro Moon
Lecture notes in computer science (2003), pp. 2215-2226
Closed Access | Times Cited: 8
Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems
Ziauddin Ursani, Daryl Essam, David Cornforth, et al.
INFOR Information Systems and Operational Research (2009) Vol. 47, Iss. 2, pp. 133-149
Closed Access | Times Cited: 4
An Evolutionary Approach for the TSP and the TSP with Backhauls
Haldun Süral, Nur Evin Özdemirel, Ýlter Önder, et al.
Adaptation, learning, and optimization (2010), pp. 371-396
Closed Access | Times Cited: 4
Tensorial Evolutionary Computation for Spatial Optimization Problems
Si-Chao Lei, Xiaolin Xiao, Yue‐Jiao Gong, et al.
IEEE Transactions on Artificial Intelligence (2022) Vol. 5, Iss. 1, pp. 154-166
Closed Access | Times Cited: 3
Logic programming for combinatorial problems
Toshinori Munakata, Roman Barták
Artificial Intelligence Review (2009) Vol. 33, Iss. 1-2, pp. 135-150
Closed Access | Times Cited: 3
Study on Dynamic Slotting Optimization in Storage System
Xin Min Zhang, Jing Hou, Hui Zhi Ren
Advanced materials research (2014) Vol. 933, pp. 260-264
Closed Access | Times Cited: 2
Reliable Network Design Using Hybrid Genetic Algorithm Based on Multi-Ring Encoding
Jin-Myung Won, Alice R. Malisia, Fakhreddine Karray
Adaptation, learning, and optimization (2010), pp. 609-635
Closed Access | Times Cited: 2
The Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic Algorithm
Nagham A. Al-Madi, Ahamad Tajudin Khader
Journal of Computer Science (2008) Vol. 4, Iss. 10, pp. 871-876
Closed Access | Times Cited: 2
A novel globally convergent hybrid evolutionary algorithm for traveling salesman problems
Yu‐Ping Wang, Yinghua Li, Chuangyin Dang
(2005)
Closed Access | Times Cited: 2
A Clustering-Based Evolutionary Algorithm for Traveling Salesman Problem
Dalian Liu, Xinfeng Wang, Jinling Du
(2009), pp. 118-122
Closed Access | Times Cited: 1

Scroll to top