On the public citation graph
A Quantitative Evaluation of Statistical Practices in Metaheuristics Research
0 signed · 83 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cae.21752openalex-extracted
Solving the student grouping problem in e‐learning systems using swarm intelligence metaheuristics
inferredcites →https://doi.org/10.1002/cpe.6263openalex-extracted
The forecasting of air transport passenger demands in Turkey by using novel meta‐heuristic algorithms
inferredcites →https://doi.org/10.1007/bf02430363openalex-extracted
Designing and reporting on computational experiments with heuristic methods
inferredcites →https://doi.org/10.1007/bf02430364openalex-extracted
Testing heuristics: We have it all wrong
inferredcites →https://doi.org/10.1007/s00202-018-0750-4openalex-extracted
What metaheuristic solves the economic dispatch faster? A comparative case study
inferredcites →https://doi.org/10.1007/s00500-016-2220-0openalex-extracted
Artificial bee colony metaheuristic for energy-efficient clustering and routing in wireless sensor networks
inferredcites →https://doi.org/10.1007/s00500-020-05319-3openalex-extracted
A novel machine learning method for estimating football players’ value in the transfer market
inferredcites →https://doi.org/10.1007/s00521-017-2920-0openalex-extracted
Optimizing a Just-In-Time logistics network problem under fuzzy supply and demand: two parameter-tuned metaheuristics algorithms
inferredcites →https://doi.org/10.1007/s00521-019-04151-7openalex-extracted
Hybridization of two metaheuristics for solving the combined economic and emission dispatch problem
inferredcites →https://doi.org/10.1007/s00521-020-05145-6openalex-extracted
A novel meta-heuristic search algorithm for solving optimization problems: capuchin search algorithm
inferredcites →https://doi.org/10.1007/s10462-021-10015-1openalex-extracted
Bee-inspired metaheuristics for global optimization: a performance comparison
inferredcites →https://doi.org/10.1007/s10479-019-03490-xopenalex-extracted
On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time
inferredcites →https://doi.org/10.1007/s10489-020-01920-zopenalex-extracted
Novel metaheuristic based on multiverse theory for optimization problems in emerging systems
inferredcites →https://doi.org/10.1007/s10898-017-0504-2openalex-extracted
On a smoothed penalty-based algorithm for global optimization
inferredcites →https://doi.org/10.1007/s11071-020-06111-6openalex-extracted
Chaos cloud quantum bat hybrid optimization algorithm
inferredcites →https://doi.org/10.1007/s11227-018-2472-9openalex-extracted
Comparing GPU-parallelized metaheuristics to branch-and-bound for batch plants optimization
inferredcites →https://doi.org/10.1007/s11269-020-02656-8openalex-extracted
Hybrid Algorithm of Particle Swarm Optimization and Grey Wolf Optimizer for Reservoir Operation Management
inferredcites →https://doi.org/10.1007/s11590-006-0011-8openalex-extracted
How to assess and report the performance of a stochastic algorithm on a benchmark problem: mean or best result on a number of runs?
inferredcites →https://doi.org/10.1007/s11676-020-01246-zopenalex-extracted
Appropriate search techniques to estimate Weibull function parameters in a Pinus spp. plantation
inferredcites →https://doi.org/10.1007/s11721-016-0129-yopenalex-extracted
Searching for structural bias in particle swarm optimization and differential evolution algorithms
inferredcites →https://doi.org/10.1007/s11831-021-09586-7openalex-extracted
Comparative Performance of Twelve Metaheuristics for Wind Farm Layout Optimisation
inferredcites →https://doi.org/10.1007/s12065-020-00516-3openalex-extracted
Dynamic kidney paired exchange using modified multiverse optimization
inferredcites →https://doi.org/10.1007/s12065-021-00590-1openalex-extracted
Chaotic vortex search algorithm: metaheuristic algorithm for feature selection
inferredcites →https://doi.org/10.1007/s12652-020-02580-0openalex-extracted
A novel algorithm for global optimization: Rat Swarm Optimizer
inferredcites →https://doi.org/10.1007/s13369-018-3098-1openalex-extracted
A Non-convex Economic Dispatch Problem with Valve Loading Effect Using a New Modified $$\beta $$ β -Hill Climbing Local Search Algorithm
inferredcites →https://doi.org/10.1016/j.advengsoft.2016.10.004openalex-extracted
Truss optimization with frequency constraints using enhanced differential evolution based on adaptive directional mutation and nearest neighbor comparison
inferredcites →https://doi.org/10.1016/j.apm.2020.12.021openalex-extracted
Atomic orbital search: A novel metaheuristic algorithm
inferredcites →https://doi.org/10.1016/j.asoc.2018.06.052openalex-extracted
An efficient matheuristic for the minimum-weight dominating set problem
inferredcites →https://doi.org/10.1016/j.asoc.2018.08.035openalex-extracted
A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem
inferredcites →https://doi.org/10.1016/j.asoc.2019.105773openalex-extracted
A memetic algorithm using emperor penguin and social engineering optimization for medical data classification
inferredcites →https://doi.org/10.1016/j.asoc.2020.106503openalex-extracted
Adolescent Identity Search Algorithm (AISA): A novel metaheuristic approach for solving optimization problems
inferredcites →https://doi.org/10.1016/j.asoc.2020.106734openalex-extracted
Cooperation search algorithm: A novel metaheuristic evolutionary intelligence algorithm for numerical optimization and engineering optimization problems
inferredcites →https://doi.org/10.1016/j.asoc.2021.107866openalex-extracted
SHADE–WOA: A metaheuristic algorithm for global optimization
inferredcites →https://doi.org/10.1016/j.cie.2021.107250openalex-extracted
Aquila Optimizer: A novel meta-heuristic optimization algorithm
inferredcites →https://doi.org/10.1016/j.cie.2021.107469openalex-extracted
BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: Method and comprehensive analysis
inferredcites →https://doi.org/10.1016/j.compstruc.2020.106395openalex-extracted
Comparison of three novel hybrid metaheuristic algorithms for structural optimization problems
inferredcites →https://doi.org/10.1016/j.ejor.2017.05.001openalex-extracted
General Variable Neighborhood Search for the Order Batching and Sequencing Problem
inferredcites →https://doi.org/10.1016/j.ejor.2021.05.042openalex-extracted
Metaheuristics “In the Large”
inferredcites →https://doi.org/10.1016/j.eswa.2016.07.038openalex-extracted
An efficient hybrid algorithm for the Traveling Car Renter Problem
inferredcites →https://doi.org/10.1016/j.eswa.2019.07.009openalex-extracted
Weighted superposition attraction algorithm for combinatorial optimization
inferredcites →https://doi.org/10.1016/j.eswa.2020.113684openalex-extracted
Using metaheuristics for the location of bicycle stations
inferredcites →https://doi.org/10.1016/j.eswa.2021.115351openalex-extracted
Comparison of metaheuristic optimization algorithms for solving constrained mechanical design optimization problems
inferredcites →https://doi.org/10.1016/j.future.2019.07.062openalex-extracted
Iterated two-phase local search for the Set-Union Knapsack Problem
inferredcites →https://doi.org/10.1016/j.infsof.2020.106411openalex-extracted
A Systematic Comparison of search-Based approaches for LDA hyperparameter tuning
inferredcites →https://doi.org/10.1016/j.ins.2013.02.041openalex-extracted
A survey on optimization metaheuristics
inferredcites →https://doi.org/10.1016/j.ins.2018.08.030openalex-extracted
L-SHADE optimization algorithms with population-wide inertia
inferredcites →https://doi.org/10.1016/j.jhydrol.2021.126152openalex-extracted
Examination and comparison of binary metaheuristic wrapper-based input variable selection for local and global climate information-driven one-step monthly streamflow forecasting
inferredcites →https://doi.org/10.1016/j.knosys.2018.06.013openalex-extracted
Maximizing the spread of influence via the collective intelligence of discrete bat algorithm
inferredcites →https://doi.org/10.1016/j.neucom.2020.07.007openalex-extracted
E2PAMEA: A fast evolutionary algorithm for extracting fuzzy emerging patterns in big data environments
inferredcites →https://doi.org/10.1016/j.parco.2019.102573openalex-extracted
Distributed ant colony optimization based on actor model
inferredcites →https://doi.org/10.1016/j.swevo.2020.100721openalex-extracted
Population sizing of cellular evolutionary algorithms
inferredcites →https://doi.org/10.1016/j.tre.2016.10.002openalex-extracted
Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem
inferredcites →https://doi.org/10.1079/9781786390356.0001openalex-extracted
Presenting and summarizing data.
inferredcites →https://doi.org/10.1080/0305215x.2019.1565282openalex-extracted
A new metaheuristic optimization method: the algorithm of the innovative gunner (AIG)
inferredcites →https://doi.org/10.1109/4235.585893openalex-extracted
No free lunch theorems for optimization
inferredcites →https://doi.org/10.1111/itor.12001openalex-extracted
Metaheuristics—the metaphor exposed
inferredcites →https://doi.org/10.1111/itor.12168openalex-extracted
Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions
inferredcites →https://doi.org/10.1111/itor.12547openalex-extracted
Iterated local search and simulated annealing algorithms for the inventory routing problem
inferredcites →https://doi.org/10.1111/itor.12880openalex-extracted
An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
inferredcites →https://doi.org/10.1111/j.1540-5915.1977.tb01074.xopenalex-extracted
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
inferredcites →https://doi.org/10.1140/epjp/s13360-021-01623-5openalex-extracted
A novel metaheuristic combinatorial algorithm to optimize the natural convection across a vertical enclosure divided by perforated flat horizontal louvers inside
inferredcites →https://doi.org/10.1142/s1469026816500206openalex-extracted
Multi-Objective Cuckoo Search Under Multiple Archiving Strategies
inferredcites →https://doi.org/10.1166/asl.2017.10209openalex-extracted
A Performance Comparison of Metaheuristics Search for University Course Timetabling Problems
inferredcites →https://doi.org/10.1176/appi.ajp.162.3.643-aopenalex-extracted
Beyond Significance Testing: Reforming Data Analysis Methods in Behavioral Research
inferredcites →https://doi.org/10.1177/1847979017743603openalex-extracted
Comparison study of metaheuristics
inferredcites →https://doi.org/10.12693/aphyspola.132.959openalex-extracted
A Hybrid NSGA-II Algorithm for Multiobjective Quadratic Assignment Problems
inferredcites →https://doi.org/10.1287/trsc.2015.0660openalex-extracted
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem
inferredcites →https://doi.org/10.1515/jisys-2017-0156openalex-extracted
Tree Physiology Optimization in Benchmark Function and Traveling Salesman Problem
inferredcites →https://doi.org/10.15598/aeee.v16i4.2877openalex-extracted
Application of a Novel Modified Hybrid Algorithm for Solving Dynamic Economic Dispatch Problem with Practical Constraints
inferredcites →https://doi.org/10.1613/jair.2861openalex-extracted
ParamILS: An Automatic Algorithm Configuration Framework
inferredcites →https://doi.org/10.17159/2309-8775/2017/v59n4a6openalex-extracted
Application of metaheuristic algorithms to the improvement of the MyCiTi BRT network in Cape Town
inferredcites →https://doi.org/10.2339/politeknik.339358openalex-extracted
A Comparison of Metaheuristics for the Allocation of Elevators to Calls in Buildings
inferredcites →https://doi.org/10.24200/sci.2017.4405openalex-extracted
Optimal design of Fractional Order Digital Integrators – An Evolutionary Approach
inferredcites →https://doi.org/10.24200/sci.2018.21197openalex-extracted
Optimal design of fractional-order digital integrators:An evolutionary approach
inferredcites →https://doi.org/10.2478/ttj-2019-0025openalex-extracted
Two - Echelon Vehicle Routing Problem with Recharge Stations
inferredcites →https://doi.org/10.3390/app9224893openalex-extracted
Resource Scheduling in Cloud Computing Based on a Hybridized Whale Optimization Algorithm
inferredcites →https://doi.org/10.3390/w9110845openalex-extracted
A Hybrid Water Distribution Networks Design Optimization Method Based on a Search Space Reduction Approach and a Genetic Algorithm
inferredcites →https://doi.org/10.37936/ecti-eec.2021192.222310openalex-extracted
Comparison Investigation into Power System Optimization and Constraint-Based Generator Load Scheduling Using Metaheuristic Algorithms
inferredcites →https://doi.org/10.3934/jimo.2016.12.1215openalex-extracted
Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
inferredcites →https://doi.org/10.4018/ijkbo.2018010103openalex-extracted
A Novel Meta-Heuristic Approach for Load Balancing in Cloud Computing
inferredcites →https://doi.org/10.5937/tehnika2102165sopenalex-extracted
The comparison of metaheuristic algorithms in parametric optimization of laser-based processes
inferredcites →https://doi.org/10.7326/0003-4819-113-1-69openalex-extracted
More Informative Abstracts Revisited
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.