Journal of Heuristics

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 2022-01-01 to 2026-01-01.)
ArticleCitations
An integrated learning and progressive hedging matheuristic for stochastic network design problem24
Mathematical models and solving methods for diversity and equity optimization18
Genetic programming hyper-heuristic for evolving a maintenance policy for wind farms18
Mathematical formulations and a Relax-and-Fix heuristic algorithm for capacitated reliable fixed-charge facility location problems17
Improving state-of-the-art vertex sorting algorithms to compute the maximum common induced subgraph14
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks10
A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems10
Fast constructive heuristics for the uncapacitated inventory routing problem10
Intersections management for autonomous vehicles: a heuristic approach9
solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT9
An efficient backtracking heuristic for the resource allocation problem with compatibility and exclusivity constraints8
Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem8
Minimax regret makespan scheduling with interval release dates on unrelated machines7
Definition of Region of Interest in multiobjective problems using hyperellipsoids7
A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports6
A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles6
Ride matching and vehicle routing for on-demand mobility services6
An adaptative multi-objective scatter search for solving the dynamic bin packing problem4
Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times4
A matheuristic for design and dispatch of a utility-connected distributed energy system4
Incomplete MaxSAT approaches for combinatorial testing4
A heuristic search based on diversity for solving combinatorial problems4
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 requirements4
Selector: Ensemble-Based Automated Algorithm Configuration3
On the emerging potential of quantum annealing hardware for combinatorial optimization3
30 years of the Journal of Heuristics: a bibliometric analysis3
A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs3
An effective population-based approach for the partial set covering problem3
A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling3
A memetic algorithm for the flexible periodic vehicle routing problem3
Tree search hyper-heuristic with application to combinatorial optimization3
Variable neighborhood search for healthcare providers rostering: a comprehensive review and future research agenda3
Stochastic capacitated dispersion problems in disaster preparedness for mass casualty incident3
Exploiting user-supplied Decompositions inside Heuristics3
A Q-learning-based algorithm for the block relocation problem3
0.024377822875977