Journal of Heuristics

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 2022-05-01 to 2026-05-01.)
ArticleCitations
Mathematical models and solving methods for diversity and equity optimization35
An integrated learning and progressive hedging matheuristic for stochastic network design problem20
Improving state-of-the-art vertex sorting algorithms to compute the maximum common induced subgraph19
Mathematical formulations and a Relax-and-Fix heuristic algorithm for capacitated reliable fixed-charge facility location problems19
Genetic programming hyper-heuristic for evolving a maintenance policy for wind farms19
A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems15
Fast constructive heuristics for the uncapacitated inventory routing problem11
Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem11
Large neighborhood search and hyper-heuristics for the capacitated p-median problem10
Mixed integer programs to improve solutions of vehicle routing problems with intra-route constraints10
solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT10
An efficient backtracking heuristic for the resource allocation problem with compatibility and exclusivity constraints9
Minimax regret makespan scheduling with interval release dates on unrelated machines7
Definition of Region of Interest in multiobjective problems using hyperellipsoids6
A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports6
Incomplete MaxSAT approaches for combinatorial testing5
Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times5
A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles5
A Hybrid Genetic Search for Selective Routing with Overlapping Clusters: A Case Study in Order Picking5
Fixed set search matheuristic applied to the min-Knapsack problem with compactness constraints and an extension incorporating penalty values5
An adaptative multi-objective scatter search for solving the dynamic bin packing problem4
Tree search hyper-heuristic with application to combinatorial optimization4
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
A Q-learning-based algorithm for the block relocation problem4
A memetic algorithm for the flexible periodic vehicle routing problem4
A matheuristic for design and dispatch of a utility-connected distributed energy system4
Selector: Ensemble-Based Automated Algorithm Configuration4
Variable neighborhood search for healthcare providers rostering: a comprehensive review and future research agenda4
A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs3
A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling3
An effective population-based approach for the partial set covering problem3
Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits3
Exploiting user-supplied Decompositions inside Heuristics3
Stochastic capacitated dispersion problems in disaster preparedness for mass casualty incident3
Extending GRASP towards an improved Fixed Set Search for solving the maximum disjoint dominating sets problem3
On the emerging potential of quantum annealing hardware for combinatorial optimization3
30 years of the Journal of Heuristics: a bibliometric analysis2
A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands2
The ALNS metaheuristic for the transmission maintenance scheduling2
A large-scale neighborhood search algorithm for multi-activity tour scheduling problems2
Minimizing total completion time in large-sized pharmaceutical quality control scheduling2
Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system2
Breakout local search for the cyclic cutwidth minimization problem2
Fixed set search applied to the multi-objective minimum weighted vertex cover problem1
On robust vs fast solving of qualitative constraints1
An iterated local search heuristic for the maximum Intersection of $$k$$-subsets problem1
Heuristic algorithm for integrated ship scheduling, routing and stowage problem in multi-vessel roll-on/roll-off shipping1
Interpretability of rectangle packing solutions with Monte Carlo tree search1
Efficient solution of the number partitioning problem on a quantum annealer: a hybrid quantum-classical decomposition approach1
Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs1
Modeling and evolutionary algorithm for solving a multi-depot mixed vehicle routing problem with uncertain travel times1
Learning fine-grained search space pruning and heuristics for combinatorial optimization1
A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors1
An efficient scenario penalization matheuristic for a stochastic scheduling problem1
DSLS: a simple and efficient local search algorithm for the maximum bisection problem1
A Tabu Search algorithm for the single source capacitated partial set covering location problem1
A systematic approach to parameter optimization and its application to flight schedule simulation software1
Heuristics for the run-length encoded Burrows–Wheeler transform alphabet ordering problem1
GAGS: parallelized genetic algorithm-based grid search for SVM + model optimization1
Solving travelling thief problems using coordination based methods1
Resource-constrained multi-stage processing and assembly scheduling with sequential and batch operations1
0.031554937362671