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 25, issue 6, 2019

Cascading failures in complex networks caused by overload attacks pp. 837-859

Volker Turau and Christoph Weyer

An evolutionary hybrid search heuristic for monitor placement in communication networks pp. 861-899

Robin Mueller-Bady, Martin Kappes, Inmaculada Medina-Bulo and Francisco Palomo-Lozano

Dynamic heuristic acceleration of linearly approximated SARSA( $$\lambda $$ λ ): using ant colony optimization to learn heuristics dynamically pp. 901-932

Stefano Bromuri

An application of generalised simulated annealing towards the simultaneous modelling and clustering of glaucoma pp. 933-957

Mohd Zairul Mazwan Bin Jilani, Allan Tucker and Stephen Swift

Creating dispatching rules by simple ensemble combination pp. 959-1013

Marko Ɖurasević and Domagoj Jakobović

Predicting effective control parameters for differential evolution using cluster analysis of objective function features pp. 1015-1031

Sean P. Walton and M. Rowan Brown

Volume 25, issue 4, 2019

Intensification, Diversification and Learning in metaheuristic optimization pp. 517-520

Fred Glover and Michele Samorani

Diversification-based learning in computing and optimization pp. 521-537

Fred Glover and Jin-Kao Hao

Intensification, learning and diversification in a hybrid metaheuristic: an efficient unification pp. 539-564

Vinícius R. Máximo and Mariá C. V. Nascimento

Iterated backtrack removal search for finding k-vertex-critical subgraphs pp. 565-590

Wen Sun, Jin-Kao Hao and Alexandre Caminada

A combined approach for analysing heuristic algorithms pp. 591-628

Jeroen Corstjens, Nguyen Dang, Benoît Depaire, An Caris and Patrick Causmaecker

Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem pp. 629-642

Michele Samorani, Yang Wang, Yang Wang, Zhipeng Lv and Fred Glover

Diversification methods for zero-one optimization pp. 643-671

Fred Glover, Gary Kochenberger, Weihong Xie and Jianbin Luo

A UAV location and routing problem with spatio-temporal synchronization constraints solved by ant colony optimization pp. 673-701

Oktay Yılmaz, Ertan Yakıcı and Mumtaz Karatas

Patient classification considering the risk of restenosis after coronary stent placement pp. 703-729

Halenur Şahin, Serhan Duran, Ertan Yakıcı and Mahmut Şahin

An effective multi-wave algorithm for solving the max-mean dispersion problem pp. 731-752

Jiawei Song, Yang Wang, Haibo Wang, Qinghua Wu and Abraham P. Punnen

Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem pp. 753-792

Haneen Algethami, Anna Martínez-Gavara and Dario Landa-Silva

Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling pp. 793-807

R. Christopher L. Riley and Cesar Rego

Swarm hyperheuristic framework pp. 809-836

Surafel Luleseged Tilahun and Mohamed A. Tawhid

Volume 25, issue 3, 2019

Virtual machine consolidation using constraint-based multi-objective optimization pp. 339-375

Miguel Terra-Neves, Inês Lynce and Vasco Manquinho

Real-time heuristic algorithms for the static weapon target assignment problem pp. 377-397

Alexander G. Kline, Darryl K. Ahner and Brian J. Lunday

An analysis of heuristic subsequences for offline hyper-heuristic learning pp. 399-430

W. B. Yates and E. C. Keedwell

A bi-objective study of the minimum latency problem pp. 431-454

N. A. Arellano-Arriaga, J. Molina, S. E. Schaeffer, A. M. Álvarez-Socarrás and I. A. Martínez-Salazar

Parallelism in divide-and-conquer non-dominated sorting: a theoretical study considering the PRAM-CREW model pp. 455-483

Sumit Mishra and Carlos A. Coello Coello

Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows pp. 485-515

Slim Belhaiza, Rym M’Hallah, Ghassen Ben Brahim and Gilbert Laporte

Volume 25, issue 2, 2019

A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time pp. 141-173

Andresson Silva Firmino, Ricardo Martins Abreu Silva and Valéria Cesário Times

Scheduling of mobile robots for transportation and manufacturing tasks pp. 175-213

Quang-Vinh Dang, Cong Thanh Nguyen and Hana Rudová

A local branching matheuristic for the multi-vehicle routing problem with stochastic demands pp. 215-245

Florent Hernandez, Michel Gendreau, Ola Jabali and Walter Rei

Implementation of a maximum clique search procedure on CUDA pp. 247-271

Paweł Daniluk, Grzegorz Firlik and Bogdan Lesyng

A variable space search heuristic for the Capacitated Team Orienteering Problem pp. 273-303

Asma Ben-Said, Racha El-Hajj and Aziz Moukrim

Sample size estimation for power and accuracy in the experimental comparison of algorithms pp. 305-338

Felipe Campelo and Fernanda Takahashi

Volume 25, issue 1, 2019

A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects pp. 1-45

Kristina Yancey Spencer, Pavel V. Tsvetkov and Joshua J. Jarrell

Combining simulated annealing with local search heuristic for MAX-SAT pp. 47-69

Noureddine Bouhmala

Archivers for the representation of the set of approximate solutions for MOPs pp. 71-105

O. Schütze, C. Hernández, E-G. Talbi, J. Q. Sun, Y. Naranjani and F.-R. Xiong

Use of a goal-constraint-based approach for finding the region of interest in multi-objective problems pp. 107-139

Ricardo Landa, Giomara Lárraga and Gregorio Toscano

Volume 24, issue 6, 2018

Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm pp. 817-851

Andreas C. Nearchou

Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation pp. 853-877

Aymeric Blot, Marie-Éléonore Kessaci and Laetitia Jourdan

On the empirical scaling of running time for finding optimal solutions to the TSP pp. 879-898

Zongxu Mu, Jérémie Dubois-Lacoste, Holger H. Hoos and Thomas Stützle

Scheduling crossover cranes at container terminals during seaside peak times pp. 899-932

Anne Ehleiter and Florian Jaehn

Volume 24, issue 5, 2018

Fast algorithms for fragmentable items bin packing pp. 697-723

Benjamin Byholm and Ivan Porres

Achieving fully proportional representation by clustering voters pp. 725-756

Piotr Faliszewski, Arkadii Slinko, Kolja Stahl and Nimrod Talmon

Multi-objective performance improvements of general finite single-server queueing networks pp. 757-781

F. R. B. Cruz, A. R. Duarte and G. L. Souza

A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic pp. 783-815

Alberto Santini, Stefan Ropke and Lars Magnus Hvattum

Volume 24, issue 4, 2018

Evaluating selection methods on hyper-heuristic multi-objective particle swarm optimization pp. 581-616

Olacir R. Castro, Gian Mauricio Fritsche and Aurora Pozo

All Colors Shortest Path problem on trees pp. 617-644

Mehmet Berkehan Akçay, Hüseyin Akcan and Cem Evrendilek

A fix-and-optimize matheuristic for university timetabling pp. 645-665

Michael Lindahl, Matias Sørensen and Thomas R. Stidsen

A study on exponential-size neighborhoods for the bin packing problem with conflicts pp. 667-695

Renatha Capua, Yuri Frota, Luiz Satoru Ochi and Thibaut Vidal

Volume 24, issue 3, 2018

Editorial for the special issue on metaheuristics for combinatorial optimization pp. 239-242

Bin Hu and Francisco Chicano

PageRank centrality for performance prediction: the impact of the local optima network model pp. 243-264

Sebastian Herrmann, Gabriela Ochoa and Franz Rothlauf

Mapping the global structure of TSP fitness landscapes pp. 265-294

Gabriela Ochoa and Nadarajen Veerapen

A case study of algorithm selection for the traveling thief problem pp. 295-320

Markus Wagner, Marius Lindauer, Mustafa Mısır, Samadhi Nallaperuma and Frank Hutter

Tackling the edge dynamic graph colouring problem with and without future adjacency information pp. 321-343

Bradley Hardy, Rhyd Lewis and Jonathan Thompson

Simple but effective heuristics for the 2-constraint bin packing problem pp. 345-357

Roberto Aringhieri, Davide Duma, Andrea Grosso and Pierre Hosteins

A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem pp. 359-394

Alejandro Arbelaez, Deepak Mehta, Barry O’Sullivan and Luis Quesada

Dynamic reconfiguration in multigroup multicast routing under uncertainty pp. 395-423

Pavel Troubil, Hana Rudová and Petr Holub

Evolutionary computation for automatic Web service composition: an indirect representation approach pp. 425-456

Alexandre Sawczuk Silva, Yi Mei, Hui Ma and Mengjie Zhang

Finding short and implementation-friendly addition chains with evolutionary algorithms pp. 457-481

Stjepan Picek, Carlos A. Coello Coello, Domagoj Jakobovic and Nele Mentens

Metaheuristic approaches to the placement of suicide bomber detectors pp. 483-513

Carlos Cotta and José E. Gallardo

On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem pp. 515-550

Sandra Zajac

A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem pp. 551-579

Christian Blum and Maria J. Blesa

Volume 24, issue 2, 2018

A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems pp. 111-133

J. Molina, A. D. López-Sánchez, A. G. Hernández-Díaz and I. Martínez-Salazar

Scaling-up many-objective combinatorial optimization with Cartesian products of scalarization functions pp. 135-172

Mădălina M. Drugan

Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem pp. 173-203

Alexander Lawrinenko, Stefan Schwerdfeger and Rico Walter

Pareto local search algorithms for the multi-objective beam angle optimisation problem pp. 205-238

Guillermo Cabrera-Guerrero, Andrew J. Mason, Andrea Raith and Matthias Ehrgott

Volume 24, issue 1, 2018

Variations on memetic algorithms for graph coloring problems pp. 1-24

Laurent Moalic and Alexandre Gondran

Hybrid multi-objective Bayesian estimation of distribution algorithm: a comparative analysis for the multi-objective knapsack problem pp. 25-47

Marcella S. R. Martins, Myriam R. B. S. Delgado, Ricardo Lüders, Roberto Santana, Richard A. Gonçalves and Carolina P. Almeida

Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing pp. 49-81

Alexander Biele and Lars Mönch

Dynamic region visit routing problem for vehicles with minimum turning radius pp. 83-109

Douglas G. Macharet, Armando Alves Neto, Vila F. Camara Neto and Mario F. M. Campos