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

Volume 22, issue 6, 2016

Can Monte-Carlo Tree Search learn to sacrifice? pp. 783-813

Nathan Companez and Aldeida Aleti

Minimizing cyclic cutwidth of graphs using a memetic algorithm pp. 815-848

Pallavi Jain, Kamal Srivastava and Gur Saran

Order acceptance and scheduling with earliness and tardiness penalties pp. 849-890

Simon Thevenin, Nicolas Zufferey and Marino Widmer

Volume 22, issue 5, 2016

Editor’s Note on the MIC 2013 Special Issue of the Journal of Heuristics (Volume 22, Issue 4, August 2016) pp. 665-666

Manuel Laguna

Roster evaluation based on classifiers for the nurse rostering problem pp. 667-697

Roman Václavík, Přemysl Šůcha and Zdeněk Hanzálek

A novel GRASP solution approach for the Orienteering Problem pp. 699-726

Morteza Keshtkaran and Koorush Ziarati

Iterated local search with Trellis-neighborhood for the partial Latin square extension problem pp. 727-757

Kazuya Haraguchi

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering pp. 759-782

Henning Meyerhenke, Peter Sanders and Christian Schulz

Volume 22, issue 4, 2016

New developments in metaheuristics and their applications pp. 359-363

Hoong Chuin Lau, Günther R. Raidl and Pascal Hentenryck

DC-GRASP: directing the search on continuous-GRASP pp. 365-382

Tiago Maritan Ugulino Araújo, Lisieux Marie M. S. Andrade, Carlos Magno, Lucídio Anjos Formiga Cabral, Roberto Quirino Nascimento and Cláudio N. Meneses

Multiobjective improved spatial fuzzy c-means clustering for image segmentation combining Pareto-optimal clusters pp. 383-404

Ahmed Nasreddine Benaichouche, Hamouche Oulhadj and Patrick Siarry

A corridor method based hybrid algorithm for redundancy allocation pp. 405-429

Marco Caserta and Stefan Voß

Analysing differences between algorithm configurations through ablation pp. 431-458

Chris Fawcett and Holger H. Hoos

Proximity search heuristics for wind farm optimal layout pp. 459-474

Martina Fischetti and Michele Monaci

A memetic algorithm for the virtual network mapping problem pp. 475-505

Johannes Inführ and Günther Raidl

Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems pp. 507-537

Chandra Ade Irawan, Said Salhi and Zvi Drezner

A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints pp. 539-566

Jorge E. Mendoza, Louis-Martin Rousseau and Juan G. Villegas

New variable depth local search for multiple depot vehicle scheduling problems pp. 567-585

Tomoshi Otsuki and Kazuyuki Aihara

An iterated greedy metaheuristic for the blocking job shop scheduling problem pp. 587-611

Marco Pranzo and Dario Pacciarelli

Estimating parallel runtimes for randomized algorithms in constraint solving pp. 613-648

Charlotte Truchet, Alejandro Arbelaez, Florian Richoux and Philippe Codognet

Flying elephants: a general method for solving non-differentiable problems pp. 649-664

Adilson Elias Xavier and Vinicius Layter Xavier

Volume 22, issue 3, 2016

Extending quick hypervolume pp. 245-271

Luís M. S. Russo and Alexandre P. Francisco

The hypervolume based directed search method for multi-objective optimization problems pp. 273-300

Oliver Schütze, Víctor Adrián Sosa Hernández, Heike Trautmann and Günter Rudolph

Comparative analysis of three metaheuristics for short-term open pit block sequencing pp. 301-329

Amin Mousavi, Erhan Kozan and Shi Qiang Liu

Multi-wave algorithms for metaheuristic optimization pp. 331-358

Fred Glover

Volume 22, issue 2, 2016

Improving degree-based variable ordering heuristics for solving constraint satisfaction problems pp. 125-145

Hongbo Li, Yanchun Liang, Ning Zhang, Jinsong Guo, Dong Xu and Zhanshan Li

PSO-based and SA-based metaheuristics for bilinear programming problems: an application to the pooling problem pp. 147-179

Gökalp Erbeyoğlu and Ümit Bilge

Proximity Benders: a decomposition heuristic for stochastic programs pp. 181-198

Natashia Boland, Matteo Fischetti, Michele Monaci and Martin Savelsbergh

A fast meta-heuristic approach for the $$(\alpha,\beta )-k$$ ( α, β ) - k -feature set problem pp. 199-220

Mateus Rocha de Paula, Regina Berretta and Pablo Moscato

Strategic oscillation for the capacitated hub location problem with modular links pp. 221-244

Ángel Corberán, Juanjo Peiró, Vicente Campos, Fred Glover and Rafael Martí

Volume 22, issue 1, 2016

Exploiting subproblem optimization in SAT-based MaxSAT algorithms pp. 1-53

Carlos Ansótegui, Joel Gabàs and Jordi Levy

A GRASP metaheuristic for humanitarian aid distribution pp. 55-87

José M. Ferrer, M. Teresa Ortuño and Gregorio Tirado

A mapping technique for better solution exploration: NSGA-II adaptation pp. 89-123

Julien Autuori, Faicel Hnaien and Farouk Yalaoui