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

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