Journal of Heuristics

2016 - 2025

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

Volume 27, issue 6, 2021

Conflict history based heuristic for constraint satisfaction problem solving pp. 951-990

Djamal Habet and Cyril Terrioux

A two-phase approach for integrating preventive maintenance with production and delivery in an unreliable coal mine pp. 991-1020

Song Jiu

Multi-level evolution strategies for high-resolution black-box control pp. 1021-1055

Ofer M. Shir, Xi. Xing and Herschel. Rabitz

A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application pp. 1057-1079

Taichi Kaji

Randomized rounding algorithms for large scale unsplittable flow problems pp. 1081-1110

François Lamothe, Emmanuel Rachelson, Alain Haït, Cedric Baudoin and Jean-Baptiste Dupé

Constraint-guided evolutionary algorithm for solving the winner determination problem pp. 1111-1150

Fernanda Nakano Kazama, Aluizio Fausto Ribeiro Araujo, Paulo Barros Correia and Elaine Guerrero-Peña

Volume 27, issue 5, 2021

Heuristic-based allocation of supply constrained blood platelets in emerging economies pp. 719-745

Fredrik Ødegaard and Sudipendra Nath Roy

Bi-criteria multiple knapsack problem with grouped items pp. 747-789

Francisco Castillo-Zunino and Pinar Keskinocak

A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem pp. 791-868

Venkatesh Pandiri and Alok Singh

Dynamic pricing with demand disaggregation for hotel revenue management pp. 869-885

Andrei M. Bandalouski, Natalja G. Egorova, Mikhail Y. Kovalyov, Erwin Pesch and S. Armagan Tarim

An adaptive large neighbourhood search algorithm for diameter bounded network design problems pp. 887-922

Michele Garraffa, Deepak Mehta, Barry O’Sullivan, Cemalettin Ozturk and Luis Quesada

Delayed improvement local search pp. 923-950

Heber F. Amaral, Sebastián Urrutia and Lars M. Hvattum

Volume 27, issue 4, 2021

Augmented intuition: a bridge between theory and practice pp. 497-547

Pablo Moscato, Luke Mathieson and Mohammad Nazmul Haque

Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape pp. 549-573

Marcella S. R. Martins, Mohamed El Yafrani, Myriam Delgado, Ricardo Lüders, Roberto Santana, Hugo V. Siqueira, Huseyin G. Akcay and Belaïd Ahiod

Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics pp. 575-614

Mohamed Abouhawwash and Kalyanmoy Deb

Enhancing large neighbourhood search heuristics for Benders’ decomposition pp. 615-648

Stephen J. Maher

A matheuristic for the stochastic facility location problem pp. 649-694

Renata Turkeš, Kenneth Sörensen and Daniel Palhazi Cuervo

Qfold: a new modeling paradigm for the RNA folding problem pp. 695-717

Mark W. Lewis, Amit Verma and Todd T. Eckdahl

Volume 27, issue 3, 2021

A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem pp. 267-301

Jonatas B. C. Chagas, Julian Blank, Markus Wagner, Marcone J. F. Souza and Kalyanmoy Deb

Local search for the maximum k-plex problem pp. 303-324

Wayne Pullan

A reduced cost-based restriction and refinement matheuristic for stochastic network design problem pp. 325-351

Fatemeh Sarayloo, Teodor Gabriel Crainic and Walter Rei

Iterated local search for single machine total weighted tardiness batch scheduling pp. 353-438

Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, Anand Subramanian and Artur A. Pessoa

A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists pp. 439-458

Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung and Le Hong Trang

Weighted proximity search pp. 459-496

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

Volume 27, issue 1, 2021

Special issue on matheuristics pp. 1-3

Yannick Kergosien, Jorge E. Mendoza and Vincent T’kindt

Focus distance-aware lifetime maximization of video camera-based wireless sensor networks pp. 5-30

André Rossi, Alok Singh and Marc Sevaux

The vehicle routing problem with cross-docking and resource constraints pp. 31-61

Philippe Grangier, Michel Gendreau, Fabien Lehuédé and Louis-Martin Rousseau

Matheuristics to optimize refueling and maintenance planning of nuclear power plants pp. 63-105

Nicolas Dupin and El-Ghazali Talbi

A balance-first sequence-last algorithm to design RMS: a matheuristic with performance guaranty to balance reconfigurable manufacturing systems pp. 107-132

Youssef Lahrichi, Laurent Deroussi, Nathalie Grangeon and Sylvie Norre

Scheduling hybrid flow shops with time windows pp. 133-158

Fan Yang and Roel Leus

Minimizing total completion time in the two-machine no-idle no-wait flow shop problem pp. 159-173

Federico Della Croce, Andrea Grosso and Fabio Salassa

The just-in-time job-shop scheduling problem with distinct due-dates for operations pp. 175-204

Mohammad Mahdi Ahmadian and Amir Salehipour

An automatic constructive matheuristic for the shift minimization personnel task scheduling problem pp. 205-227

Reshma Chirayil Chandrasekharan, Pieter Smet and Tony Wauters

CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines pp. 229-249

Javier Ferrer, Francisco Chicano and José Antonio Ortega-Toro

The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0–1 problems pp. 251-265

Monique Guignard and Aykut Ahlatcioglu