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-06-01 to 2025-06-01.)

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

A Q-learning-based algorithm for the block relocation problem	3
An effective population-based approach for the partial set covering problem	3
A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application	3