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:

A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem
Jonatas B. C. Chagas, Julian Blank, Markus Wagner, et al.
Journal of Heuristics (2020) Vol. 27, Iss. 3, pp. 267-301
Closed Access | Times Cited: 19

Showing 19 citing articles:

Biased random-key genetic algorithms: A review
Mariana A. Londe, Luciana Fontes Pessôa, Carlos E. Andrade, et al.
European Journal of Operational Research (2024) Vol. 321, Iss. 1, pp. 1-22
Open Access | Times Cited: 11
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
A bi-objective multi-population biased random key genetic algorithm for joint scheduling quay cranes and speed adjustable vehicles in container terminals
Dalila B.M.M. Fontes, Seyed Mahdi Homayouni
Flexible Services and Manufacturing Journal (2022) Vol. 35, Iss. 1, pp. 241-268
Closed Access | Times Cited: 12
BrkgaCuda 2.0: a framework for fast biased random-key genetic algorithms on GPUs
Bruno Oliveira, Eduardo C. Xavier, Edson Borin
Soft Computing (2024)
Closed Access | Times Cited: 1
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
A comparative study of evolutionary approaches to the bi-objective dynamic Travelling Thief Problem
Daniel Herring, Michael Kirley, Xin Yao
Swarm and Evolutionary Computation (2023) Vol. 84, pp. 101433-101433
Open Access | Times Cited: 2
The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms
Ragav Sachdeva, Frank Neumann, Markus Wagner
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 5
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
Exact and heuristic approaches for the root sequence index allocation problem
Mariana A. Londe, Carlos E. Andrade, Luciana Fontes Pessôa
Applied Soft Computing (2022) Vol. 130, pp. 109634-109634
Closed Access | Times Cited: 3
Evolutionary approaches with adaptive operators for the bi-objective TTP
Roberto Santana, Sidhartha Shakya
2021 IEEE Symposium Series on Computational Intelligence (SSCI) (2022)
Closed Access | Times Cited: 3
Solving biobjective traveling thief problems with multiobjective reinforcement learning
Gemilang Santiyuda, Retantyo Wardoyo, Reza Pulungan
Applied Soft Computing (2024) Vol. 161, pp. 111751-111751
Closed Access
An Evolutionary Algorithm Applied to the Bi-Objective Travelling Salesman Problem
Luis Henrique Pauleti Mendes, Fábio Luiz Usberti, Mário César San Felice
Lecture notes in computer science (2023), pp. 519-524
Closed Access | Times Cited: 1
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
An MOEA/D-ACO Algorithm with Finite Pheromone Weights for Bi-objective TTP
Lei Yang, Xiaotian Jia, Rui Xu, et al.
Communications in computer and information science (2021), pp. 468-482
Closed Access | Times Cited: 3
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
Biased Random-Key Genetic Algorithms: A Review
Mariana A. Londe, Luciana Fontes Pessôa, Carlos E. Andrade, et al.
arXiv (Cornell University) (2023)
Open Access
BrkgaCuda 2.0
Bruno Almêda de Oliveira
(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
BrkgaCuda 2.0: A Framework for Fast Biased Random-Key Genetic Algorithms on GPUs
Bruno Almêda de Oliveira, Eduardo C. Xavier, Edson Borin
Research Square (Research Square) (2022)
Open Access
Page 1

Scroll to top