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

Volume 26, issue 6, 2020

A genetic algorithm for finding realistic sea routes considering the weather pp. 801-825

Stefan Kuhlemann and Kevin Tierney

Correction to: A genetic algorithm for finding realistic sea routes considering the weather pp. 827-827

Stefan Kuhlemann and Kevin Tierney

A tabu search for the design of capacitated rooted survivable planar networks pp. 829-850

Alain Hertz and Thomas Ridremont

Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances pp. 851-883

Felipe Campelo and Elizabeth F. Wanner

An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships pp. 885-912

Jone R. Hansen, Kjetil Fagerholt, Magnus Stålhane and Jørgen G. Rakke

Reactive VNS algorithm for the maximum k-subset intersection problem pp. 913-941

Fabio C. S. Dias, Wladimir Araújo Tavares and José Robertty de Freitas Costa

Volume 26, issue 5, 2020

Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic pp. 619-635

Joaquín Pacheco and Manuel Laguna

Heuristic/meta-heuristic methods for restricted bin packing problem pp. 637-662

Yu Fu and Amarnath Banerjee

IoT networks 3D deployment using hybrid many-objective optimization algorithms pp. 663-709

Sami Mnasri, Nejah Nasri, Malek Alrashidi, Adrien Bossche and Thierry Val

Distance-guided local search pp. 711-741

Daniel Porumbel and Jin-Kao Hao

A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs pp. 743-769

Jorik Jooken, Pieter Leyman and Patrick Causmaecker

Evolutionary multi-level acyclic graph partitioning pp. 771-799

Orlando Moreira, Merten Popp and Christian Schulz

Volume 26, issue 4, 2020

On combining variable ordering heuristics for constraint satisfaction problems pp. 453-474

Hongbo Li, Guozhong Feng and Minghao Yin

MIP neighborhood search heuristics for a service network design problem with design-balanced requirements pp. 475-502

Naoto Katayama

New heuristic algorithms for the Dubins traveling salesman problem pp. 503-530

Luitpold Babel

Heuristic solutions to robust variants of the minimum-cost integer flow problem pp. 531-559

Marko Špoljarec and Robert Manger

Pareto-based evolutionary multiobjective approaches and the generalized Nash equilibrium problem pp. 561-584

Rodica Ioana Lung, Noémi Gaskó and Mihai Alexandru Suciu

Meta-heuristics for the one-dimensional cutting stock problem with usable leftover pp. 585-618

Santiago V. Ravelo, Cláudio N. Meneses and Maristela O. Santos

Volume 26, issue 3, 2020

Special issue on recent innovations in variable neighborhood search pp. 335-338

Abraham Duarte and Eduardo G. Pardo

The selective traveling salesman problem with draft limits pp. 339-352

Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi and Raca Todosijević

A variable neighborhood search simheuristic for project portfolio selection under uncertainty pp. 353-375

Javier Panadero, Jana Doering, Renatas Kizys, Angel Juan and Angels Fito

The parking allocation problem for connected vehicles pp. 377-399

Marko Mladenović, Thierry Delot, Gilbert Laporte and Christophe Wilbaut

A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems pp. 401-422

Lorena Reyes-Rubiano, Laura Calvet, Angel Juan, Javier Faulin and Lluc Bové

A general variable neighborhood search for solving the multi-objective open vehicle routing problem pp. 423-452

Jesús Sánchez-Oro, Ana D. López-Sánchez and J. Manuel Colmenar

Volume 26, issue 2, 2020

Bilevel optimization based on iterative approximation of multiple mappings pp. 151-185

Ankur Sinha, Zhichao Lu, Kalyanmoy Deb and Pekka Malo

Heuristics for a vehicle routing problem with information collection in wireless networks pp. 187-217

Luis Flores-Luyo, Agostinho Agra, Rosa Figueiredo and Eladio Ocaña

A hybrid genetic algorithm for the traveling salesman problem with drone pp. 219-247

Quang Minh Ha, Yves Deville, Quang Dung Pham and Minh Hoàng Hà

Basic variable neighborhood search for the minimum sitting arrangement problem pp. 249-268

Eduardo G. Pardo, Antonio García-Sánchez, Marc Sevaux and Abraham Duarte

Logistics optimization for a coal supply chain pp. 269-300

Gleb Belov, Natashia L. Boland, Martin W. P. Savelsbergh and Peter J. Stuckey

Enhancement for human resource management in the ULD build-up process of air-cargo terminal: a strategic linkage approach pp. 301-333

Hyun Jun Yang, Suk Jae Jeong and Sung Wook Yoon

Volume 26, issue 1, 2020

Objective scaling ensemble approach for integer linear programming pp. 1-19

Weili Zhang and Charles D. Nicholson

A heuristic for fair dynamic resource allocation in overloaded OFDMA systems pp. 21-32

Adam N. Letchford, Qiang Ni and Zhaoyu Zhong

A coordinated production and transportation scheduling problem with minimum sum of order delivery times pp. 33-58

Ling Liu, Wenli Li, Kunpeng Li and Xuxia Zou

MIQP model and improvement heuristic for power loss minimization in distribution system with network reconfiguration pp. 59-81

Karla B. Freitas, Márcio S. Arantes, Claudio F. M. Toledo and Alexandre C. B. Delbem

Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem pp. 83-118

Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir and Erwin Pesch

A comparative study of multi-objective machine reassignment algorithms for data centres pp. 119-150

Takfarinas Saber, Xavier Gandibleux, Michael O’Neill, Liam Murphy and Anthony Ventresque