Journal of Heuristics最新文献

Genetic programming hyper-heuristic for evolving a maintenance policy for wind farms 遗传编程超启发式进化风电场维护政策

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2024-08-29 DOI: 10.1007/s10732-024-09533-2

Yikai Ma, Wenjuan Zhang, Juergen Branke

引用次数: 0

An integrated ILS-VND strategy for solving the knapsack problem with forfeits 解决有弃权的 "knapsack "问题的综合 ILS-VND 策略

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2024-08-06 DOI: 10.1007/s10732-024-09532-3

Matheus M. Vieira, Bruno Nogueira, Rian G. S. Pinheiro

引用次数: 0

On the emerging potential of quantum annealing hardware for combinatorial optimization 量子退火硬件在组合优化方面的新兴潜力

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2024-08-02 DOI: 10.1007/s10732-024-09530-5

Byron Tasseff, Tameem Albash, Zachary Morrell, Marc Vuffray, Andrey Y. Lokhov, Sidhant Misra, Carleton Coffrin

{"title":"On the emerging potential of quantum annealing hardware for combinatorial optimization","authors":"Byron Tasseff, Tameem Albash, Zachary Morrell, Marc Vuffray, Andrey Y. Lokhov, Sidhant Misra, Carleton Coffrin","doi":"10.1007/s10732-024-09530-5","DOIUrl":"https://doi.org/10.1007/s10732-024-09530-5","url":null,"abstract":"Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not provide an irrefutable performance gain over state-of-the-art optimization methods. However, as this hardware continues to evolve, each new iteration brings improved performance and warrants further benchmarking. To that end, this work conducts an optimization performance assessment of D-Wave Systems’ Advantage Performance Update computer, which can natively solve sparse unconstrained quadratic optimization problems with over 5,000 binary decision variables and 40,000 quadratic terms. We demonstrate that classes of contrived problems exist where this quantum annealer can provide run time benefits over a collection of established classical solution methods that represent the current state-of-the-art for benchmarking quantum annealing hardware. Although this work does not present strong evidence of an irrefutable performance benefit for this emerging optimization technology, it does exhibit encouraging progress, signaling the potential impacts on practical optimization tasks in the future.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"9 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141885709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles 异构车辆灾后连接问题的 MILP 模型和启发式算法

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2024-07-18 DOI: 10.1007/s10732-024-09531-4

İlknur Tükenmez, Tugba Saraç, Onur Kaya

{"title":"A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles","authors":"İlknur Tükenmez, Tugba Saraç, Onur Kaya","doi":"10.1007/s10732-024-09531-4","DOIUrl":"https://doi.org/10.1007/s10732-024-09531-4","url":null,"abstract":"Throughout the response phase of the disaster, the speedy restoration of transportation by reconnecting the nodes where the connection is broken is absolutely critical for evacuating civilians, providing clear access to hospitals, and distributing aid. Following a disaster, some roads in a disaster area might be closed to transportation. In reality, some roads can be blocked due to debris, and some of roads can be blocked by collapsing. In this model, different types of road unblocking methods are included, and each road can only be opened to access by a vehicle suitable for that method. So, different types of vehicles may be needed to repair the roads depending on the type of damage. In addition, fast-built bridges built both on land and over water are also used if necessary following a disaster. In problems of this nature, it is essential to restore the roads to enable the complete connectivity of the network such that all nodes can be reached by one another. In addition, it is also critical for the speedy reach of critical nodes, such as hospitals, and emergency disaster centers. This study aims to reduce the maximum time for connection and minimize the total time in which to reach critical nodes. For this purpose, we developed a bi-objective mathematical model that considers the multiple vehicle types that can repair different types of damages. Since the problem is NP-hard, two heuristic methods were developed, and the numerical results were presented. It has been observed that the local search algorithm gives better results than the hybrid algorithm. Additionally, different scenario data was produced. Numbers of unconnected components from 3 to 10 are solved with heuristic algorithms for test data containing 80 and 250 nodes, and real-life data containing 223 nodes and 391 edges are solved with heuristic algorithms for the number of unconnected components 6, 9, 12, and 15.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"30 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141742750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs 利用邻接图的循环包装分配不平衡基因组中的同源基因

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2024-05-31 DOI: 10.1007/s10732-024-09528-z

Gabriel Siqueira, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Zanoni Dias

{"title":"Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs","authors":"Gabriel Siqueira, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Zanoni Dias","doi":"10.1007/s10732-024-09528-z","DOIUrl":"https://doi.org/10.1007/s10732-024-09528-z","url":null,"abstract":"The adjacency graph is a structure used to model genomes in several rearrangement distance problems. In particular, most studies use properties of a maximum cycle packing of this graph to develop bounds and algorithms for rearrangement distance problems, such as the reversal distance, the reversal and transposition distance, and the double cut and join distance. When each genome has no repeated genes, there exists only one cycle packing for the graph. However, when each genome may have repeated genes, the problem of finding a maximum cycle packing for the adjacency graph (adjacency graph packing) is NP-hard. In this work, we develop a randomized greedy heuristic and a genetic algorithm heuristic for the adjacency graph packing problem for genomes with repeated genes and unequal gene content. We also propose new algorithms with simple implementation and good practical performance for reversal distance and reversal and transposition distance in genomes without repeated genes, which we combine with the heuristics to find solutions for the problems with repeated genes. We present experimental results and compare the application of these heuristics with the application of the MSOAR framework in rearrangement distance problems. Lastly, we apply our genetic algorithm heuristic to real genomic data to validate its practical use.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"229 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141194602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mathematical models and solving methods for diversity and equity optimization 多样性和公平性优化的数学模型和求解方法

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2024-05-30 DOI: 10.1007/s10732-024-09529-y

Rafael Martí, Francisco Parreño, Jorge Mortes

{"title":"Mathematical models and solving methods for diversity and equity optimization","authors":"Rafael Martí, Francisco Parreño, Jorge Mortes","doi":"10.1007/s10732-024-09529-y","DOIUrl":"https://doi.org/10.1007/s10732-024-09529-y","url":null,"abstract":"Discrete diversity optimization basically consists of selecting a subset of elements of a given set in such a way that the sum of their pairwise distances is maximized. Equity, on the other hand, refers to minimizing the difference between the maximum and the minimum distances in the subset of selected elements to balance their diversity. Both problems have been studied in the combinatorial optimization literature, but recently major drawbacks in their classic mathematical formulations have been identified. We propose new mathematical models to overcome these limitations, including multi-objective optimization, and heuristics to solve large-size instances of them. Specifically, we propose a matheuristic based on the CMSA framework for diversity and a GRASP heuristic for equity. Our extensive experimentation compares the original models with the new proposals by analyzing the solutions of our heuristics and those of the previous approaches, both from a single objective and a bi-objective paradigm. We also evaluate their quality with respect to the optimal solutions obtained with CPLEX, size permitting. Statistical analysis allows us to draw significant conclusions.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"293 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141194632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Metaheuristics and machine learning: an approach with reinforcement learning assisting neural architecture search 元合方法与机器学习：强化学习辅助神经结构搜索的方法

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2024-04-16 DOI: 10.1007/s10732-024-09526-1

Sandra Mara Scós Venske, Carolina Paula de Almeida , Myriam Regattieri Delgado

{"title":"Metaheuristics and machine learning: an approach with reinforcement learning assisting neural architecture search","authors":"Sandra Mara Scós Venske, Carolina Paula de Almeida , Myriam Regattieri Delgado","doi":"10.1007/s10732-024-09526-1","DOIUrl":"https://doi.org/10.1007/s10732-024-09526-1","url":null,"abstract":"Methaheuristics (MHs) are techniques widely used for solving complex optimization problems. In recent years, the interest in combining MH and machine learning (ML) has grown. This integration can occur mainly in two ways: ML-in-MH and MH-in-ML. In the present work, we combine the techniques in both ways—ML-in-MH-in-ML, providing an approach in which ML is considered to improve the performance of an evolutionary algorithm (EA), whose solutions encode parameters of an ML model—artificial neural network (ANN). Our approach called TS(_{in})EA(_{in})ANN employs a reinforcement learning neighborhood (RLN) mutation based on Thompson sampling (TS). TS is a parameterless reinforcement learning method, used here to boost the EA performance. In the experiments, every candidate ANN solves a regression problem known as protein structure prediction deviation. We consider two protein datasets, one with 16,382 and the other with 45,730 samples. The results show that TS(_{in})EA(_{in})ANN performs significantly better than a canonical genetic algorithm (GA(_{in})ANN) and the evolutionary algorithm without reinforcement learning (EA(_{in})ANN). Analyses of the parameter’s frequency are also performed comparing the approaches. Finally, comparisons with the literature show that except for one particular case in the largest dataset, TS(_{in})EA(_{in})ANN outperforms other approaches considered the state of the art for the addressed datasets.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"25 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140594981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Interpretability of rectangle packing solutions with Monte Carlo tree search 用蒙特卡洛树搜索矩形包装解决方案的可解释性

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2024-03-18 DOI: 10.1007/s10732-024-09525-2

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

{"title":"Interpretability of rectangle packing solutions with Monte Carlo tree search","authors":"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","doi":"10.1007/s10732-024-09525-2","DOIUrl":"https://doi.org/10.1007/s10732-024-09525-2","url":null,"abstract":"Packing problems have been studied for a long time and have great applications in real-world scenarios. In recent times, with problems in the industrial world increasing in size, exact algorithms are often not a viable option and faster approaches are needed. We study Monte Carlo tree search, a random sampling algorithm that has gained great importance in literature in the last few years. We propose three approaches based on MCTS and its integration with metaheuristic algorithms or deep learning models to obtain approximated solutions to packing problems that are also interpretable by means of MCTS exploration and from which knowledge can be extracted. We focus on two-dimensional rectangle packing problems in our experimentation and use several well known benchmarks from literature to compare our solutions with existing approaches and offer a view on the potential uses for knowledge extraction from our method. We manage to match the quality of state-of-the-art methods, with improvements in time with respect to some of them and greater interpretability.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"21 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140149864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems 大规模单源容纳式设施选址问题的混合迭代局部搜索数学启发式

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2023-12-26 DOI: 10.1007/s10732-023-09524-9

Guilherme Barbosa de Almeida, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza

{"title":"A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems","authors":"Guilherme Barbosa de Almeida, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza","doi":"10.1007/s10732-023-09524-9","DOIUrl":"https://doi.org/10.1007/s10732-023-09524-9","url":null,"abstract":"The Single Source Capacitated Facility Location Problem (SSCFLP) consists of determining locations for facilities to meet customer demands so that each customer must be served by a single facility. This paper proposes a matheuristic algorithm for solving large-scale SSCFLP instances that combines neighborhood-based heuristic procedures with the solution of two binary linear programming sub-problems through a general-purpose solver. The proposed algorithm starts from the optimal solution of the linear relaxation of the SSCFLP to reduce its size and identify promising potential locations for opening facilities. Computational experiments were performed on two benchmark sets of large instances. For one of them, the developed algorithm obtained optimal solutions for all instances. For the other set, it provided average relative deviations slightly lower than those of three relevant algorithms from the literature. These results allow us to conclude that the proposed algorithm generates good-quality solutions and is competitive in solving large-scale SSCFLP instances.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"44 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139055871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Algorithmic strategies for a fast exploration of the TSP $$4$$ -OPT neighborhood 快速探索 TSP $$4$$ -OPT 邻域的算法策略

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2023-12-21 DOI: 10.1007/s10732-023-09523-w

Giuseppe Lancia, Marcello Dalpasso

引用次数: 0