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:

An improved genetic algorithm for multiple traveling salesman problem
Wei Zhou, Yuanzong Li
(2010), pp. 493-495
Closed Access | Times Cited: 16

Showing 16 citing articles:

A comparative study of improved GA and PSO in solving multiple traveling salesmen problem
Honglu Zhou, Mingli Song, Witold Pedrycz
Applied Soft Computing (2017) Vol. 64, pp. 564-580
Closed Access | Times Cited: 134

A Hybrid Estimation of Distribution Algorithm with Decomposition for Solving the Multiobjective Multiple Traveling Salesman Problem
Vui Ann Shim, Kay Chen Tan, C. Y. Cheong
IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) (2012) Vol. 42, Iss. 5, pp. 682-691
Closed Access | Times Cited: 112

A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
Kin-Ming Lo, Wei-Ying Yi, Pak-Kan Wong, et al.
International Journal of Computational Intelligence Systems (2018) Vol. 11, Iss. 1, pp. 692-692
Open Access | Times Cited: 38

A New Multiple Traveling Salesman Problem and Its Genetic Algorithm-Based Solution
Jun Li, Qirui Sun, MengChu Zhou, et al.
(2013), pp. 627-632
Closed Access | Times Cited: 43

A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem
Vui Ann Shim, Kay Chen Tan, K.K. Tan
(2012) Vol. 171, pp. 1-8
Closed Access | Times Cited: 33

Solving Multiple Traveling Salesman Problem using the Gravitational Emulation Local Search Algorithm
Farahnaz Rostami, Farahnaz Mohanna, Hengameh Keshavarz, et al.
Applied Mathematics & Information Sciences (2015) Vol. 09, Iss. 2, pp. 699-709
Closed Access | Times Cited: 33

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
Hossein Larki, Majid Yousefikhoshbakht
DOAJ (DOAJ: Directory of Open Access Journals) (2014)
Closed Access | Times Cited: 19

An improved genetic algorithm for wireless sensor networks localization
Yang Gao, Yi Zhuang, NI Tian-quan, et al.
(2010)
Closed Access | Times Cited: 18

An opposition-based self-adaptive differential evolution with decomposition for solving the multiobjective multiple salesman problem
Jin Kiat Chong, Xin Qiu
2022 IEEE Congress on Evolutionary Computation (CEC) (2016)
Closed Access | Times Cited: 8

Genetic Algorithm to Optimize Solid Waste Collection
Kabil Bhargava, Anupam Singhal, Rajiv Kumar Gupta, et al.
Proceedings of the International Conference of Recent Trends in Environmental Science and Engineering (2019)
Open Access | Times Cited: 6

Improved Genetic Algorithm (VNS-GA) using polar coordinate classification for workload balanced multiple Traveling Salesman Problem (mTSP)
Y.D. Wang, Xueqin Lü, J.R. Shen
Advances in Production Engineering & Management (2021) Vol. 16, Iss. 2, pp. 173-184
Open Access | Times Cited: 6

Solving Multiple Vehicle Routing Problems with Time Constraintsby Flower Pollination Algorithm Optimization
Supaporn Suwannarongsri
WSEAS TRANSACTIONS ON SYSTEMS (2020) Vol. 19, pp. 178-187
Closed Access | Times Cited: 5

Efficient trip scheduling algorithms for groups
Roksana Jahan, Tanzima Hashem, Flora D. Salim, et al.
Information Systems (2019) Vol. 84, pp. 145-173
Closed Access | Times Cited: 3

Revisiting Traveling Salesman Problem (TSP): Analysis of GA and SA based Solutions
Darius Bethel, Hakkı Erhan Sevil
International Journal of Recent Contributions from Engineering Science & IT (iJES) (2021) Vol. 9, Iss. 2, pp. 44-44
Open Access

Page 1

Scroll to top