OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Heuristics is 3. 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 2021-08-01 to 2025-08-01.)

Article	Citations
Genetic programming hyper-heuristic for evolving a maintenance policy for wind farms	17
Mathematical models and solving methods for diversity and equity optimization	16
An integrated learning and progressive hedging matheuristic for stochastic network design problem	15
A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems	14
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks	12
Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem	9
Intersections management for autonomous vehicles: a heuristic approach	8
Fast constructive heuristics for the uncapacitated inventory routing problem	8
Randomized rounding algorithms for large scale unsplittable flow problems	7
An efficient backtracking heuristic for the resource allocation problem with compatibility and exclusivity constraints	7
Ride matching and vehicle routing for on-demand mobility services	7
A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports	6
Incomplete MaxSAT approaches for combinatorial testing	6
A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles	5
Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times	5
An adaptative multi-objective scatter search for solving the dynamic bin packing problem	4
30 years of the Journal of Heuristics: a bibliometric analysis	3
A memetic algorithm for the flexible periodic vehicle routing problem	3
On the emerging potential of quantum annealing hardware for combinatorial optimization	3
A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application	3
A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands	3
A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs	3
A Q-learning-based algorithm for the block relocation problem	3
Tree search hyper-heuristic with application to combinatorial optimization	3
Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits	3

Selector: Ensemble-Based Automated Algorithm Configuration	3
An effective population-based approach for the partial set covering problem	3
A heuristic search based on diversity for solving combinatorial problems	3
A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling	3