OOIR: Observatory of International Research

Papers

(The median citation count of Journal of Heuristics is 1. 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-09-01 to 2025-09-01.)

Article	Citations
Mathematical models and solving methods for diversity and equity optimization	17
Genetic programming hyper-heuristic for evolving a maintenance policy for wind farms	17
An integrated learning and progressive hedging matheuristic for stochastic network design problem	17
A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems	15
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
Fast constructive heuristics for the uncapacitated inventory routing problem	8
An efficient backtracking heuristic for the resource allocation problem with compatibility and exclusivity constraints	8
Intersections management for autonomous vehicles: a heuristic approach	8
solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT	8
Randomized rounding algorithms for large scale unsplittable flow problems	7
A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports	7
Ride matching and vehicle routing for on-demand mobility services	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
A Tabu-Bi-label hybridized branch and price algorithm for just-in-time material handling scheduling problems of mixed-model assembly lines with electric vehicle recharging requirements	4
Incomplete MaxSAT approaches for combinatorial testing	4
An effective population-based approach for the partial set covering problem	3
A heuristic search based on diversity for solving combinatorial problems	3
Tree search hyper-heuristic with application to combinatorial optimization	3
On the emerging potential of quantum annealing hardware for combinatorial optimization	3
An adaptative multi-objective scatter search for solving the dynamic bin packing problem	3
A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs	3
Stochastic capacitated dispersion problems in disaster preparedness for mass casualty incident	3
A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling	3

A Q-learning-based algorithm for the block relocation problem	3
A memetic algorithm for the flexible periodic vehicle routing problem	3
Selector: Ensemble-Based Automated Algorithm Configuration	3
A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands	2
Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits	2
Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system	2
30 years of the Journal of Heuristics: a bibliometric analysis	2
A large-scale neighborhood search algorithm for multi-activity tour scheduling problems	2
Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems	1
On robust vs fast solving of qualitative constraints	1
Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs	1
Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints	1
A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors	1
Interpretability of rectangle packing solutions with Monte Carlo tree search	1
Breakout local search for the cyclic cutwidth minimization problem	1
Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs	1
Heuristic algorithm for integrated ship scheduling, routing and stowage problem in multi-vessel roll-on/roll-off shipping	1
A systematic approach to parameter optimization and its application to flight schedule simulation software	1
Learning fine-grained search space pruning and heuristics for combinatorial optimization	1
An efficient scenario penalization matheuristic for a stochastic scheduling problem	1
A memetic algorithm for the inventory routing problem	1
Minimizing total completion time in large-sized pharmaceutical quality control scheduling	1
Weighted iterated local branching for mathematical programming problems with binary variables	1
Modeling and evolutionary algorithm for solving a multi-depot mixed vehicle routing problem with uncertain travel times	1
Fixed set search applied to the multi-objective minimum weighted vertex cover problem	1
Heuristics for the run-length encoded Burrows–Wheeler transform alphabet ordering problem	1
A new heuristic for finding verifiable k-vertex-critical subgraphs	1
The ALNS metaheuristic for the transmission maintenance scheduling	1