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:

Efficient hybrid local search heuristics for solving the travelling thief problem
Alenrex Maity, Swagatam Das
Applied Soft Computing (2020) Vol. 93, pp. 106284-106284
Closed Access | Times Cited: 23

Showing 23 citing articles:

Social learning discrete Particle Swarm Optimization based two-stage X-routing for IC design under Intelligent Edge Computing architecture
Genggeng Liu, Xiaohua Chen, Ruping Zhou, et al.
Applied Soft Computing (2021) Vol. 104, pp. 107215-107215
Closed Access | Times Cited: 42
A weighted-sum method for solving the bi-objective traveling thief problem
Jonatas B. C. Chagas, Markus Wagner
Computers & Operations Research (2021) Vol. 138, pp. 105560-105560
Open Access | Times Cited: 28
On the use of quality diversity algorithms for the traveling thief problem
Adel Nikfarjam, Aneta Neumann, Frank Neumann
Proceedings of the Genetic and Evolutionary Computation Conference (2022), pp. 260-268
Open Access | Times Cited: 20
Evolutionary diversity optimisation for the traveling thief problem
Adel Nikfarjam, Aneta Neumann, Frank Neumann
Proceedings of the Genetic and Evolutionary Computation Conference (2022), pp. 749-756
Open Access | Times Cited: 13
A modified nature-inspired meta-heuristic methodology for heterogeneous unmanned aerial vehicle system task assignment problem
Chen-Chen Fan, Song Han, Xinbin Li, et al.
Soft Computing (2021) Vol. 25, Iss. 22, pp. 14227-14243
Closed Access | Times Cited: 15
Multi-Objective Five-Element Cycle Optimization Algorithm Based on Multi-Strategy Fusion for the Bi-Objective Traveling Thief Problem
Yue Xiang, Jingjing Guo, Chao Jiang, et al.
Applied Sciences (2024) Vol. 14, Iss. 17, pp. 7468-7468
Open Access | Times Cited: 1
Solving travelling thief problems using coordination based methods
Majid Namazi, M. A. Hakim Newton, Conrad Sanderson, et al.
Journal of Heuristics (2023) Vol. 29, Iss. 4-6, pp. 487-544
Open Access | Times Cited: 3
Solving the Traveling Thief Problem Based on Item Selection Weight and Reverse-Order Allocation
Zitong Zhang, Lei Yang, Peipei Kang, et al.
IEEE Access (2021) Vol. 9, pp. 54056-54066
Open Access | Times Cited: 6
A Sequence-Based Hyper-Heuristic for Traveling Thieves
D. Rodrı́guez, Jorge M. Cruz‐Duarte, José Carlos Ortíz-Bayliss, et al.
Applied Sciences (2022) Vol. 13, Iss. 1, pp. 56-56
Open Access | Times Cited: 4
The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms
Thilina Pathirage Don, Aneta Neumann, Frank Neumann
Proceedings of the Genetic and Evolutionary Computation Conference (2024), pp. 214-222
Closed Access
Five-Element Cycle Optimization Algorithm Based on an Integrated Mutation Operator for the Traveling Thief Problem
Yue Xiang, Jingjing Guo, Zhengyan Mao, et al.
Symmetry (2024) Vol. 16, Iss. 9, pp. 1153-1153
Open Access
Travelling thief problem: a survey of recent variants, solution approaches and future directions
Tamalika Sarkar, Chandrasekharan Rajendran
International Journal of Systems Science Operations & Logistics (2024) Vol. 11, Iss. 1
Closed Access
On the Use of Quality Diversity Algorithms for the Travelling Thief Problem
Adel Nikfarjam, Aneta Neumann, Frank Neumann
ACM Transactions on Evolutionary Learning and Optimization (2024) Vol. 4, Iss. 2, pp. 1-22
Open Access
NSGAII for Travelling Thief Problem with Dropping Rate
Rani Kumari, Kamal Srivastava
2022 6th International Conference on Intelligent Computing and Control Systems (ICICCS) (2023)
Closed Access | Times Cited: 1
Efficiently Solving the Bi-Objective Traveling Thief Problem Using Imperialist Competitive Algorithm: Case of Small Instances
Payman Rabiei, Seyed Hadi Mirghaderi, Daniel Arias Aranda
(2023)
Closed Access | Times Cited: 1
Elitist random swapped particle swarm optimization embedded with variable k-nearest neighbour classification: a new PSO variant applied to gene identification
Biswajit Jana, Sriyankar Acharyya
Soft Computing (2022) Vol. 27, Iss. 6, pp. 3169-3201
Closed Access | Times Cited: 2
On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods
Gloria Cerasela Crişan, Elena Nechita, Dana Simian
IEEE Access (2021) Vol. 9, pp. 5312-5331
Open Access | Times Cited: 2
Generating instances with performance differences for more than just two algorithms
Jakob Bossek, Markus Wagner
Proceedings of the Genetic and Evolutionary Computation Conference Companion (2021), pp. 1423-1432
Open Access | Times Cited: 2
Hyper-Heuristic Approaches for the Travelling Thief Problem
Fathelrahman Ali, Mohamedelfatih Mohamedkhair
2020 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE) (2021) Vol. 19, pp. 1-6
Closed Access | Times Cited: 2
Comparing ALNS and NSGA-II on Bi-Objective Travelling Thief Problem
Kazım Erdoğdu
(2023)
Open Access
A weighted-sum method for solving the bi-objective traveling thief problem
Jonatas B. C. Chagas, Markus Wagner
arXiv (Cornell University) (2020)
Closed Access
Hybrid Evolutionary Algorithm for Travelling Thief Problem
Neeraj Pathak, R. Thanga Pradeep Kumar
(2020) Vol. 19, Iss. 2, pp. 132-140
Closed Access
Solving the Travelling Thief Problem based on Item Selection Weight and Reverse Order Allocation
Lei Yang, Zitong Zhang, Xiaotian Jia, et al.
arXiv (Cornell University) (2020)
Open Access
Page 1

Scroll to top