Journal of Heuristics

Papers
(The TQCC of Journal of Heuristics is 4. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-05-01 to 2024-05-01.)
ArticleCitations
Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic28
IoT networks 3D deployment using hybrid many-objective optimization algorithms27
A genetic algorithm for finding realistic sea routes considering the weather19
Iterated local search for single machine total weighted tardiness batch scheduling16
A matheuristic for the stochastic facility location problem16
Matheuristics to optimize refueling and maintenance planning of nuclear power plants15
Fixed set search applied to the multi-objective minimum weighted vertex cover problem13
Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics12
A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem10
CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines10
An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships8
Evolutionary multi-level acyclic graph partitioning8
Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape8
The just-in-time job-shop scheduling problem with distinct due-dates for operations7
Incomplete MaxSAT approaches for combinatorial testing7
Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances7
Weighted proximity search5
Qfold: a new modeling paradigm for the RNA folding problem5
Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches4
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs4
Ride matching and vehicle routing for on-demand mobility services4
A memetic algorithm for the inventory routing problem4
Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem4
Anisotropic Q-learning and waiting estimation based real-time routing for automated guided vehicles at container terminals4
Dynamic pricing with demand disaggregation for hotel revenue management4
0.063313007354736