default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 31
Volume 31, Number 1, March 2025
- Willy Alves de Oliveira Soler, Maristela Oliveira Santos, Kerem Akartunali:
Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times. 1-35 - Arben Ahmeti
, Nysret Musliu:
Hybridizing constraint programming and meta-heuristics for multi-mode resource-constrained multiple projects scheduling Problem. 1-37 - Hongqi Li, Feilong Wang, Hanxi Xiong, Zhiqi Wang:
Two-echelon van-robot routing problem with sharing-curbside satellites. 1-35 - Ahmed Khassiba:
An efficient backtracking heuristic for the resource allocation problem with compatibility and exclusivity constraints. 1-29 - Méziane Aïder, Sabrin Boulebene, Mhand Hifi:
An adaptative multi-objective scatter search for solving the dynamic bin packing problem. 1-69 - Martha Flores-Sosa, José M. Merigó, Kenia Sanchez-Valenzuela:
30 years of the Journal of Heuristics: a bibliometric analysis. 6 - Banafsheh Amiri, Koorush Ziarati, Somayeh Sohrabi:
A memetic algorithm for the flexible periodic vehicle routing problem. 7 - Cheng Chen, Emrah Demir, Xisheng Hu, Hainan Huang:
Transforming last mile delivery with heterogeneous assistants: drones and delivery robots. 8 - Marwa Chabbouh, Slim Bechikh, Efrén Mezura-Montes, Lamjed Ben Said:
Evolutionary optimization of the area under precision-recall curve for classifying imbalanced multi-class data. 9 - Miguel García-Torres:
Feature selection for high-dimensional data using a multivariate search space reduction strategy based scatter search. 10 - Lily Major, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Christine Zarges:
Heuristics for the run-length encoded Burrows-Wheeler transform alphabet ordering problem. 11 - Benjamin G. Thengvall, Shane N. Hall, Michael P. Deskevich:
Measuring the effectiveness and efficiency of simulation optimization metaheuristic algorithms. 12 - Óscar Soto-Sánchez, María Sierra-Paradinas, Micael Gallego, Antonio Alonso-Ayuso, Francisco Gortázar:
A heuristic algorithm to improving the coil slitting process in the steel industry. 13 - Liqun Liu, Yuanjun Feng, Qingcheng Zeng, Zhijun Chen, Yaqiu Li:
A Q-learning-based algorithm for the block relocation problem. 14 - Yuzhe Zhao, Peiyun Peng, Jingmiao Zhou, Yadong Wang:
Heuristic algorithm for integrated ship scheduling, routing and stowage problem in multi-vessel roll-on/roll-off shipping. 15 - Elisama de Araújo Silva Oliveira, Elizabeth F. Wanner, Elisangela Martins de Sá, Sérgio Ricardo de Souza:
A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs. 16 - Ye Zhang, Jinlong He, Yupeng Zhou, Shuli Hu, Dunbo Cai, Naiyu Tian, Minghao Yin:
An effective population-based approach for the partial set covering problem. 17
Volume 31, Number 2, June 2025
- Shaowen Lan, Yongliang Lu, Wenjuan Fan:
An adaptive variable neighborhood search for the traveling salesman problem with job-times. 18 - Hassana Abdullahi, Lorena S. Reyes-Rubiano, Djamila Ouelhadj, Javier Faulin, Angel A. Juan:
A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands. 19 - Nafiseh Ghorbani-Renani, Andrés D. González, Kash Barker:
Hybrid algorithms for enhanced efficiency and scalability of network-based tri-level interdiction models. 20 - Zongji Li, Tobias Seidel, Dominik Leib, Michael Bortz, Raoul Heese:
Efficient solution of the number partitioning problem on a quantum annealer: a hybrid quantum-classical decomposition approach. 21 - Bruno Oliveira, Artur Alves Pessoa, Marcos Costa Roboredo:
Hybrid iterated local search algorithm for the vehicle routing problem with lockers. 22 - Miguel Ángel Marfurt Alarcón, Lehilton Lelis Chaves Pedrosa, Fábio Luiz Usberti:
Fast constructive heuristics for the uncapacitated inventory routing problem. 23 - Xabier Martin, Peter B. Keenan, Javier Panadero, Seán McGarraghy, Angel A. Juan:
A biased-randomised iterated local search for the team orienteering arc routing problem allowing different origin and destination. 24 - Francisco Javier Gil Gala, Marko Durasevic, María R. Sierra, Ramiro Varela:
Tree search hyper-heuristic with application to combinatorial optimization. 25
Volume 31, Number 3, September 2025
- Guido Passage, Marjan van den Akker, Han Hoogeveen:
A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling. 26 - Yufan Huang, Binghai Zhou:
A Tabu-Bi-label hybridized branch and price algorithm for just-in-time material handling scheduling problems of mixed-model assembly lines with electric vehicle recharging requirements. 27 - Dimitri Weiß, Elias Schede, Kevin Tierney:
Selector: Ensemble-Based Automated Algorithm Configuration. 28 - Arnab Kole, Anindya Jyoti Pal:
Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances. 29 - Samuel Deleplanque, Luis Fernando Pérez Armas, Stefan Creemers:
solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT. 30 - Bhakti Stephan Onggo, Xabier Martin, Canan G. Corlu, Javier Panadero, Angel A. Juan:
Stochastic capacitated dispersion problems in disaster preparedness for mass casualty incident. 31
Volume 31, Number 4, December 2025
- Antonio Augusto Chaves, Mauricio G. C. Resende, Martin J. A. Schuetz, John Kyle Brubaker, Helmut G. Katzgraber, Edilson Fernandes de Arruda, Ricardo M. A. Silva:
A Random-Key optimizer for combinatorial optimization. 32 - Hélder Silva Ferreira, Rian G. S. Pinheiro:
An iterated local search heuristic for the maximum Intersection of k-subsets problem. 33 - Miroslaw Lawrynowicz, Jerzy Józefczyk:
Minimax regret makespan scheduling with interval release dates on unrelated machines. 34 - Arjun Ghosh, Nanda Dulal Jana, Subhayu Ghosh:
Automated CNN architecture design with enhanced particle swarm optimization. 35 - Katrin Halbig, Adrian Göß, Dieter Weninger:
Exploiting user-supplied Decompositions inside Heuristics. 36
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-28 23:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
