-
Interpretability of rectangle packing solutions with Monte Carlo tree search J. Heuristics (IF 2.7) Pub Date : 2024-03-18 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
-
A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems J. Heuristics (IF 2.7) Pub Date : 2023-12-26 Guilherme Barbosa de Almeida, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza
-
Algorithmic strategies for a fast exploration of the TSP $$4$$ -OPT neighborhood J. Heuristics (IF 2.7) Pub Date : 2023-12-21 Giuseppe Lancia, Marcello Dalpasso
-
A heuristic algorithm using tree decompositions for the maximum happy vertices problem J. Heuristics (IF 2.7) Pub Date : 2023-11-15 Louis Carpentier, Jorik Jooken, Jan Goedgebeur
-
DSLS: a simple and efficient local search algorithm for the maximum bisection problem J. Heuristics (IF 2.7) Pub Date : 2023-11-13 Xinliang Tian, Dantong Ouyang, Huisi Zhou, Rui Sun, Liming Zhang
-
A hybrid variable neighborhood search heuristic for the sustainable time-dependent truck-drone routing problem with rendezvous locations J. Heuristics (IF 2.7) Pub Date : 2023-11-11 Ebrahim Teimoury, Reza Rashid
-
Effective adaptive large neighborhood search for a firefighters timetabling problem J. Heuristics (IF 2.7) Pub Date : 2023-10-13 Mohamed-Amine Ouberkouk, Jean-Paul Boufflet, Aziz Moukrim
-
Solving travelling thief problems using coordination based methods J. Heuristics (IF 2.7) Pub Date : 2023-10-09 Majid Namazi, M. A. Hakim Newton, Conrad Sanderson, Abdul Sattar
-
On robust vs fast solving of qualitative constraints J. Heuristics (IF 2.7) Pub Date : 2023-09-23 Jan Wehner, Michael Sioutis, Diedrich Wolter
-
A matheuristic approach for the family traveling salesman problem J. Heuristics (IF 2.7) Pub Date : 2023-09-22 Abtin Nourmohammadzadeh, Malek Sarhani, Stefan Voß
-
An integrated learning and progressive hedging matheuristic for stochastic network design problem J. Heuristics (IF 2.7) Pub Date : 2023-08-09 Fatemeh Sarayloo, Teodor Gabriel Crainic, Walter Rei
-
An efficient scenario penalization matheuristic for a stochastic scheduling problem J. Heuristics (IF 2.7) Pub Date : 2023-05-29 Michel Vasquez, Mirsad Buljubasic, Saïd Hanafi
We propose a new scenario penalization matheuristic for a stochastic scheduling problem based on both mathematical programming models and local search methods. The application considered is an NP-hard problem expressed as a risk minimization model involving quantiles related to value at risk which is formulated as a non-linear binary optimization problem with linear constraints. The proposed matheuritic
-
The ALNS metaheuristic for the transmission maintenance scheduling J. Heuristics (IF 2.7) Pub Date : 2023-05-27 David Woller, Jakub Rada, Miroslav Kulich
-
A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window J. Heuristics (IF 2.7) Pub Date : 2023-05-08 Fagui Liu, Lvshengbiao Wang, Mengke Gui, Yang Zhang, Yulin Lan, Chengqi Lai, Boyuan Zhu
-
Learning fine-grained search space pruning and heuristics for combinatorial optimization J. Heuristics (IF 2.7) Pub Date : 2023-05-08 Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani
-
A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors J. Heuristics (IF 2.7) Pub Date : 2023-04-26 Fatma-Zohra Baatout, Mhand Hifi
-
Minimizing total completion time in large-sized pharmaceutical quality control scheduling J. Heuristics (IF 2.7) Pub Date : 2023-02-14 Miguel S. E. Martins, Joaquim L. Viegas, Tiago Coito, Bernardo Firme, Andrea Costigliola, João Figueiredo, Susana M. Vieira, João M. C. Sousa
-
Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system J. Heuristics (IF 2.7) Pub Date : 2023-02-03 Bijun Wang, Zheyong Bian, Mo Mansouri
-
Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches J. Heuristics (IF 2.7) Pub Date : 2023-01-09 Mohamad Alissa, Kevin Sim, Emma Hart
-
Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem J. Heuristics (IF 2.7) Pub Date : 2023-01-10 Hanyu Gu, Hue Chi Lam, Thi Thanh Thu Pham, Yakov Zinder
-
A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports J. Heuristics (IF 2.7) Pub Date : 2022-12-15 João Luiz Marques de Andrade, Gustavo Campos Menezes
-
Combining hybrid genetic search with ruin-and-recreate for solving the capacitated vehicle routing problem J. Heuristics (IF 2.7) Pub Date : 2022-10-15 Martin Simensen, Geir Hasle, Magnus Stålhane
-
Modeling and evolutionary algorithm for solving a multi-depot mixed vehicle routing problem with uncertain travel times J. Heuristics (IF 2.7) Pub Date : 2022-10-05 Liang Sun
-
Breakout local search for the cyclic cutwidth minimization problem J. Heuristics (IF 2.7) Pub Date : 2022-08-31 Mu He, Qinghua Wu, Yongliang Lu
-
Incomplete MaxSAT approaches for combinatorial testing J. Heuristics (IF 2.7) Pub Date : 2022-08-17 Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
-
Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds J. Heuristics (IF 2.7) Pub Date : 2022-08-01 Leandro R. Costa, Daniel Aloise, Luca G. Gianoli, Andrea Lodi
-
A systematic approach to parameter optimization and its application to flight schedule simulation software J. Heuristics (IF 2.7) Pub Date : 2022-07-05 Alexander E. I. Brownlee, Michael G. Epitropakis, Jeroen Mulder, Marc Paelinck, Edmund K. Burke
-
Fixed set search applied to the multi-objective minimum weighted vertex cover problem J. Heuristics (IF 2.7) Pub Date : 2022-05-12 Raka Jovanovic, Antonio P. Sanfilippo, Stefan Voß
-
Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems J. Heuristics (IF 2.7) Pub Date : 2022-04-27 Ricardo N. Liang, Eduardo A. J. Anacleto, Cláudio N. Meneses
-
A memetic algorithm for the inventory routing problem J. Heuristics (IF 2.7) Pub Date : 2022-04-22 Mohamed Salim Amri Sakhri, Mounira Tlili, Ouajdi Korbaa
-
Weighted iterated local branching for mathematical programming problems with binary variables J. Heuristics (IF 2.7) Pub Date : 2022-04-16 Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo
-
A heuristic search based on diversity for solving combinatorial problems J. Heuristics (IF 2.7) Pub Date : 2022-04-04 Francisco Casas, Claudio E. Torres, Ignacio Araya
-
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks J. Heuristics (IF 2.7) Pub Date : 2022-03-23 R. Lewis, P. Corcoran
This paper proposes two heuristic algorithms for finding fixed-length circuits and cycles in undirected edge-weighted graphs. It focusses particularly on a largely unresearched practical application where we are seeking attractive round trips for pedestrians and joggers in urban street networks. Our first method is based on identifying suitable pairs of paths that are combined to form a solution; our
-
Special issue on “The Eighth International Symposium on Information and Communication Technology—SoICT 2017” J. Heuristics (IF 2.7) Pub Date : 2022-03-04 Ichiro Ide,Huynh Thi Thanh Binh
-
Ride matching and vehicle routing for on-demand mobility services J. Heuristics (IF 2.7) Pub Date : 2022-02-19 Sepide Lotfi, Khaled Abdelghany
On-Demand Mobility Services (ODMS) have gained considerable popularity over the past few years. Travelers use mobile phone applications to easily request a ride, update trip itinerary and pay the ride fare. This paper describes a novel methodology for integrated ride matching and vehicle routing for ODMS with ridesharing and transfer options. The methodology adopts a hybrid heuristic approach, which
-
A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem J. Heuristics (IF 2.7) Pub Date : 2022-02-14 Alejandra Casado, Sergio Pérez-Peló, Jesús Sánchez-Oro, Abraham Duarte
The selection of individuals with similar characteristics from a given population have always been a matter of interest in several scientific areas: data privacy, genetics, art, among others. This work is focused on the maximum intersection of k-subsets problem (kMIS). This problem tries to find a subset of k individuals with the maximum number of features in common from a given population and a set
-
Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs J. Heuristics (IF 2.7) Pub Date : 2022-01-27 Sandra Ulrich Ngueveu, Christian Artigues, Nabil Absi, Safia Kedad-Sidhoum
This paper considers the problem of scheduling a set of time- and energy-constrained preemptive tasks on a discrete time horizon. At each time period, the total energy required by the tasks that are in process can be provided by two energy sources: a reversible one and a non-reversible one. The non-reversible energy source can provide an unlimited amount of energy for a given period but at the expense
-
A new heuristic for finding verifiable k-vertex-critical subgraphs J. Heuristics (IF 2.7) Pub Date : 2022-01-24 Alex Gliesch, Marcus Ritt
Given graph G, a k-vertex-critical subgraph (k-VCS) \(H \subseteq G\) is a subgraph with chromatic number \(\chi (H)=k\), for which no vertex can be removed without decreasing its chromatic number. The main motivation for finding a k-VCS is to prove k is a lower bound on \(\chi (G)\). A graph may have several k-VCSs, and the k-Vertex-Critical Subgraph Problem asks for one with the least possible vertices
-
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 J. Heuristics (IF 2.7) Pub Date : 2022-01-10 De Genaro Chiroli, Daiane Maria, Mayerle, Sérgio Fernando, de Figueiredo, João Neiva
This paper addresses the vehicle routing and driver scheduling problem of finding a low cost route and stoppage schedule for long-haul point-to-point full-load trips with intermediate stops due to refueling needs and driver hours-of-service regulatory restrictions. This is an important problem for long-haul truck drivers because in practice regulatory driving limits often do not coincide with availability
-
Intersections management for autonomous vehicles: a heuristic approach J. Heuristics (IF 2.7) Pub Date : 2022-01-09 Silva, Victor, Siebra, Clauirton, Subramanian, Anand
Roads intersections are one of the main causes of traffic jams since vehicles need to stop and wait for their time to go. Scenarios that only consider autonomous vehicles can minimize this problem using intelligent systems that manage the time when each vehicle will pass across the intersection. This paper proposes a mathematical model and a heuristic that optimize this management. The efficiency of
-
Constraint-guided evolutionary algorithm for solving the winner determination problem J. Heuristics (IF 2.7) Pub Date : 2021-09-23 Kazama, Fernanda Nakano, Araujo, Aluizio Fausto Ribeiro, de Barros Correia, Paulo, Guerrero-Peña, Elaine
Combinatorial Auctions (CAs) allow the participants to bid on a bundle of items and can result in more cost-effective deals than traditional auctions if the goods are complementary. However, solving the Winner Determination Problem (WDP) in CAs is an NP-hard problem. Since Evolutionary Algorithms (EAs) can find good solutions in polynomial time within a huge search space, the use of EAs has become
-
Randomized rounding algorithms for large scale unsplittable flow problems J. Heuristics (IF 2.7) Pub Date : 2021-09-09 Lamothe, François, Rachelson, Emmanuel, Haït, Alain, Baudoin, Cedric, Dupé, Jean-Baptiste
Unsplittable flow problems cover a wide range of telecommunication and transportation problems and their efficient resolution is key to a number of applications. In this work, we study algorithms that can scale up to large graphs and important numbers of commodities. We present and analyze in detail a heuristic based on the linear relaxation of the problem and randomized rounding. We provide empirical
-
A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application J. Heuristics (IF 2.7) Pub Date : 2021-08-11 Kaji, Taichi
Metaheuristics are a class of approximate methods, which are designed to attack hard combinatorial optimization problems. In metaheuristics, a neighborhood is defined by the specified move operation for a solution. The neighborhood plays an essential role in the performance of its algorithms. It is important to capture the statistical properties of neighborhoods. In this paper, we present a theoretical
-
Multi-level evolution strategies for high-resolution black-box control J. Heuristics (IF 2.7) Pub Date : 2021-08-02 Shir, Ofer M., Xing, Xi., Rabitz, Herschel.
This paper introduces a multi-level (m-lev) mechanism into Evolution Strategies (ESs) in order to address a class of global optimization problems that could benefit from fine discretization of their decision variables. Such problems arise in engineering and scientific applications, which possess a multi-resolution control nature, and thus may be formulated either by means of low-resolution variants
-
A two-phase approach for integrating preventive maintenance with production and delivery in an unreliable coal mine J. Heuristics (IF 2.7) Pub Date : 2021-07-28 Jiu, Song
We consider a coal mine that extracts raw coal by a set of coal mining equipment (CME), separates out multiple products by a set of coal washing equipment, and delivers the products through a fleet of trains over a multi-period horizon. The equipment requires a daily preventive maintenance (PM) and each CME is subject to random failures and repairs. We study a joint PM, production, and delivery problem
-
Conflict history based heuristic for constraint satisfaction problem solving J. Heuristics (IF 2.7) Pub Date : 2021-06-30 Djamal Habet, Cyril Terrioux
The variable ordering heuristic is an important module in algorithms dedicated to solve Constraint Satisfaction Problems (CSP), while it impacts the efficiency of exploring the search space and the size of the search tree. It also exploits, often implicitly, the structure of the instances. In this paper, we propose Conflict-History Search (CHS), a dynamic and adaptive variable ordering heuristic for
-
Delayed improvement local search J. Heuristics (IF 2.7) Pub Date : 2021-06-29 Heber F. Amaral, Sebastián Urrutia, Lars M. Hvattum
Local search is a fundamental tool in the development of heuristic algorithms. A neighborhood operator takes a current solution and returns a set of similar solutions, denoted as neighbors. In best improvement local search, the best of the neighboring solutions replaces the current solution in each iteration. On the other hand, in first improvement local search, the neighborhood is only explored until
-
An adaptive large neighbourhood search algorithm for diameter bounded network design problems J. Heuristics (IF 2.7) Pub Date : 2021-06-23 Michele Garraffa, Deepak Mehta, Barry O’Sullivan, Cemalettin Ozturk, Luis Quesada
This paper focuses on designing a diameter - constrained network where the maximum distance between any pair of nodes is bounded. The objective considered is to minimise a weighted sum of the total length of the links followed by the total length of the paths between the pairs of nodes. First, the problem is formulated in terms of Mixed Integer Linear Programming and Constraint Programming to provide
-
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem J. Heuristics (IF 2.7) Pub Date : 2021-06-07 Venkatesh Pandiri, Alok Singh
This paper addresses a variant of the many-to-many hub location-routing problem. Given an undirected edge-weighted complete graph \(G = (V, E)\), this problem consists in finding a subset of V designated as hub nodes, partitioning all the nodes of V into cycles such that each cycle has exactly one hub node, and determining a Hamiltonian cycle on the subgraph induced by hub nodes. The objective is to
-
Dynamic pricing with demand disaggregation for hotel revenue management J. Heuristics (IF 2.7) Pub Date : 2021-06-07 Andrei M. Bandalouski, Natalja G. Egorova, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim
In this paper we present a novel approach to the dynamic pricing problem for hotel businesses. It includes disaggregation of the demand into several categories, forecasting, elastic demand simulation, and a mathematical programming model with concave quadratic objective function and linear constraints for dynamic price optimization. The approach is computationally efficient and easy to implement. In
-
Bi-criteria multiple knapsack problem with grouped items J. Heuristics (IF 2.7) Pub Date : 2021-06-02 Francisco Castillo-Zunino, Pinar Keskinocak
The multiple knapsack problem with grouped items aims to maximize rewards by assigning groups of items among multiple knapsacks, without exceeding knapsack capacities. Either all items in a group are assigned or none at all. We study the bi-criteria variation of the problem, where capacities can be exceeded and the second objective is to minimize the maximum exceeded knapsack capacity. We propose approximation
-
Heuristic-based allocation of supply constrained blood platelets in emerging economies J. Heuristics (IF 2.7) Pub Date : 2021-04-28 Fredrik Ødegaard, Sudipendra Nath Roy
Platelets are valuable, but highly perishable, blood components used in the treatment of, among others, viral dengue fever, blood-related illness, and post-chemotherapy following cancer. Given the short shelf-life of 3–5 days and a highly volatile supply and demand pattern, platelet inventory allocation is a challenging task. This is especially prevalent in emerging economies where demand variability
-
A balance-first sequence-last algorithm to design RMS: a matheuristic with performance guaranty to balance reconfigurable manufacturing systems J. Heuristics (IF 2.7) Pub Date : 2021-03-29 Youssef Lahrichi, Laurent Deroussi, Nathalie Grangeon, Sylvie Norre
The Reconfigurable Transfer Line Balancing Problem (RTLB) is considered in this paper. This problem is quite recent and motivated by the growing need of reconfigurability in the new industry 4.0 context. The problem consists into allocating a set of operations necessary to machine a single part to different workstations placed into a serial line. Each workstation can contain multiple machines operating
-
Special issue on matheuristics J. Heuristics (IF 2.7) Pub Date : 2021-03-11 Yannick Kergosien,Jorge E. Mendoza,Vincent T’kindt
-
Qfold: a new modeling paradigm for the RNA folding problem J. Heuristics (IF 2.7) Pub Date : 2021-03-06 Mark W. Lewis, Amit Verma, Todd T. Eckdahl
Ribonucleic acid (RNA) molecules play informational, structural, and metabolic roles in all living cells. RNAs are chains of nucleotides containing bases {A, C, G, U} that interact via base pairings to determine higher order structure and functionality. The RNA folding problem is to predict one or more secondary RNA structures from a given primary sequence of bases. From a mathematical modeling perspective
-
A matheuristic for the stochastic facility location problem J. Heuristics (IF 2.7) Pub Date : 2021-02-26 Renata Turkeš, Kenneth Sörensen, Daniel Palhazi Cuervo
In this paper, we describe a matheuristic to solve the stochastic facility location problem which determines the location and size of storage facilities, the quantities of various types of supplies stored in each facility, and the assignment of demand locations to the open facilities, which minimize unmet demand and response time in lexicographic order. We assume uncertainties about demands, inventory
-
Enhancing large neighbourhood search heuristics for Benders’ decomposition J. Heuristics (IF 2.7) Pub Date : 2021-02-23 Stephen J. Maher
A general enhancement of the Benders’ decomposition (BD) algorithm can be achieved through the improved use of large neighbourhood search heuristics within mixed-integer programming solvers. While mixed-integer programming solvers are endowed with an array of large neighbourhood search heuristics, few, if any, have been designed for BD. Further, typically the use of large neighbourhood search heuristics
-
Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics J. Heuristics (IF 2.7) Pub Date : 2021-02-19 Mohamed Abouhawwash, Kalyanmoy Deb
In a preference-based multi-objective optimization task, the goal is to find a subset of the Pareto-optimal set close to a supplied set of aspiration points. The reference point based non-dominated sorting genetic algorithm (R-NSGA-II) was proposed for such problem-solving tasks. R-NSGA-II aims to finding Pareto-optimal points close, in the sense of Euclidean distance in the objective space, to the
-
Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape J. Heuristics (IF 2.7) Pub Date : 2021-02-06 Marcella S. R. Martins, Mohamed El Yafrani, Myriam Delgado, Ricardo Lüders, Roberto Santana, Hugo V. Siqueira, Huseyin G. Akcay, Belaïd Ahiod
This work investigates different Bayesian network structure learning techniques by thoroughly studying several variants of Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm (HMOBEDA), applied to the MNK Landscape combinatorial problem. In the experiments, we evaluate the performance considering three different aspects: optimization abilities, robustness and learning efficiency. Results
-
Augmented intuition: a bridge between theory and practice J. Heuristics (IF 2.7) Pub Date : 2021-01-31 Pablo Moscato, Luke Mathieson, Mohammad Nazmul Haque
Motivated by the celebrated paper of Hooker (J Heuristics 1(1): 33–42, 1995) published in the first issue of this journal, and by the relative lack of progress of both approximation algorithms and fixed-parameter algorithms for the classical decision and optimization problems related to covering edges by vertices, we aimed at developing an approach centered in augmenting our intuition about what is