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:

Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
Mingchang Chih, Chin-Jung Lin, Maw‐Sheng Chern, et al.
Applied Mathematical Modelling (2013) Vol. 38, Iss. 4, pp. 1338-1350
Open Access | Times Cited: 98

Showing 1-25 of 98 citing articles:

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications
Yudong Zhang, Shuihua Wang‎, Genlin Ji
Mathematical Problems in Engineering (2015) Vol. 2015, pp. 1-38
Open Access | Times Cited: 1028
MPSO: Modified particle swarm optimization and its applications
D. Tian, Zhongzhi Shi
Swarm and Evolutionary Computation (2018) Vol. 41, pp. 49-68
Closed Access | Times Cited: 306
Performance assessment of the metaheuristic optimization algorithms: an exhaustive review
Abdul Halim, Idris Ismail, Swagatam Das
Artificial Intelligence Review (2020) Vol. 54, Iss. 3, pp. 2323-2409
Closed Access | Times Cited: 204
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
Valentina Cacchiani, Manuel Iori, Alberto Locatelli, et al.
Computers & Operations Research (2022) Vol. 143, pp. 105693-105693
Open Access | Times Cited: 98
Prepositioning emergency earthquake response supplies: A new multi-objective particle swarm optimization algorithm
Reza Mohammadi Chabanloo, S.M.T. Fatemi Ghomi, Fariborz Jolai
Applied Mathematical Modelling (2015) Vol. 40, Iss. 9-10, pp. 5183-5199
Open Access | Times Cited: 115
An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem
Tao Meng, Quan-Ke Pan
Applied Soft Computing (2016) Vol. 50, pp. 79-93
Closed Access | Times Cited: 95
A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem
Mohamed Abdel‐Basset, Syed Bilal Hussain Shah, Arun Kumar Sangaiah
International Journal of Machine Learning and Cybernetics (2017) Vol. 10, Iss. 3, pp. 495-514
Closed Access | Times Cited: 94
Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem
Mingchang Chih
Applied Soft Computing (2014) Vol. 26, pp. 378-389
Closed Access | Times Cited: 85
Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems
Djaafar Zouache, Farid Nouioua, Abdelouahab Moussaoui
Soft Computing (2015) Vol. 20, Iss. 7, pp. 2781-2799
Closed Access | Times Cited: 83
Binary artificial algae algorithm for multidimensional knapsack problems
Xuedong Zhang, Changzhi Wu, Jing Li, et al.
Applied Soft Computing (2016) Vol. 43, pp. 583-595
Closed Access | Times Cited: 81
A binary grey wolf optimizer for the multidimensional knapsack problem
Kaiping Luo, Qiuhong Zhao
Applied Soft Computing (2019) Vol. 83, pp. 105645-105645
Closed Access | Times Cited: 65
A binary moth search algorithm based on self-learning for multidimensional knapsack problems
Yanhong Feng, Gai‐Ge Wang
Future Generation Computer Systems (2021) Vol. 126, pp. 48-64
Closed Access | Times Cited: 49
Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy
Mingchang Chih
European Journal of Operational Research (2022) Vol. 305, Iss. 2, pp. 562-593
Closed Access | Times Cited: 35
An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems
Biao Zhang, Quan-Ke Pan, Xinli Zhang, et al.
Applied Soft Computing (2015) Vol. 29, pp. 288-297
Closed Access | Times Cited: 59
A Binary differential search algorithm for the 0–1 multidimensional knapsack problem
Jianjun Liu, Changzhi Wu, Jiang Cao, et al.
Applied Mathematical Modelling (2016) Vol. 40, Iss. 23-24, pp. 9788-9805
Open Access | Times Cited: 56
Improved global-best-guided particle swarm optimization with learning operation for global optimization problems
Haibin Ouyang, Liqun Gao, Steven Li, et al.
Applied Soft Computing (2016) Vol. 52, pp. 987-1008
Closed Access | Times Cited: 53
Optimization of the EMS process parameters in compocasting of high-wear-resistant Al-nano-TiC composites
Majid Shamsipour, Zahra Pahlevani, Mohsen Ostad Shabani, et al.
Applied Physics A (2016) Vol. 122, Iss. 4
Closed Access | Times Cited: 50
An Effective Cuckoo Search Algorithm for Node Localization in Wireless Sensor Network
Jing Cheng, Linyuan Xia
Sensors (2016) Vol. 16, Iss. 9, pp. 1390-1390
Open Access | Times Cited: 49
Multidimensional knapsack problem optimization using a binary particle swarm model with genetic operations
Luis Fernando de Mingo López, Nuria Gómez Blas, Alberto Arteta
Soft Computing (2017) Vol. 22, Iss. 8, pp. 2567-2582
Closed Access | Times Cited: 41
A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems
Mohamed Abdel‐Basset, Syed Bilal Hussain Shah, Hossam Faris, et al.
Computers & Industrial Engineering (2019) Vol. 132, pp. 187-206
Open Access | Times Cited: 40
An Improved Brain Storming Optimization Algorithm for Estimating Parameters of Photovoltaic Models
Zeyuan Yan, Chunquan Li, Zhenshou Song, et al.
IEEE Access (2019) Vol. 7, pp. 77629-77641
Open Access | Times Cited: 38
An ensemble bat algorithm for large-scale optimization
Xingjuan Cai, Jiangjiang Zhang, Hao Liang, et al.
International Journal of Machine Learning and Cybernetics (2019) Vol. 10, Iss. 11, pp. 3099-3113
Closed Access | Times Cited: 35
Dynamic impact for ant colony optimization algorithm
Jonas Skackauskas, Tatiana Kalganova, Ian Dear, et al.
Swarm and Evolutionary Computation (2021) Vol. 69, pp. 100993-100993
Open Access | Times Cited: 30
BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: Method and comprehensive analysis
Mohamed Abdel‐Basset, Reda Mohamed, Karam M. Sallam, et al.
Computers & Industrial Engineering (2021) Vol. 159, pp. 107469-107469
Closed Access | Times Cited: 29
A comparative study between deterministic and two meta-heuristic algorithms for solar PV MPPT control under partial shading conditions
Arnold F. Sagonda, Komla A. Folly
Systems and Soft Computing (2022) Vol. 4, pp. 200040-200040
Open Access | Times Cited: 20
Page 1 - Next Page

Scroll to top