Journal of Heuristics

Papers
(The TQCC of Journal of Heuristics is 4. 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 2020-10-01 to 2024-10-01.)
ArticleCitations
Iterated local search for single machine total weighted tardiness batch scheduling20
A matheuristic for the stochastic facility location problem17
Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics13
Fixed set search applied to the multi-objective minimum weighted vertex cover problem13
CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines13
Incomplete MaxSAT approaches for combinatorial testing10
Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape9
Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches8
The just-in-time job-shop scheduling problem with distinct due-dates for operations8
Weighted proximity search6
Anisotropic Q-learning and waiting estimation based real-time routing for automated guided vehicles at container terminals6
Learning fine-grained search space pruning and heuristics for combinatorial optimization5
Ride matching and vehicle routing for on-demand mobility services5
Minimizing total completion time in large-sized pharmaceutical quality control scheduling5
Qfold: a new modeling paradigm for the RNA folding problem5
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 constraints4
A memetic algorithm for the inventory routing problem4
A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window4
A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports4
Dynamic pricing with demand disaggregation for hotel revenue management4
Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem4
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem4
0.023061990737915