Journal of Heuristics
2016 - 2026
Current editor(s): Manuel Laguna From Springer Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing (). Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.
Volume 32, issue 1, 2026
- Variable neighborhood search for healthcare providers rostering: a comprehensive review and future research agenda pp. 1-25

- Moustafa Abdelwanis, Eman Ouda, Dima Al Absi, Firda Rahmadani, Mecit Can Emre Simsekler and Andrei Sleptchenko
- Improving state-of-the-art vertex sorting algorithms to compute the maximum common induced subgraph pp. 1-33

- Andrea Calabrese, Lorenzo Cardone, Salvatore Licata, Marco Porro and Stefano Quer
- Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem and its Variants pp. 1-32

- Long Wang, Jiongzhi Zheng, Zhengda Xiong and Kun He
- Automated Tabu Tenure Tuning by Trajectory Metrics for Quadratic Unconstrained Binary Optimization pp. 1-52

- Masahiko Sugimura, Keiichiro Yamamura, Hiroki Ishikura, Akihiro Yoshida, Ken Kawano, Matthieu Parizy and Katsuki Fujisawa
- Mathematical formulations and a Relax-and-Fix heuristic algorithm for capacitated reliable fixed-charge facility location problems pp. 1-41

- Abdolreza Roshani, Glenn Parry and Philip Walker-Davies
- Definition of Region of Interest in multiobjective problems using hyperellipsoids pp. 1-29

- Patrick Ferreira, Luciana Cosme and Allysson Lacerda
Volume 31, issue 4, 2025
- An iterated local search heuristic for the maximum Intersection of $$k$$ k -subsets problem pp. 1-29

- Hélder Silva Ferreira and Rian G. S. Pinheiro
- A matheuristic for design and dispatch of a utility-connected distributed energy system pp. 1-52

- James Grymes, Alexandra Newman, Alexander Zolan and Dinesh Mehta
- Resource-constrained multi-stage processing and assembly scheduling with sequential and batch operations pp. 1-41

- Song Wu, Yang Wang, Yu Du, Wei Yang and Jianguang Feng
- Automated CNN architecture design with enhanced particle swarm optimization pp. 1-51

- Arjun Ghosh, Nanda Dulal Jana and Subhayu Ghosh
- Exploiting user-supplied Decompositions inside Heuristics pp. 1-38

- Katrin Halbig, Adrian Göß and Dieter Weninger
- Minimax regret makespan scheduling with interval release dates on unrelated machines pp. 1-37

- Mirosław Ławrynowicz and Jerzy Józefczyk
- A Random-Key optimizer for combinatorial optimization pp. 1-47

- Antonio A. Chaves, Mauricio G. C. Resende, Martin J. A. Schuetz, J. Kyle Brubaker, Helmut G. Katzgraber, Edilson F. de Arruda and Ricardo M. A. Silva
Volume 31, issue 3, 2025
- Stochastic capacitated dispersion problems in disaster preparedness for mass casualty incident pp. 1-30

- B. Stephan Onggo, Xabier A. Martin, Canan G. Corlu, Javier Panadero and Angel Juan
- solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT pp. 1-28

- Samuel Deleplanque, Luis Fernando Pérez Armas and Stefan Creemers
- 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 pp. 1-34

- Yufan Huang and Binghai Zhou
- Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances pp. 1-44

- Arnab Kole and Anindya Jyoti Pal
- Selector: Ensemble-Based Automated Algorithm Configuration pp. 1-31

- Dimitri Weiß, Elias Schede and Kevin Tierney
- A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling pp. 1-31

- Guido Passage, Marjan van den Akker and Han Hoogeveen
Volume 31, issue 2, 2025
- An adaptive variable neighborhood search for the traveling salesman problem with job-times pp. 1-65

- Shaowen Lan, Yongliang Lu and Wenjuan Fan
- A biased-randomised iterated local search for the team orienteering arc routing problem allowing different origin and destination pp. 1-27

- Xabier A. Martin, Peter Keenan, Javier Panadero, Sean McGarraghy and Angel Juan
- Efficient solution of the number partitioning problem on a quantum annealer: a hybrid quantum-classical decomposition approach pp. 1-20

- Zongji Li, Tobias Seidel, Dominik Leib, Michael Bortz and Raoul Heese
- Fast constructive heuristics for the uncapacitated inventory routing problem pp. 1-31

- Miguel Ángel Marfurt Alarcón, Lehilton Lelis Chaves Pedrosa and Fábio Luiz Usberti
- Tree search hyper-heuristic with application to combinatorial optimization pp. 1-42

- Francisco Javier Gil-Gala, Marko Ɖurasevic, Maria R. Sierra and Ramiro Varela
- A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands pp. 1-39

- Hassana Abdullahi, Lorena Reyes-Rubiano, Djamila Ouelhadj, Javier Faulin and Angel Juan
- Hybrid iterated local search algorithm for the vehicle routing problem with lockers pp. 1-25

- Bruno Oliveira, Artur Pessoa and Marcos Roboredo
- Hybrid algorithms for enhanced efficiency and scalability of network-based tri-level interdiction models pp. 1-43

- Nafiseh Ghorbani-Renani, Andrés D. González and Kash Barker
Volume 31, issue 1, 2025
- 30 years of the Journal of Heuristics: a bibliometric analysis pp. 1-55

- Martha Flores-Sosa, José M. Merigó and Kenia Sanchez-Valenzuela
- An efficient backtracking heuristic for the resource allocation problem with compatibility and exclusivity constraints pp. 1-29

- Ahmed Khassiba
- Heuristics for the run-length encoded Burrows–Wheeler transform alphabet ordering problem pp. 1-29

- Lily Major, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora and Christine Zarges
- Evolutionary optimization of the area under precision-recall curve for classifying imbalanced multi-class data pp. 1-66

- Marwa Chabbouh, Slim Bechikh, Efrén Mezura-Montes and Lamjed Ben Said
- Transforming last mile delivery with heterogeneous assistants: drones and delivery robots pp. 1-42

- Cheng Chen, Emrah Demir, Xisheng Hu and Hainan Huang
- Measuring the effectiveness and efficiency of simulation optimization metaheuristic algorithms pp. 1-21

- Benjamin G. Thengvall, Shane N. Hall and Michael P. Deskevich
- Hybridizing constraint programming and meta-heuristics for multi-mode resource-constrained multiple projects scheduling Problem pp. 1-37

- Arben Ahmeti and Nysret Musliu
- Heuristic algorithm for integrated ship scheduling, routing and stowage problem in multi-vessel roll-on/roll-off shipping pp. 1-40

- Yuzhe Zhao, Peiyun Peng, Jingmiao Zhou and Yadong Wang
- An effective population-based approach for the partial set covering problem pp. 1-32

- Ye Zhang, Jinlong He, Yupeng Zhou, Shuli Hu, Dunbo Cai, Naiyu Tian and Minghao Yin
- A Q-learning-based algorithm for the block relocation problem pp. 1-41

- Liqun Liu, Yuanjun Feng, Qingcheng Zeng, Zhijun Chen and Yaqiu Li
- Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times pp. 1-35

- Willy A. Oliveira Soler, Maristela O. Santos and Kerem Akartunalı
- Two-echelon van-robot routing problem with sharing-curbside satellites pp. 1-35

- Hongqi Li, Feilong Wang, Hanxi Xiong and Zhiqi Wang
- A heuristic algorithm to improving the coil slitting process in the steel industry pp. 1-38

- Óscar Soto-Sánchez, María Sierra-Paradinas, Micael Gallego, Antonio Alonso-Ayuso and Francisco Gortázar
- A memetic algorithm for the flexible periodic vehicle routing problem pp. 1-26

- Banafsheh Amiri, Koorush Ziarati and Somayeh Sohrabi
- Feature selection for high-dimensional data using a multivariate search space reduction strategy based scatter search pp. 1-33

- Miguel Garcia-Torres
- A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs pp. 1-57

- Elisama Araújo Silva Oliveira, Elizabeth Wanner, Elisangela Martins Sá and Sérgio Ricardo Souza
- An adaptative multi-objective scatter search for solving the dynamic bin packing problem pp. 1-69

- Méziane Aïder, Sabrin Boulebene and Mhand Hifi
Volume 30, issue 5, 2024
- A large-scale neighborhood search algorithm for multi-activity tour scheduling problems pp. 225-267

- Rana Shariat and Kai Huang
- Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs pp. 269-289

- Gabriel Siqueira, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin and Zanoni Dias
- Mathematical models and solving methods for diversity and equity optimization pp. 291-323

- Rafael Martí, Francisco Parreño and Jorge Mortes
- On the emerging potential of quantum annealing hardware for combinatorial optimization pp. 325-358

- Byron Tasseff, Tameem Albash, Zachary Morrell, Marc Vuffray, Andrey Y. Lokhov, Sidhant Misra and Carleton Coffrin
- A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles pp. 359-396

- İlknur Tükenmez, Tugba Saraç and Onur Kaya
- Correction to: A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles pp. 397-397

- İlknur Tükenmez, Tugba Saraç and Onur Kaya
- An integrated ILS-VND strategy for solving the knapsack problem with forfeits pp. 399-420

- Matheus M. Vieira, Bruno Nogueira and Rian G. S. Pinheiro
- Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits pp. 421-421

- Matheus M. Vieira, Bruno Nogueira and Rian G. S. Pinheiro
- Genetic programming hyper-heuristic for evolving a maintenance policy for wind farms pp. 423-451

- Yikai Ma, Wenjuan Zhang and Juergen Branke
Volume 30, issue 3, 2024
- Algorithmic strategies for a fast exploration of the TSP $$4$$ 4 -OPT neighborhood pp. 109-144

- Giuseppe Lancia and Marcello Dalpasso
- A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems pp. 145-172

- Guilherme Barbosa Almeida, Elisangela Martins Sá, Sérgio Ricardo Souza and Marcone Jamilson Freitas Souza
- Interpretability of rectangle packing solutions with Monte Carlo tree search pp. 173-198

- Yeray Galán López, Cristian González García, Vicente García Díaz, Edward Rolando Núñez Valdez and Alberto Gómez Gómez
- Metaheuristics and machine learning: an approach with reinforcement learning assisting neural architecture search pp. 199-224

- Sandra Mara Scós Venske, Carolina Paula Almeida and Myriam Regattieri Delgado
Volume 30, issue 1, 2024
- A hybrid variable neighborhood search heuristic for the sustainable time-dependent truck-drone routing problem with rendezvous locations pp. 1-41

- Ebrahim Teimoury and Reza Rashid
- DSLS: a simple and efficient local search algorithm for the maximum bisection problem pp. 43-65

- Xinliang Tian, Dantong Ouyang, Huisi Zhou, Rui Sun and Liming Zhang
- A heuristic algorithm using tree decompositions for the maximum happy vertices problem pp. 67-107

- Louis Carpentier, Jorik Jooken and Jan Goedgebeur
| |