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

Volume 23, issue 6, 2017

Heterogeneous surface-to-air missile defense battery location: a game theoretic approach pp. 417-447

Nicholas T. Boardman, Brian J. Lunday and Matthew J. Robbins

Constructive cooperative coevolution for large-scale global optimisation pp. 449-469

Emile Glorieux, Bo Svensson, Fredrik Danielsson and Bengt Lennartson

Iterated local search for workforce scheduling and routing problems pp. 471-500

Fulin Xie, Chris N. Potts and Tolga Bektaş

Constraint-based search for optimal Golomb rulers pp. 501-532

M. M. A. Polash, M. A. H. Newton and A. Sattar

A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem pp. 533-550

H. Faria, M. G. C. Resende and D. Ernst

Volume 23, issue 5, 2017

On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem pp. 285-319

Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski and Frédéric Saubion

Metaheuristics approach for solving personalized crew rostering problem in public bus transit pp. 321-347

Lin Xie, Marius Merschformann, Natalia Kliewer and Leena Suhl

When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem pp. 349-366

Jesus Garcia-Diaz, Jairo Sanchez-Hernandez, Ricardo Menchaca-Mendez and Rolando Menchaca-Mendez

An efficient local search algorithm for the winner determination problem pp. 367-396

Haochen Zhang, Shaowei Cai, Chuan Luo and Minghao Yin

A heuristic approach for the stochastic optimization of mine production schedules pp. 397-415

Luis Montiel and Roussos Dimitrakopoulos

Volume 23, issue 4, 2017

Mathematical programming based heuristics for the 0–1 MIP: a survey pp. 165-206

Saïd Hanafi and Raca Todosijević

Finding near-optimal independent sets at scale pp. 207-229

Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Renato F. Werneck

A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production pp. 231-256

Folarin B. Oyebolu, Jeroen Lidth de Jeude, Cyrus Siganporia, Suzanne S. Farid, Richard Allmendinger and Juergen Branke

Scatter search for trainees to software project requirements stable allocation pp. 257-283

Mangesh Gharote, Rahul Patil and Sachin Lodha

Volume 23, issue 2, 2017

Scatter search for minimizing weighted tardiness in a single machine scheduling with setups pp. 81-110

Miguel A. González, Juan José Palacios, Camino R. Vela and Alejandro Hernández-Arauzo

A heuristic approach for dividing graphs into bi-connected components with a size constraint pp. 111-136

Raka Jovanovic, Tatsushi Nishi and Stefan Voß

A variable neighborhood search for the network design problem with relays pp. 137-164

Yiyong Xiao and Abdullah Konak

Volume 23, issue 1, 2017

Reference sharing: a new collaboration model for cooperative coevolution pp. 1-30

Min Shi and Shang Gao

Network design through forests with degree- and role-constrained minimum spanning trees pp. 31-51

Laura Anton-Sanchez, Concha Bielza and Pedro Larrañaga

A dynamic programming operator for tour location problems applied to the covering tour problem pp. 53-80

Leticia Vargas, Nicolas Jozefowiez and Sandra Ulrich Ngueveu