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:
A new approach to the traveling salesman problem using genetic algorithms with priority encoding
Jyh-Da Wei, Dong-Hyun Lee
(2005), pp. 1457-1464
Closed Access | Times Cited: 15
Jyh-Da Wei, Dong-Hyun Lee
(2005), pp. 1457-1464
Closed Access | Times Cited: 15
Showing 15 citing articles:
A combinatorial Artificial Bee Colony algorithm for traveling salesman problem
Derviş Karaboğa, Beyza Görkemli
International Symposium on Innovations in Intelligent SysTems and Applications (2011), pp. 50-53
Closed Access | Times Cited: 171
Derviş Karaboğa, Beyza Görkemli
International Symposium on Innovations in Intelligent SysTems and Applications (2011), pp. 50-53
Closed Access | Times Cited: 171
Solving Traveling Salesman Problem by Using Combinatorial Artificial Bee Colony Algorithms
Derviş Karaboğa, Beyza Görkemli
International Journal of Artificial Intelligence Tools (2019) Vol. 28, Iss. 01, pp. 1950004-1950004
Closed Access | Times Cited: 62
Derviş Karaboğa, Beyza Görkemli
International Journal of Artificial Intelligence Tools (2019) Vol. 28, Iss. 01, pp. 1950004-1950004
Closed Access | Times Cited: 62
An Improved Immune-Genetic Algorithm for the Traveling Salesman Problem
Jingui Lu, Ning Fang, Dinghong Shao, et al.
(2007), pp. 297-301
Closed Access | Times Cited: 24
Jingui Lu, Ning Fang, Dinghong Shao, et al.
(2007), pp. 297-301
Closed Access | Times Cited: 24
A Hybrid Cultural Algorithm with Local Search for Traveling Salesman Problem
Yong-Jun Kim, Sung‐Bae Cho
(2009) Vol. 1, pp. 188-192
Closed Access | Times Cited: 14
Yong-Jun Kim, Sung‐Bae Cho
(2009) Vol. 1, pp. 188-192
Closed Access | Times Cited: 14
A similarity-based mechanism to control genetic algorithm and local search hybridization to solve traveling salesman problem
Marjan Kuchaki Rafsanjani, Sadegh Eskandari, Arsham Borumand Saeid
Neural Computing and Applications (2014) Vol. 26, Iss. 1, pp. 213-222
Closed Access | Times Cited: 11
Marjan Kuchaki Rafsanjani, Sadegh Eskandari, Arsham Borumand Saeid
Neural Computing and Applications (2014) Vol. 26, Iss. 1, pp. 213-222
Closed Access | Times Cited: 11
Immune-Genetic Algorithm for Traveling Salesman Problem
Jingui Lu, Min Xie
InTech eBooks (2010)
Open Access | Times Cited: 8
Jingui Lu, Min Xie
InTech eBooks (2010)
Open Access | Times Cited: 8
Design and applications of an algorithm benchmark system in a computational problem solving environment
Mingyu Chen, Jyh-Da Wei, Jeng-Hung Huang, et al.
ACM SIGCSE Bulletin (2006) Vol. 38, Iss. 3, pp. 123-127
Closed Access | Times Cited: 10
Mingyu Chen, Jyh-Da Wei, Jeng-Hung Huang, et al.
ACM SIGCSE Bulletin (2006) Vol. 38, Iss. 3, pp. 123-127
Closed Access | Times Cited: 10
Approaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms
Jyh-Da Wei
InTech eBooks (2008)
Open Access | Times Cited: 6
Jyh-Da Wei
InTech eBooks (2008)
Open Access | Times Cited: 6
ANALYSIS AND SYNTHESIS OF ENHANCED ANT COLONY OPTIMIZATION WITH THE TRADITIONAL ANT COLONY OPTIMIZATION TO SOLVE TRAVELLING SALES PERSON PROBLEM
Pallavi Arora, Harjeet Kaur, Prateek Agrawal
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (2011) Vol. 1, Iss. 1, pp. 88-92
Open Access | Times Cited: 3
Pallavi Arora, Harjeet Kaur, Prateek Agrawal
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (2011) Vol. 1, Iss. 1, pp. 88-92
Open Access | Times Cited: 3
A Comparative Study of Machine Learning Heuristic Algorithms to Solve the Traveling Salesman Problem
Volkan Uslan, İhsan Ömür Bucak
(2010)
Closed Access | Times Cited: 2
Volkan Uslan, İhsan Ömür Bucak
(2010)
Closed Access | Times Cited: 2
Compressed UAV sensing for flood monitoring by solving the continuous travelling salesman problem over hyperspectral maps
Pablo Casaseca‐de‐la‐Higuera, Antonio Tristán‐Vega, Susana Merino-Caviedes, et al.
(2018) Vol. 7, pp. 12-12
Open Access | Times Cited: 2
Pablo Casaseca‐de‐la‐Higuera, Antonio Tristán‐Vega, Susana Merino-Caviedes, et al.
(2018) Vol. 7, pp. 12-12
Open Access | Times Cited: 2
Enhanced Bee Colony Algorithm for Solving Travelling Salesperson Problem
Prateek Agrawal
International Journal of Control Theory and Computer Modeling (2012) Vol. 2, Iss. 4, pp. 37-41
Open Access | Times Cited: 1
Prateek Agrawal
International Journal of Control Theory and Computer Modeling (2012) Vol. 2, Iss. 4, pp. 37-41
Open Access | Times Cited: 1
Optimization of Couriers’ Routes by Determining Best Route for Distributing Parcels in Urban Traffic
Piotr Chrzczonowicz, Marek Woda
Advances in intelligent systems and computing (2015), pp. 117-129
Closed Access
Piotr Chrzczonowicz, Marek Woda
Advances in intelligent systems and computing (2015), pp. 117-129
Closed Access
ANALYSIS AND SYNTHESIS OF ENHANCED BEE COLONY OPTIMIZATION WITH THE TRADITIONAL BEE COLONY OPTIMIZATION TO SOLVE TRAVELLING SALES PERSON PROBLEM
Prateek Agrawal, Harjeet Kaur, Deepa Bhardwaj
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (2012) Vol. 2, Iss. 2, pp. 93-97
Open Access
Prateek Agrawal, Harjeet Kaur, Deepa Bhardwaj
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (2012) Vol. 2, Iss. 2, pp. 93-97
Open Access
Optimal Route in Distribution of Telecommunications Networks Based on Genetic Algorithm with Integer Chromosomes, a Practical Application
J.E. Medina, Luis García-Santander, Macarena Retamal, et al.
(2006), pp. 33-33
Closed Access
J.E. Medina, Luis García-Santander, Macarena Retamal, et al.
(2006), pp. 33-33
Closed Access
