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:

Integrating estimation of distribution algorithms versus Q-learning into Meta-RaPS for solving the 0-1 multidimensional knapsack problem
Arif Arin, Ghaith Rabadi
Computers & Industrial Engineering (2016) Vol. 112, pp. 706-720
Closed Access | Times Cited: 19

Showing 19 citing articles:

Solving the optimal path planning of a mobile robot using improved Q-learning
Ee Soong Low, Pauline Ong, Kah Chun Cheah
Robotics and Autonomous Systems (2019) Vol. 115, pp. 143-161
Closed Access | Times Cited: 267
A Survey of Learning-Based Intelligent Optimization Algorithms
Wei Li, Gai‐Ge Wang, Amir H. Gandomi
Archives of Computational Methods in Engineering (2021) Vol. 28, Iss. 5, pp. 3781-3799
Closed Access | Times Cited: 188
Q-learning approach to coordinated optimization of passenger inflow control with train skip-stopping on a urban rail transit line
Zhibin Jiang, Jinjing Gu, Wei Fan, et al.
Computers & Industrial Engineering (2018) Vol. 127, pp. 1131-1142
Closed Access | Times Cited: 77
Reinforcement learning for the traveling salesman problem with refueling
André Luiz Carvalho Ottoni, Erivelton G. Nepomuceno, Marcos Santos de Oliveira, et al.
Complex & Intelligent Systems (2021) Vol. 8, Iss. 3, pp. 2001-2015
Open Access | Times Cited: 48
Enhancing Stability and Performance in Mobile Robot Path Planning with PMR-Dueling DQN Algorithm
Demelash Abiye Deguale, Lingli Yu, Melikamu Liyih Sinishaw, et al.
Sensors (2024) Vol. 24, Iss. 5, pp. 1523-1523
Open Access | Times Cited: 7
The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches
Soukaina Laabadi, Mohamed Naïmi, Hassan El Amri, et al.
American Journal of Operations Research (2018) Vol. 08, Iss. 05, pp. 395-439
Open Access | Times Cited: 33
Tuning of reinforcement learning parameters applied to SOP using the Scott–Knott method
André Luiz Carvalho Ottoni, Erivelton G. Nepomuceno, Marcos Santos de Oliveira, et al.
Soft Computing (2019) Vol. 24, Iss. 6, pp. 4441-4453
Closed Access | Times Cited: 31
Intelligent Control/Operational Strategies in WWTPs through an Integrated Q-Learning Algorithm with ASM2d-Guided Reward
Ji-Wei Pang, Shanshan Yang, Lei He, et al.
Water (2019) Vol. 11, Iss. 5, pp. 927-927
Open Access | Times Cited: 30
A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem
Zuocheng Li, Lixin Tang, Jiyin Liu
IEEE Transactions on Cybernetics (2020) Vol. 52, Iss. 4, pp. 2284-2299
Open Access | Times Cited: 30
Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics
Broderick Crawford, Ricardo Soto, José Lemus-Romani, et al.
Mathematics (2021) Vol. 9, Iss. 16, pp. 1839-1839
Open Access | Times Cited: 25
A Pareto evolutionary algorithm based on incremental learning for a kind of multi-objective multidimensional knapsack problem
Rong-juan Luo, Wang Jia, Baolin Zhu
Computers & Industrial Engineering (2019) Vol. 135, pp. 537-559
Closed Access | Times Cited: 16
Random mask-based estimation of the distribution algorithm for stacked auto-encoder one-step pre-training
Qingyang Xu, Anbang Liu, Xianfeng Yuan, et al.
Computers & Industrial Engineering (2021) Vol. 158, pp. 107400-107400
Closed Access | Times Cited: 4
An Improved Fruit Fly Optimization Algorithm for Solving Multidimensional Knapsack Problem
Hao Qian, Qingyong Zhang
(2018), pp. 2494-2499
Closed Access | Times Cited: 3
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem
Xunhao Gu, Songzheng Zhao, Yang Wang
Discrete Optimization (2021) Vol. 44, pp. 100625-100625
Closed Access | Times Cited: 3
Análise do desempenho do aprendizado por reforço na solução do problema da mochila multidimensional
André Luiz Carvalho Ottoni, Erivelton G. Nepomuceno, Marcos Santos de Oliveira
Revista Brasileira de Computação Aplicada (2017) Vol. 9, Iss. 3, pp. 56-56
Open Access | Times Cited: 2
A Hybrid Metaheuristic of Integrating Estimation of Distribution Algorithm with Tabu Search for the Max-Mean Dispersion Problem
Dieudonné Nijimbere, Songzheng Zhao, Haichao Liu, et al.
Mathematical Problems in Engineering (2019) Vol. 2019, Iss. 1
Open Access | Times Cited: 1
Optimization of Buffer Design for Multi-Product Flow Production Lines Based on Simulation and Reinforcement Learning
Jong-Hwan Choi, Jisoo Park, Sang Do Noh, et al.
(2023)
Closed Access
APPLICATIONS OF PARTICLE SWARM OPTIMIZATION IN WIRELESS COMMUNICATION SYSTEM
THEOPHILUS ANIEMEKA ENEM, DEPO OLUKAYODE OYAJIDE
i-manager’s Journal on Wireless Communication Networks (2020) Vol. 8, Iss. 4, pp. 15-15
Closed Access
A Data-Centric Machine Learning Approach for Controlling Exploration in Estimation of Distribution Algorithms
Antonio Bolufé-Röhler, Jordan Luke
2022 IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS) (2022), pp. 1-9
Closed Access
Page 1

Scroll to top