Printed from https://ideas.repec.org/s/spr/joheur.html
Content
March 2025, Volume 31, Issue 1
- 1-29 An efficient backtracking heuristic for the resource allocation problem with compatibility and exclusivity constraints
by Ahmed Khassiba - 1-35 Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times
by Willy A. Oliveira Soler & Maristela O. Santos & Kerem Akartunalı - 1-35 Two-echelon van-robot routing problem with sharing-curbside satellites
by Hongqi Li & Feilong Wang & Hanxi Xiong & Zhiqi Wang - 1-37 Hybridizing constraint programming and meta-heuristics for multi-mode resource-constrained multiple projects scheduling Problem
by Arben Ahmeti & Nysret Musliu - 1-55 30 years of the Journal of Heuristics: a bibliometric analysis
by Martha Flores-Sosa & José M. Merigó & Kenia Sanchez-Valenzuela - 1-69 An adaptative multi-objective scatter search for solving the dynamic bin packing problem
by Méziane Aïder & Sabrin Boulebene & Mhand Hifi
December 2024, Volume 30, Issue 5
- 225-267 A large-scale neighborhood search algorithm for multi-activity tour scheduling problems
by Rana Shariat & Kai Huang - 269-289 Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs
by Gabriel Siqueira & Andre Rodrigues Oliveira & Alexsandro Oliveira Alexandrino & Géraldine Jean & Guillaume Fertin & Zanoni Dias - 291-323 Mathematical models and solving methods for diversity and equity optimization
by Rafael Martí & Francisco Parreño & Jorge Mortes - 325-358 On the emerging potential of quantum annealing hardware for combinatorial optimization
by Byron Tasseff & Tameem Albash & Zachary Morrell & Marc Vuffray & Andrey Y. Lokhov & Sidhant Misra & Carleton Coffrin - 359-396 A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles
by İlknur Tükenmez & Tugba Saraç & Onur Kaya - 397-397 Correction to: A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles
by İlknur Tükenmez & Tugba Saraç & Onur Kaya - 399-420 An integrated ILS-VND strategy for solving the knapsack problem with forfeits
by Matheus M. Vieira & Bruno Nogueira & Rian G. S. Pinheiro - 421-421 Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits
by Matheus M. Vieira & Bruno Nogueira & Rian G. S. Pinheiro - 423-451 Genetic programming hyper-heuristic for evolving a maintenance policy for wind farms
by Yikai Ma & Wenjuan Zhang & Juergen Branke
August 2024, Volume 30, Issue 3
- 109-144 Algorithmic strategies for a fast exploration of the TSP $$4$$ 4 -OPT neighborhood
by Giuseppe Lancia & Marcello Dalpasso - 145-172 A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems
by Guilherme Barbosa Almeida & Elisangela Martins Sá & Sérgio Ricardo Souza & Marcone Jamilson Freitas Souza - 173-198 Interpretability of rectangle packing solutions with Monte Carlo tree search
by Yeray Galán López & Cristian González García & Vicente García Díaz & Edward Rolando Núñez Valdez & Alberto Gómez Gómez - 199-224 Metaheuristics and machine learning: an approach with reinforcement learning assisting neural architecture search
by Sandra Mara Scós Venske & Carolina Paula Almeida & Myriam Regattieri Delgado
April 2024, Volume 30, Issue 1
- 1-41 A hybrid variable neighborhood search heuristic for the sustainable time-dependent truck-drone routing problem with rendezvous locations
by Ebrahim Teimoury & Reza Rashid - 43-65 DSLS: a simple and efficient local search algorithm for the maximum bisection problem
by Xinliang Tian & Dantong Ouyang & Huisi Zhou & Rui Sun & Liming Zhang - 67-107 A heuristic algorithm using tree decompositions for the maximum happy vertices problem
by Louis Carpentier & Jorik Jooken & Jan Goedgebeur
December 2023, Volume 29, Issue 4
- 409-434 An integrated learning and progressive hedging matheuristic for stochastic network design problem
by Fatemeh Sarayloo & Teodor Gabriel Crainic & Walter Rei - 435-460 A matheuristic approach for the family traveling salesman problem
by Abtin Nourmohammadzadeh & Malek Sarhani & Stefan Voß - 461-485 On robust vs fast solving of qualitative constraints
by Jan Wehner & Michael Sioutis & Diedrich Wolter - 487-544 Solving travelling thief problems using coordination based methods
by Majid Namazi & M. A. Hakim Newton & Conrad Sanderson & Abdul Sattar - 545-580 Effective adaptive large neighborhood search for a firefighters timetabling problem
by Mohamed-Amine Ouberkouk & Jean-Paul Boufflet & Aziz Moukrim
June 2023, Volume 29, Issue 2
- 207-228 Anisotropic Q-learning and waiting estimation based real-time routing for automated guided vehicles at container terminals
by Pengfei Zhou & Li Lin & Kap Hwan Kim - 229-267 A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors
by Fatma-Zohra Baatout & Mhand Hifi - 269-311 A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window
by Fagui Liu & Lvshengbiao Wang & Mengke Gui & Yang Zhang & Yulin Lan & Chengqi Lai & Boyuan Zhu - 313-347 Learning fine-grained search space pruning and heuristics for combinatorial optimization
by Juho Lauri & Sourav Dutta & Marco Grassia & Deepak Ajwani - 349-382 The ALNS metaheuristic for the transmission maintenance scheduling
by David Woller & Jakub Rada & Miroslav Kulich - 383-408 An efficient scenario penalization matheuristic for a stochastic scheduling problem
by Michel Vasquez & Mirsad Buljubasic & Saïd Hanafi
February 2023, Volume 29, Issue 1
- 1-38 Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches
by Mohamad Alissa & Kevin Sim & Emma Hart - 39-76 A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports
by João Luiz Marques Andrade & Gustavo Campos Menezes - 77-137 Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system
by Bijun Wang & Zheyong Bian & Mo Mansouri - 139-175 Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem
by Hanyu Gu & Hue Chi Lam & Thi Thanh Thu Pham & Yakov Zinder - 177-206 Minimizing total completion time in large-sized pharmaceutical quality control scheduling
by Miguel S. E. Martins & Joaquim L. Viegas & Tiago Coito & Bernardo Firme & Andrea Costigliola & João Figueiredo & Susana M. Vieira & João M. C. Sousa
December 2022, Volume 28, Issue 5
- 583-618 Breakout local search for the cyclic cutwidth minimization problem
by Mu He & Qinghua Wu & Yongliang Lu - 619-651 Modeling and evolutionary algorithm for solving a multi-depot mixed vehicle routing problem with uncertain travel times
by Liang Sun - 653-697 Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem
by Martin Simensen & Geir Hasle & Magnus Stålhane
August 2022, Volume 28, Issue 4
- 377-431 Incomplete MaxSAT approaches for combinatorial testing
by Carlos Ansótegui & Felip Manyà & Jesus Ojeda & Josep M. Salvia & Eduard Torres - 433-479 Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems
by Ricardo N. Liang & Eduardo A. J. Anacleto & Cláudio N. Meneses - 481-508 Fixed set search applied to the multi-objective minimum weighted vertex cover problem
by Raka Jovanovic & Antonio P. Sanfilippo & Stefan Voß - 509-538 A systematic approach to parameter optimization and its application to flight schedule simulation software
by Alexander E. I. Brownlee & Michael G. Epitropakis & Jeroen Mulder & Marc Paelinck & Edmund K. Burke - 539-582 Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds
by Leandro R. Costa & Daniel Aloise & Luca G. Gianoli & Andrea Lodi
June 2022, Volume 28, Issue 3
- 235-258 Ride matching and vehicle routing for on-demand mobility services
by Sepide Lotfi & Khaled Abdelghany - 259-285 Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks
by R. Lewis & P. Corcoran - 287-328 A heuristic search based on diversity for solving combinatorial problems
by Francisco Casas & Claudio E. Torres & Ignacio Araya - 329-350 Weighted iterated local branching for mathematical programming problems with binary variables
by Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo - 351-375 A memetic algorithm for the inventory routing problem
by Mohamed Salim Amri Sakhri & Mounira Tlili & Ouajdi Korbaa
April 2022, Volume 28, Issue 2
- 147-148 Special issue on “The Eighth International Symposium on Information and Communication Technology—SoICT 2017”
by Ichiro Ide & Huynh Thi Thanh Binh - 149-169 Estimating searching cost of regular path queries on large graphs by exploiting unit-subqueries
by Van-Quyet Nguyen & Quyet-Thang Huynh & Kyungbaek Kim - 171-192 Identifying intentions in forum posts with cross-domain data
by Tu Minh Phuong & Le Cong Linh & Ngo Xuan Bach - 193-209 English–Vietnamese cross-language paraphrase identification using hybrid feature classes
by Dien Dinh & Nguyen Le Thanh - 211-233 Document representation and classification with Twitter-based document embedding, adversarial domain-adaptation, and query expansion
by Minh-Triet Tran & Lap Q. Trieu & Huy Q. Tran
February 2022, Volume 28, Issue 1
- 1-21 Intersections management for autonomous vehicles: a heuristic approach
by Victor Silva & Clauirton Siebra & Anand Subramanian - 23-59 Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints
by Daiane Maria Genaro Chiroli & Sérgio Fernando Mayerle & João Neiva Figueiredo - 61-91 A new heuristic for finding verifiable k-vertex-critical subgraphs
by Alex Gliesch & Marcus Ritt - 93-120 Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs
by Sandra Ulrich Ngueveu & Christian Artigues & Nabil Absi & Safia Kedad-Sidhoum - 121-146 A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem
by Alejandra Casado & Sergio Pérez-Peló & Jesús Sánchez-Oro & Abraham Duarte
December 2021, Volume 27, Issue 6
- 951-990 Conflict history based heuristic for constraint satisfaction problem solving
by Djamal Habet & Cyril Terrioux - 991-1020 A two-phase approach for integrating preventive maintenance with production and delivery in an unreliable coal mine
by Song Jiu - 1021-1055 Multi-level evolution strategies for high-resolution black-box control
by Ofer M. Shir & Xi. Xing & Herschel. Rabitz - 1057-1079 A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application
by Taichi Kaji - 1081-1110 Randomized rounding algorithms for large scale unsplittable flow problems
by François Lamothe & Emmanuel Rachelson & Alain Haït & Cedric Baudoin & Jean-Baptiste Dupé - 1111-1150 Constraint-guided evolutionary algorithm for solving the winner determination problem
by Fernanda Nakano Kazama & Aluizio Fausto Ribeiro Araujo & Paulo Barros Correia & Elaine Guerrero-Peña
October 2021, Volume 27, Issue 5
- 719-745 Heuristic-based allocation of supply constrained blood platelets in emerging economies
by Fredrik Ødegaard & Sudipendra Nath Roy - 747-789 Bi-criteria multiple knapsack problem with grouped items
by Francisco Castillo-Zunino & Pinar Keskinocak - 791-868 A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem
by Venkatesh Pandiri & Alok Singh - 869-885 Dynamic pricing with demand disaggregation for hotel revenue management
by Andrei M. Bandalouski & Natalja G. Egorova & Mikhail Y. Kovalyov & Erwin Pesch & S. Armagan Tarim - 887-922 An adaptive large neighbourhood search algorithm for diameter bounded network design problems
by Michele Garraffa & Deepak Mehta & Barry O’Sullivan & Cemalettin Ozturk & Luis Quesada - 923-950 Delayed improvement local search
by Heber F. Amaral & Sebastián Urrutia & Lars M. Hvattum
August 2021, Volume 27, Issue 4
- 497-547 Augmented intuition: a bridge between theory and practice
by Pablo Moscato & Luke Mathieson & Mohammad Nazmul Haque - 549-573 Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape
by Marcella S. R. Martins & Mohamed El Yafrani & Myriam Delgado & Ricardo Lüders & Roberto Santana & Hugo V. Siqueira & Huseyin G. Akcay & Belaïd Ahiod - 575-614 Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics
by Mohamed Abouhawwash & Kalyanmoy Deb - 615-648 Enhancing large neighbourhood search heuristics for Benders’ decomposition
by Stephen J. Maher - 649-694 A matheuristic for the stochastic facility location problem
by Renata Turkeš & Kenneth Sörensen & Daniel Palhazi Cuervo - 695-717 Qfold: a new modeling paradigm for the RNA folding problem
by Mark W. Lewis & Amit Verma & Todd T. Eckdahl
June 2021, Volume 27, Issue 3
- 267-301 A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem
by Jonatas B. C. Chagas & Julian Blank & Markus Wagner & Marcone J. F. Souza & Kalyanmoy Deb - 303-324 Local search for the maximum k-plex problem
by Wayne Pullan - 325-351 A reduced cost-based restriction and refinement matheuristic for stochastic network design problem
by Fatemeh Sarayloo & Teodor Gabriel Crainic & Walter Rei - 353-438 Iterated local search for single machine total weighted tardiness batch scheduling
by Eduardo Queiroga & Rian G. S. Pinheiro & Quentin Christ & Anand Subramanian & Artur A. Pessoa - 439-458 A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists
by Hoang Huu Viet & Nguyen Thi Uyen & SeungGwan Lee & TaeChoong Chung & Le Hong Trang - 459-496 Weighted proximity search
by Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo
April 2021, Volume 27, Issue 1
- 1-3 Special issue on matheuristics
by Yannick Kergosien & Jorge E. Mendoza & Vincent T’kindt - 5-30 Focus distance-aware lifetime maximization of video camera-based wireless sensor networks
by André Rossi & Alok Singh & Marc Sevaux - 31-61 The vehicle routing problem with cross-docking and resource constraints
by Philippe Grangier & Michel Gendreau & Fabien Lehuédé & Louis-Martin Rousseau - 63-105 Matheuristics to optimize refueling and maintenance planning of nuclear power plants
by Nicolas Dupin & El-Ghazali Talbi - 107-132 A balance-first sequence-last algorithm to design RMS: a matheuristic with performance guaranty to balance reconfigurable manufacturing systems
by Youssef Lahrichi & Laurent Deroussi & Nathalie Grangeon & Sylvie Norre - 133-158 Scheduling hybrid flow shops with time windows
by Fan Yang & Roel Leus - 159-173 Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
by Federico Della Croce & Andrea Grosso & Fabio Salassa - 175-204 The just-in-time job-shop scheduling problem with distinct due-dates for operations
by Mohammad Mahdi Ahmadian & Amir Salehipour - 205-227 An automatic constructive matheuristic for the shift minimization personnel task scheduling problem
by Reshma Chirayil Chandrasekharan & Pieter Smet & Tony Wauters - 229-249 CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines
by Javier Ferrer & Francisco Chicano & José Antonio Ortega-Toro - 251-265 The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0–1 problems
by Monique Guignard & Aykut Ahlatcioglu
December 2020, Volume 26, Issue 6
- 801-825 A genetic algorithm for finding realistic sea routes considering the weather
by Stefan Kuhlemann & Kevin Tierney - 827-827 Correction to: A genetic algorithm for finding realistic sea routes considering the weather
by Stefan Kuhlemann & Kevin Tierney - 829-850 A tabu search for the design of capacitated rooted survivable planar networks
by Alain Hertz & Thomas Ridremont - 851-883 Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances
by Felipe Campelo & Elizabeth F. Wanner - 885-912 An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships
by Jone R. Hansen & Kjetil Fagerholt & Magnus Stålhane & Jørgen G. Rakke - 913-941 Reactive VNS algorithm for the maximum k-subset intersection problem
by Fabio C. S. Dias & Wladimir Araújo Tavares & José Robertty de Freitas Costa
October 2020, Volume 26, Issue 5
- 619-635 Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic
by Joaquín Pacheco & Manuel Laguna - 637-662 Heuristic/meta-heuristic methods for restricted bin packing problem
by Yu Fu & Amarnath Banerjee - 663-709 IoT networks 3D deployment using hybrid many-objective optimization algorithms
by Sami Mnasri & Nejah Nasri & Malek Alrashidi & Adrien Bossche & Thierry Val - 711-741 Distance-guided local search
by Daniel Porumbel & Jin-Kao Hao - 743-769 A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs
by Jorik Jooken & Pieter Leyman & Patrick Causmaecker - 771-799 Evolutionary multi-level acyclic graph partitioning
by Orlando Moreira & Merten Popp & Christian Schulz
August 2020, Volume 26, Issue 4
- 453-474 On combining variable ordering heuristics for constraint satisfaction problems
by Hongbo Li & Guozhong Feng & Minghao Yin - 475-502 MIP neighborhood search heuristics for a service network design problem with design-balanced requirements
by Naoto Katayama - 503-530 New heuristic algorithms for the Dubins traveling salesman problem
by Luitpold Babel - 531-559 Heuristic solutions to robust variants of the minimum-cost integer flow problem
by Marko Špoljarec & Robert Manger - 561-584 Pareto-based evolutionary multiobjective approaches and the generalized Nash equilibrium problem
by Rodica Ioana Lung & Noémi Gaskó & Mihai Alexandru Suciu - 585-618 Meta-heuristics for the one-dimensional cutting stock problem with usable leftover
by Santiago V. Ravelo & Cláudio N. Meneses & Maristela O. Santos
June 2020, Volume 26, Issue 3
- 335-338 Special issue on recent innovations in variable neighborhood search
by Abraham Duarte & Eduardo G. Pardo - 339-352 The selective traveling salesman problem with draft limits
by Shahin Gelareh & Bernard Gendron & Saïd Hanafi & Rahimeh Neamatian Monemi & Raca Todosijević - 353-375 A variable neighborhood search simheuristic for project portfolio selection under uncertainty
by Javier Panadero & Jana Doering & Renatas Kizys & Angel A. Juan & Angels Fito - 377-399 The parking allocation problem for connected vehicles
by Marko Mladenović & Thierry Delot & Gilbert Laporte & Christophe Wilbaut - 401-422 A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems
by Lorena Reyes-Rubiano & Laura Calvet & Angel A. Juan & Javier Faulin & Lluc Bové - 423-452 A general variable neighborhood search for solving the multi-objective open vehicle routing problem
by Jesús Sánchez-Oro & Ana D. López-Sánchez & J. Manuel Colmenar
April 2020, Volume 26, Issue 2
- 151-185 Bilevel optimization based on iterative approximation of multiple mappings
by Ankur Sinha & Zhichao Lu & Kalyanmoy Deb & Pekka Malo - 187-217 Heuristics for a vehicle routing problem with information collection in wireless networks
by Luis Flores-Luyo & Agostinho Agra & Rosa Figueiredo & Eladio Ocaña - 219-247 A hybrid genetic algorithm for the traveling salesman problem with drone
by Quang Minh Ha & Yves Deville & Quang Dung Pham & Minh Hoàng Hà - 249-268 Basic variable neighborhood search for the minimum sitting arrangement problem
by Eduardo G. Pardo & Antonio García-Sánchez & Marc Sevaux & Abraham Duarte - 269-300 Logistics optimization for a coal supply chain
by Gleb Belov & Natashia L. Boland & Martin W. P. Savelsbergh & Peter J. Stuckey - 301-333 Enhancement for human resource management in the ULD build-up process of air-cargo terminal: a strategic linkage approach
by Hyun Jun Yang & Suk Jae Jeong & Sung Wook Yoon
February 2020, Volume 26, Issue 1
- 1-19 Objective scaling ensemble approach for integer linear programming
by Weili Zhang & Charles D. Nicholson - 21-32 A heuristic for fair dynamic resource allocation in overloaded OFDMA systems
by Adam N. Letchford & Qiang Ni & Zhaoyu Zhong - 33-58 A coordinated production and transportation scheduling problem with minimum sum of order delivery times
by Ling Liu & Wenli Li & Kunpeng Li & Xuxia Zou - 59-81 MIQP model and improvement heuristic for power loss minimization in distribution system with network reconfiguration
by Karla B. Freitas & Márcio S. Arantes & Claudio F. M. Toledo & Alexandre C. B. Delbem - 83-118 Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem
by Mohamed Amine Masmoudi & Manar Hosny & Emrah Demir & Erwin Pesch - 119-150 A comparative study of multi-objective machine reassignment algorithms for data centres
by Takfarinas Saber & Xavier Gandibleux & Michael O’Neill & Liam Murphy & Anthony Ventresque
December 2019, Volume 25, Issue 6
- 837-859 Cascading failures in complex networks caused by overload attacks
by Volker Turau & Christoph Weyer - 861-899 An evolutionary hybrid search heuristic for monitor placement in communication networks
by Robin Mueller-Bady & Martin Kappes & Inmaculada Medina-Bulo & Francisco Palomo-Lozano - 901-932 Dynamic heuristic acceleration of linearly approximated SARSA( $$\lambda $$ λ ): using ant colony optimization to learn heuristics dynamically
by Stefano Bromuri - 933-957 An application of generalised simulated annealing towards the simultaneous modelling and clustering of glaucoma
by Mohd Zairul Mazwan Bin Jilani & Allan Tucker & Stephen Swift - 959-1013 Creating dispatching rules by simple ensemble combination
by Marko Ɖurasević & Domagoj Jakobović - 1015-1031 Predicting effective control parameters for differential evolution using cluster analysis of objective function features
by Sean P. Walton & M. Rowan Brown
October 2019, Volume 25, Issue 4
- 517-520 Intensification, Diversification and Learning in metaheuristic optimization
by Fred Glover & Michele Samorani - 521-537 Diversification-based learning in computing and optimization
by Fred Glover & Jin-Kao Hao - 539-564 Intensification, learning and diversification in a hybrid metaheuristic: an efficient unification
by Vinícius R. Máximo & Mariá C. V. Nascimento - 565-590 Iterated backtrack removal search for finding k-vertex-critical subgraphs
by Wen Sun & Jin-Kao Hao & Alexandre Caminada - 591-628 A combined approach for analysing heuristic algorithms
by Jeroen Corstjens & Nguyen Dang & Benoît Depaire & An Caris & Patrick Causmaecker - 629-642 Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem
by Michele Samorani & Yang Wang & Yang Wang & Zhipeng Lv & Fred Glover - 643-671 Diversification methods for zero-one optimization
by Fred Glover & Gary Kochenberger & Weihong Xie & Jianbin Luo - 673-701 A UAV location and routing problem with spatio-temporal synchronization constraints solved by ant colony optimization
by Oktay Yılmaz & Ertan Yakıcı & Mumtaz Karatas - 703-729 Patient classification considering the risk of restenosis after coronary stent placement
by Halenur Şahin & Serhan Duran & Ertan Yakıcı & Mahmut Şahin - 731-752 An effective multi-wave algorithm for solving the max-mean dispersion problem
by Jiawei Song & Yang Wang & Haibo Wang & Qinghua Wu & Abraham P. Punnen - 753-792 Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem
by Haneen Algethami & Anna Martínez-Gavara & Dario Landa-Silva - 793-807 Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling
by R. Christopher L. Riley & Cesar Rego - 809-836 Swarm hyperheuristic framework
by Surafel Luleseged Tilahun & Mohamed A. Tawhid
June 2019, Volume 25, Issue 3
- 339-375 Virtual machine consolidation using constraint-based multi-objective optimization
by Miguel Terra-Neves & Inês Lynce & Vasco Manquinho - 377-397 Real-time heuristic algorithms for the static weapon target assignment problem
by Alexander G. Kline & Darryl K. Ahner & Brian J. Lunday - 399-430 An analysis of heuristic subsequences for offline hyper-heuristic learning
by W. B. Yates & E. C. Keedwell - 431-454 A bi-objective study of the minimum latency problem
by N. A. Arellano-Arriaga & J. Molina & S. E. Schaeffer & A. M. Álvarez-Socarrás & I. A. Martínez-Salazar - 455-483 Parallelism in divide-and-conquer non-dominated sorting: a theoretical study considering the PRAM-CREW model
by Sumit Mishra & Carlos A. Coello Coello - 485-515 Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows
by Slim Belhaiza & Rym M’Hallah & Ghassen Ben Brahim & Gilbert Laporte
April 2019, Volume 25, Issue 2
- 141-173 A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time
by Andresson Silva Firmino & Ricardo Martins Abreu Silva & Valéria Cesário Times - 175-213 Scheduling of mobile robots for transportation and manufacturing tasks
by Quang-Vinh Dang & Cong Thanh Nguyen & Hana Rudová - 215-245 A local branching matheuristic for the multi-vehicle routing problem with stochastic demands
by Florent Hernandez & Michel Gendreau & Ola Jabali & Walter Rei - 247-271 Implementation of a maximum clique search procedure on CUDA
by Paweł Daniluk & Grzegorz Firlik & Bogdan Lesyng - 273-303 A variable space search heuristic for the Capacitated Team Orienteering Problem
by Asma Ben-Said & Racha El-Hajj & Aziz Moukrim - 305-338 Sample size estimation for power and accuracy in the experimental comparison of algorithms
by Felipe Campelo & Fernanda Takahashi
February 2019, Volume 25, Issue 1
- 1-45 A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects
by Kristina Yancey Spencer & Pavel V. Tsvetkov & Joshua J. Jarrell - 47-69 Combining simulated annealing with local search heuristic for MAX-SAT
by Noureddine Bouhmala - 71-105 Archivers for the representation of the set of approximate solutions for MOPs
by O. Schütze & C. Hernández & E-G. Talbi & J. Q. Sun & Y. Naranjani & F.-R. Xiong - 107-139 Use of a goal-constraint-based approach for finding the region of interest in multi-objective problems
by Ricardo Landa & Giomara Lárraga & Gregorio Toscano
December 2018, Volume 24, Issue 6
- 817-851 Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm
by Andreas C. Nearchou - 853-877 Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation
by Aymeric Blot & Marie-Éléonore Kessaci & Laetitia Jourdan - 879-898 On the empirical scaling of running time for finding optimal solutions to the TSP
by Zongxu Mu & Jérémie Dubois-Lacoste & Holger H. Hoos & Thomas Stützle - 899-932 Scheduling crossover cranes at container terminals during seaside peak times
by Anne Ehleiter & Florian Jaehn
October 2018, Volume 24, Issue 5
- 697-723 Fast algorithms for fragmentable items bin packing
by Benjamin Byholm & Ivan Porres - 725-756 Achieving fully proportional representation by clustering voters
by Piotr Faliszewski & Arkadii Slinko & Kolja Stahl & Nimrod Talmon - 757-781 Multi-objective performance improvements of general finite single-server queueing networks
by F. R. B. Cruz & A. R. Duarte & G. L. Souza - 783-815 A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic
by Alberto Santini & Stefan Ropke & Lars Magnus Hvattum
August 2018, Volume 24, Issue 4
- 581-616 Evaluating selection methods on hyper-heuristic multi-objective particle swarm optimization
by Olacir R. Castro & Gian Mauricio Fritsche & Aurora Pozo - 617-644 All Colors Shortest Path problem on trees
by Mehmet Berkehan Akçay & Hüseyin Akcan & Cem Evrendilek - 645-665 A fix-and-optimize matheuristic for university timetabling
by Michael Lindahl & Matias Sørensen & Thomas R. Stidsen - 667-695 A study on exponential-size neighborhoods for the bin packing problem with conflicts
by Renatha Capua & Yuri Frota & Luiz Satoru Ochi & Thibaut Vidal
June 2018, Volume 24, Issue 3
- 239-242 Editorial for the special issue on metaheuristics for combinatorial optimization
by Bin Hu & Francisco Chicano - 243-264 PageRank centrality for performance prediction: the impact of the local optima network model
by Sebastian Herrmann & Gabriela Ochoa & Franz Rothlauf - 265-294 Mapping the global structure of TSP fitness landscapes
by Gabriela Ochoa & Nadarajen Veerapen - 295-320 A case study of algorithm selection for the traveling thief problem
by Markus Wagner & Marius Lindauer & Mustafa Mısır & Samadhi Nallaperuma & Frank Hutter - 321-343 Tackling the edge dynamic graph colouring problem with and without future adjacency information
by Bradley Hardy & Rhyd Lewis & Jonathan Thompson - 345-357 Simple but effective heuristics for the 2-constraint bin packing problem
by Roberto Aringhieri & Davide Duma & Andrea Grosso & Pierre Hosteins - 359-394 A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem
by Alejandro Arbelaez & Deepak Mehta & Barry O’Sullivan & Luis Quesada - 395-423 Dynamic reconfiguration in multigroup multicast routing under uncertainty
by Pavel Troubil & Hana Rudová & Petr Holub - 425-456 Evolutionary computation for automatic Web service composition: an indirect representation approach
by Alexandre Sawczuk Silva & Yi Mei & Hui Ma & Mengjie Zhang - 457-481 Finding short and implementation-friendly addition chains with evolutionary algorithms
by Stjepan Picek & Carlos A. Coello Coello & Domagoj Jakobovic & Nele Mentens - 483-513 Metaheuristic approaches to the placement of suicide bomber detectors
by Carlos Cotta & José E. Gallardo - 515-550 On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem
by Sandra Zajac - 551-579 A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
by Christian Blum & Maria J. Blesa
April 2018, Volume 24, Issue 2
- 111-133 A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems
by J. Molina & A. D. López-Sánchez & A. G. Hernández-Díaz & I. Martínez-Salazar - 135-172 Scaling-up many-objective combinatorial optimization with Cartesian products of scalarization functions
by Mădălina M. Drugan - 173-203 Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem
by Alexander Lawrinenko & Stefan Schwerdfeger & Rico Walter - 205-238 Pareto local search algorithms for the multi-objective beam angle optimisation problem
by Guillermo Cabrera-Guerrero & Andrew J. Mason & Andrea Raith & Matthias Ehrgott
February 2018, Volume 24, Issue 1
- 1-24 Variations on memetic algorithms for graph coloring problems
by Laurent Moalic & Alexandre Gondran - 25-47 Hybrid multi-objective Bayesian estimation of distribution algorithm: a comparative analysis for the multi-objective knapsack problem
by Marcella S. R. Martins & Myriam R. B. S. Delgado & Ricardo Lüders & Roberto Santana & Richard A. Gonçalves & Carolina P. Almeida - 49-81 Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing
by Alexander Biele & Lars Mönch