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 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

Volume 29, issue 4, 2023

An integrated learning and progressive hedging matheuristic for stochastic network design problem pp. 409-434

Fatemeh Sarayloo, Teodor Gabriel Crainic and Walter Rei

A matheuristic approach for the family traveling salesman problem pp. 435-460

Abtin Nourmohammadzadeh, Malek Sarhani and Stefan Voß

On robust vs fast solving of qualitative constraints pp. 461-485

Jan Wehner, Michael Sioutis and Diedrich Wolter

Solving travelling thief problems using coordination based methods pp. 487-544

Majid Namazi, M. A. Hakim Newton, Conrad Sanderson and Abdul Sattar

Effective adaptive large neighborhood search for a firefighters timetabling problem pp. 545-580

Mohamed-Amine Ouberkouk, Jean-Paul Boufflet and Aziz Moukrim

Volume 29, issue 2, 2023

Anisotropic Q-learning and waiting estimation based real-time routing for automated guided vehicles at container terminals pp. 207-228

Pengfei Zhou, Li Lin and Kap Hwan Kim

A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors pp. 229-267

Fatma-Zohra Baatout and Mhand Hifi

A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window pp. 269-311

Fagui Liu, Lvshengbiao Wang, Mengke Gui, Yang Zhang, Yulin Lan, Chengqi Lai and Boyuan Zhu

Learning fine-grained search space pruning and heuristics for combinatorial optimization pp. 313-347

Juho Lauri, Sourav Dutta, Marco Grassia and Deepak Ajwani

The ALNS metaheuristic for the transmission maintenance scheduling pp. 349-382

David Woller, Jakub Rada and Miroslav Kulich

An efficient scenario penalization matheuristic for a stochastic scheduling problem pp. 383-408

Michel Vasquez, Mirsad Buljubasic and Saïd Hanafi

Volume 29, issue 1, 2023

Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches pp. 1-38

Mohamad Alissa, Kevin Sim and Emma Hart

A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports pp. 39-76

João Luiz Marques Andrade and Gustavo Campos Menezes

Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system pp. 77-137

Bijun Wang, Zheyong Bian and Mo Mansouri

Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem pp. 139-175

Hanyu Gu, Hue Chi Lam, Thi Thanh Thu Pham and Yakov Zinder

Minimizing total completion time in large-sized pharmaceutical quality control scheduling pp. 177-206

Miguel S. E. Martins, Joaquim L. Viegas, Tiago Coito, Bernardo Firme, Andrea Costigliola, João Figueiredo, Susana M. Vieira and João M. C. Sousa

Volume 28, issue 5, 2022

Breakout local search for the cyclic cutwidth minimization problem pp. 583-618

Mu He, Qinghua Wu and Yongliang Lu

Modeling and evolutionary algorithm for solving a multi-depot mixed vehicle routing problem with uncertain travel times pp. 619-651

Liang Sun

Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem pp. 653-697

Martin Simensen, Geir Hasle and Magnus Stålhane

Volume 28, issue 4, 2022

Incomplete MaxSAT approaches for combinatorial testing pp. 377-431

Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia and Eduard Torres

Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems pp. 433-479

Ricardo N. Liang, Eduardo A. J. Anacleto and Cláudio N. Meneses

Fixed set search applied to the multi-objective minimum weighted vertex cover problem pp. 481-508

Raka Jovanovic, Antonio P. Sanfilippo and Stefan Voß

A systematic approach to parameter optimization and its application to flight schedule simulation software pp. 509-538

Alexander E. I. Brownlee, Michael G. Epitropakis, Jeroen Mulder, Marc Paelinck and Edmund K. Burke

Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds pp. 539-582

Leandro R. Costa, Daniel Aloise, Luca G. Gianoli and Andrea Lodi

Volume 28, issue 3, 2022

Ride matching and vehicle routing for on-demand mobility services pp. 235-258

Sepide Lotfi and Khaled Abdelghany

Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks pp. 259-285

R. Lewis and P. Corcoran

A heuristic search based on diversity for solving combinatorial problems pp. 287-328

Francisco Casas, Claudio E. Torres and Ignacio Araya

Weighted iterated local branching for mathematical programming problems with binary variables pp. 329-350

Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum and Cristina Requejo

A memetic algorithm for the inventory routing problem pp. 351-375

Mohamed Salim Amri Sakhri, Mounira Tlili and Ouajdi Korbaa

Volume 28, issue 2, 2022

Special issue on “The Eighth International Symposium on Information and Communication Technology—SoICT 2017” pp. 147-148

Ichiro Ide and Huynh Thi Thanh Binh

Estimating searching cost of regular path queries on large graphs by exploiting unit-subqueries pp. 149-169

Nguyen Van-Quyet, Quyet-Thang Huynh and Kyungbaek Kim

Identifying intentions in forum posts with cross-domain data pp. 171-192

Tu Minh Phuong, Le Cong Linh and Ngo Xuan Bach

English–Vietnamese cross-language paraphrase identification using hybrid feature classes pp. 193-209

Dien Dinh and Nguyen Le Thanh

Document representation and classification with Twitter-based document embedding, adversarial domain-adaptation, and query expansion pp. 211-233

Minh-Triet Tran, Lap Q. Trieu and Huy Q. Tran

Volume 28, issue 1, 2022

Intersections management for autonomous vehicles: a heuristic approach pp. 1-21

Victor Silva, Clauirton Siebra and Anand Subramanian

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 constraints pp. 23-59

Daiane Maria Genaro Chiroli, Sérgio Fernando Mayerle and João Neiva Figueiredo

A new heuristic for finding verifiable k-vertex-critical subgraphs pp. 61-91

Alex Gliesch and Marcus Ritt

Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs pp. 93-120

Sandra Ulrich Ngueveu, Christian Artigues, Nabil Absi and Safia Kedad-Sidhoum

A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem pp. 121-146

Alejandra Casado, Sergio Pérez-Peló, Jesús Sánchez-Oro and Abraham Duarte