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 2, 2026
- Mixed integer programs to improve solutions of vehicle routing problems with intra-route constraints pp. 1-26

- Simen T. Vadseth, Henrik Andersson, Jean-François Cordeau and Magnus Stålhane
- A Robust Optimization Framework for eBus Charging Infrastructure Planning pp. 1-28

- César Loaiza Quintana, Laura Climent and Alejandro Arbelaez
- GAGS: parallelized genetic algorithm-based grid search for SVM + model optimization pp. 1-39

- J. D. Fernández, J. Vega and S. Dormido-Canto
Volume 32, issue 1, 2026
- 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
- Large neighborhood search and hyper-heuristics for the capacitated p-median problem pp. 1-32

- Ida Gjergji, Lucas Kletzander and Nysret Musliu
- A Tabu Search algorithm for the single source capacitated partial set covering location problem pp. 1-58

- Fábio Pires Mourão, Elisangela Martins de Sá, Sérgio Ricardo de Souza and Marcone Jamilson Freitas Souza
- Definition of Region of Interest in multiobjective problems using hyperellipsoids pp. 1-29

- Patrick Ferreira, Luciana Cosme and Allysson Lacerda
- Can machine learning help in solving the pallet loading optimization problem? pp. 1-31

- Mauro Dell’Amico, Giorgia Franchini, Matteo Magnani and Luca Zanni
- Graph downsizing: a fast heuristic for querying closely connected subgraphs pp. 1-19

- Yiping Liu, Mengxiao Zhang, Jiamou Liu and Yi Zhou
- 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
- 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
- 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
- A Hybrid Genetic Search for Selective Routing with Overlapping Clusters: A Case Study in Order Picking pp. 1-52

- Vittorio Latorre and Donato Salvatore
- 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
Volume 31, issue 4, 2025
- 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
- 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
- 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
- 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 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
- 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
- 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
- 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
- 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
Volume 31, issue 2, 2025
- 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
- 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
- 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
- Tree search hyper-heuristic with application to combinatorial optimization pp. 1-42

- Francisco Javier Gil-Gala, Marko Ɖurasevic, Maria R. Sierra and Ramiro Varela
- Hybrid iterated local search algorithm for the vehicle routing problem with lockers pp. 1-25

- Bruno Oliveira, Artur Pessoa and Marcos Roboredo
- 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
- 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
Volume 31, issue 1, 2025
- 30 years of the Journal of Heuristics: a bibliometric analysis pp. 1-55

- Martha Flores-Sosa, Jose Merigo Lindahl and Kenia Sanchez-Valenzuela
- A Q-learning-based algorithm for the block relocation problem pp. 1-41

- Liqun Liu, Yuanjun Feng, Qingcheng Zeng, Zhijun Chen and Yaqiu Li
- A memetic algorithm for the flexible periodic vehicle routing problem pp. 1-26

- Banafsheh Amiri, Koorush Ziarati and Somayeh Sohrabi
- 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 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
- Hybridizing constraint programming and meta-heuristics for multi-mode resource-constrained multiple projects scheduling Problem pp. 1-37

- Arben Ahmeti and Nysret Musliu
- 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
- 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
- Measuring the effectiveness and efficiency of simulation optimization metaheuristic algorithms pp. 1-21

- Benjamin G. Thengvall, Shane N. Hall and Michael P. Deskevich
- 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
- Feature selection for high-dimensional data using a multivariate search space reduction strategy based scatter search pp. 1-33

- Miguel Garcia-Torres
- Transforming last mile delivery with heterogeneous assistants: drones and delivery robots pp. 1-42

- Cheng Chen, Emrah Demir, Xisheng Hu and Hainan Huang
- 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
- 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
- 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
| |