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 multi-population algorithm for multi-objective knapsack problem
Imen Ben Mansour, Matthieu Basseur, Frédéric Saubion
Applied Soft Computing (2018) Vol. 70, pp. 814-825
Closed Access | Times Cited: 24

Showing 24 citing articles:

Multi-objective metaheuristics for discrete optimization problems: A review of the state-of-the-art
Qi Liu, Xiaofeng Li, Haitao Liu, et al.
Applied Soft Computing (2020) Vol. 93, pp. 106382-106382
Closed Access | Times Cited: 129
Water wave optimization for combinatorial optimization: Design strategies and applications
Yu‐Jun Zheng, Xueqin Lü, Yi-Chen Du, et al.
Applied Soft Computing (2019) Vol. 83, pp. 105611-105611
Open Access | Times Cited: 50
A novel multimodal multi-objective differential evolution algorithm based on nearest neighbor-repulsion strategy
Yingjuan Jia, Liangdong Qu, Xiaoqin Li
Information Sciences (2024) Vol. 676, pp. 120832-120832
Closed Access | Times Cited: 3
Cooperative multi-population Harris Hawks optimization for many-objective optimization
Na Yang, Zhenzhou Tang, Xuebing Cai, et al.
Complex & Intelligent Systems (2022) Vol. 8, Iss. 4, pp. 3299-3332
Open Access | Times Cited: 15
Study of population partitioning techniques on efficiency of swarm algorithms
Reshu Chaudhary, Hema Banati
Swarm and Evolutionary Computation (2020) Vol. 55, pp. 100672-100672
Closed Access | Times Cited: 16
Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems
Suriya Phongmoo, Komgrit Leksakul, Nivit Charoenchai, et al.
Applied Sciences (2023) Vol. 13, Iss. 11, pp. 6601-6601
Open Access | Times Cited: 5
Dynamic crow search algorithm based on adaptive parameters for large-scale global optimization
Abdelouahab Necira, Djemai Naimi, Ahmed Salhi, et al.
Evolutionary Intelligence (2021) Vol. 15, Iss. 3, pp. 2153-2169
Closed Access | Times Cited: 12
Modeling and Solving the Knapsack Problem with a Multi-Objective Equilibrium Optimizer Algorithm Based on Weighted Congestion Distance
Ziqian Wang, Huang Xin, Yan Zhang, et al.
Mathematics (2024) Vol. 12, Iss. 22, pp. 3538-3538
Open Access | Times Cited: 1
A parallel MOEA with criterion-based selection applied to the Knapsack Problem
Nedjmeddine Kantour, Sadek Bouroubi, Djamel Chaabane
Applied Soft Computing (2019) Vol. 80, pp. 358-373
Open Access | Times Cited: 13
Application of an Adaptive Multi-Population Parallel Genetic Algorithm with Constraints in Electromagnetic Tomography with Incomplete Projections
Changfang Guo, Zhen Yang, Xiang Wu, et al.
Applied Sciences (2019) Vol. 9, Iss. 13, pp. 2611-2611
Open Access | Times Cited: 12
An Effective Hybrid Ant Colony Optimization for the Knapsack Problem Using Multi-Directional Search
Imen Ben Mansour
SN Computer Science (2023) Vol. 4, Iss. 2
Closed Access | Times Cited: 4
On Multiobjective Knapsack Problems with Multiple Decision Makers
Zhen Song, Wenjian Luo, Xin Lin, et al.
2021 IEEE Symposium Series on Computational Intelligence (SSCI) (2022)
Closed Access | Times Cited: 6
Intelligent system for recruitment decision making using an alternative parallel-sequential genetic algorithm
Said Tkatek, Saadia Bahti, Otman Abdoun, et al.
Indonesian Journal of Electrical Engineering and Computer Science (2021) Vol. 22, Iss. 1, pp. 385-385
Open Access | Times Cited: 8
Optimal reconfiguration of distribution network feeders considering electrical vehicles and distributed generators
Mohsen Noruzi Azghandi, Ali Asghar Shojaei, Saman Toosi, et al.
Evolutionary Intelligence (2021) Vol. 16, Iss. 1, pp. 49-66
Closed Access | Times Cited: 8
Solving 0-1 Bi-Objective Multi-dimensional Knapsack Problems Using Binary Genetic Algorithm
Özgür Kabadurmuş, M. Fatih Taşgetiren, Hande Öztop, et al.
Studies in computational intelligence (2020), pp. 51-67
Closed Access | Times Cited: 5
Solving binary multi-objective knapsack problems with novel greedy strategy
Jiawei Yuan, Yifan Li
Memetic Computing (2021) Vol. 13, Iss. 4, pp. 447-458
Closed Access | Times Cited: 5
Universal strategy of dynamic subpopulation number management in practical network optimization problems
Michał Witold Przewoźniczek, Róża Goścień
Applied Soft Computing (2019) Vol. 82, pp. 105592-105592
Closed Access | Times Cited: 3
A New Approach to Detecting and Preventing Populations Stagnation Through Dynamic Changes in Multi-Population-Based Algorithms
Krystian Łapa, Danuta Rutkowska, Aleksander Byrski, et al.
Journal of Artificial Intelligence and Soft Computing Research (2023) Vol. 13, Iss. 4, pp. 289-306
Open Access | Times Cited: 1
Solution approaches for equitable multiobjective integer programming problems
Bashir Bashir, Özlem Karsu
Annals of Operations Research (2020) Vol. 311, Iss. 2, pp. 967-995
Open Access | Times Cited: 3
Indicator Weighted Based Multi-Objective Approach using Self-Adaptive Neighborhood Operator
Imen Ben Mansour, Inès Alaya, Moncef Tagina
Procedia Computer Science (2021) Vol. 192, pp. 338-347
Open Access | Times Cited: 3
Multi-population evolutionary computing based multi-agent smart distribution system service restoration
Yu‐Hsiu Lin
Electrical Engineering (2022) Vol. 104, Iss. 5, pp. 3295-3311
Closed Access | Times Cited: 2
Multi-Objective Factored Evolutionary Optimization and the Multi-Objective Knapsack Problem
Amy Peerlinck, John W. Sheppard
2022 IEEE Congress on Evolutionary Computation (CEC) (2022), pp. 1-8
Closed Access | Times Cited: 2
Selection of informative genes from high-dimensional cancerous data employing an improvised meta-heuristic algorithm
Prajna Paramita Debata, Puspanjali Mohapatra
Evolutionary Intelligence (2021) Vol. 15, Iss. 3, pp. 1841-1859
Closed Access | Times Cited: 2
A Parallel MOEA with Criterion-based Selection Applied to the Knapsack Problem
Nedjmeddine Kantour, Sadek Bouroubi, Djamel Chaabane
arXiv (Cornell University) (2018)
Closed Access
Page 1

Scroll to top