发布求助
文献互助 智能选刊 最新文献

Journal of Heuristics最新文献

筛选
英文 中文
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
{"title":"Algorithmic strategies for a fast exploration of the TSP $$4$$ -OPT neighborhood","authors":"Giuseppe Lancia, Marcello Dalpasso","doi":"10.1007/s10732-023-09523-w","DOIUrl":"https://doi.org/10.1007/s10732-023-09523-w","url":null,"abstract":"<p>We describe an effective algorithm for exploring the <span>(4)</span>-OPT neighborhood for the Traveling Salesman Problem. <span>(4)</span>-OPT moves change a tour into another by replacing four of its edges. The best move can be found by a <span>(Theta (n^4))</span> algorithm by complete enumeration, but a <span>(Theta (n^3))</span> dynamic programming algorithm exists in the literature. Furthermore a <span>(Theta (n^2))</span> algorithm also exists for a particular subset of symmetric <span>(4)</span>-OPT moves. In this work we describe a new procedure which behaves, on average, slightly worse than a quadratic algorithm over all moves (estimated at <span>(O(n^{2.5}))</span>) and like a quadratic algorithm on the symmetric moves. Computational results are reported which show the effectiveness of our strategy compared to other algorithms for finding the best <span>(4)</span>-OPT move, and discuss the strength of the <span>(4)</span>-OPT neighborhood compared to 2- and <span>(3)</span>-OPT.</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139029515","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 heuristic algorithm using tree decompositions for the maximum happy vertices problem 利用树分解的启发式算法求解最大快乐顶点问题
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2023-11-15 DOI: 10.1007/s10732-023-09522-x
Louis Carpentier, Jorik Jooken, Jan Goedgebeur
{"title":"A heuristic algorithm using tree decompositions for the maximum happy vertices problem","authors":"Louis Carpentier, Jorik Jooken, Jan Goedgebeur","doi":"10.1007/s10732-023-09522-x","DOIUrl":"https://doi.org/10.1007/s10732-023-09522-x","url":null,"abstract":"<p>We propose a new methodology to develop heuristic algorithms using tree decompositions. Traditionally, such algorithms construct an optimal solution of the given problem instance through a dynamic programming approach. We modify this procedure by introducing a parameter <i>W</i> that dictates the number of dynamic programming states to consider. We drop the exactness guarantee in favour of a shorter running time. However, if <i>W</i> is large enough such that all valid states are considered, our heuristic algorithm proves optimality of the constructed solution. In particular, we implement a heuristic algorithm for the Maximum Happy Vertices problem using this approach. Our algorithm more efficiently constructs optimal solutions compared to the exact algorithm for graphs of bounded treewidth. Furthermore, our algorithm constructs higher quality solutions than state-of-the-art heuristic algorithms Greedy-MHV and Growth-MHV for instances of which at least 40% of the vertices are initially coloured, at the cost of a larger running time.</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138527662","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
DSLS: a simple and efficient local search algorithm for the maximum bisection problem DSLS:一个简单有效的局部搜索算法的最大平分问题
4区 计算机科学
Journal of Heuristics Pub Date : 2023-11-13 DOI: 10.1007/s10732-023-09521-y
Xinliang Tian, Dantong Ouyang, Huisi Zhou, Rui Sun, Liming Zhang
{"title":"DSLS: a simple and efficient local search algorithm for the maximum bisection problem","authors":"Xinliang Tian, Dantong Ouyang, Huisi Zhou, Rui Sun, Liming Zhang","doi":"10.1007/s10732-023-09521-y","DOIUrl":"https://doi.org/10.1007/s10732-023-09521-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136282419","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 variable neighborhood search heuristic for the sustainable time-dependent truck-drone routing problem with rendezvous locations 一种混合变量邻域搜索启发式方法用于具有集合地点的可持续时变卡车-无人机路径问题
4区 计算机科学
Journal of Heuristics Pub Date : 2023-11-11 DOI: 10.1007/s10732-023-09520-z
Ebrahim Teimoury, Reza Rashid
{"title":"A hybrid variable neighborhood search heuristic for the sustainable time-dependent truck-drone routing problem with rendezvous locations","authors":"Ebrahim Teimoury, Reza Rashid","doi":"10.1007/s10732-023-09520-z","DOIUrl":"https://doi.org/10.1007/s10732-023-09520-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135041837","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
Effective adaptive large neighborhood search for a firefighters timetabling problem 消防员调度问题的有效自适应大邻域搜索
4区 计算机科学
Journal of Heuristics Pub Date : 2023-10-13 DOI: 10.1007/s10732-023-09519-6
Mohamed-Amine Ouberkouk, Jean-Paul Boufflet, Aziz Moukrim
{"title":"Effective adaptive large neighborhood search for a firefighters timetabling problem","authors":"Mohamed-Amine Ouberkouk, Jean-Paul Boufflet, Aziz Moukrim","doi":"10.1007/s10732-023-09519-6","DOIUrl":"https://doi.org/10.1007/s10732-023-09519-6","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135854749","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
Solving travelling thief problems using coordination based methods 利用基于协调的方法解决行窃问题
4区 计算机科学
Journal of Heuristics Pub Date : 2023-10-09 DOI: 10.1007/s10732-023-09518-7
Majid Namazi, M. A. Hakim Newton, Conrad Sanderson, Abdul Sattar
{"title":"Solving travelling thief problems using coordination based methods","authors":"Majid Namazi, M. A. Hakim Newton, Conrad Sanderson, Abdul Sattar","doi":"10.1007/s10732-023-09518-7","DOIUrl":"https://doi.org/10.1007/s10732-023-09518-7","url":null,"abstract":"A travelling thief problem (TTP) is a proxy to real-life problems such as postal collection. TTP comprises an entanglement of a travelling salesman problem (TSP) and a knapsack problem (KP) since items of KP are scattered over cities of TSP, and a thief has to visit cities to collect items. In TTP, city selection and item selection decisions need close coordination since the thief's travelling speed depends on the knapsack's weight and the order of visiting cities affects the order of item collection. Existing TTP solvers deal with city selection and item selection separately, keeping decisions for one type unchanged while dealing with the other type. This separation essentially means very poor coordination between two types of decision. In this paper, we first show that a simple local search based coordination approach does not work in TTP. Then, to address the aforementioned problems, we propose a human designed coordination heuristic that makes changes to collection plans during exploration of cyclic tours. We further propose another human designed coordination heuristic that explicitly exploits the cyclic tours in item selections during collection plan exploration. Lastly, we propose a machine learning based coordination heuristic that captures characteristics of the two human designed coordination heuristics. Our proposed coordination based approaches help our TTP solver significantly outperform existing state-of-the-art TTP solvers on a set of benchmark problems. Our solver is named Cooperation Coordination (CoCo) and its source code is available from https://github.com/majid75/CoCo","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135094808","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
On robust vs fast solving of qualitative constraints 关于定性约束的鲁棒与快速求解
4区 计算机科学
Journal of Heuristics Pub Date : 2023-09-23 DOI: 10.1007/s10732-023-09517-8
Jan Wehner, Michael Sioutis, Diedrich Wolter
{"title":"On robust vs fast solving of qualitative constraints","authors":"Jan Wehner, Michael Sioutis, Diedrich Wolter","doi":"10.1007/s10732-023-09517-8","DOIUrl":"https://doi.org/10.1007/s10732-023-09517-8","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135967313","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}
引用次数: 2
A matheuristic approach for the family traveling salesman problem 家庭旅行商问题的数学方法
4区 计算机科学
Journal of Heuristics Pub Date : 2023-09-22 DOI: 10.1007/s10732-023-09516-9
Abtin Nourmohammadzadeh, Malek Sarhani, Stefan Voß
{"title":"A matheuristic approach for the family traveling salesman problem","authors":"Abtin Nourmohammadzadeh, Malek Sarhani, Stefan Voß","doi":"10.1007/s10732-023-09516-9","DOIUrl":"https://doi.org/10.1007/s10732-023-09516-9","url":null,"abstract":"Abstract In the family traveling salesman problem (FTSP), there is a set of cities which are divided into a number of clusters called families. The salesman has to find a shortest possible tour visiting a specific number of cities from each of the families without any restriction of visiting one family before starting the visit of another one. In this work, the general concept of the Partial OPtimization Metaheuristic Under Special Intensification Conditions is linked with the exact optimization by a classical solver using a mathematical programming formulation for the FTSP to develop a matheuristic. Moreover, a genetic and a simulated annealing algorithm are used as metaheuristics embedded in the approach. The method is examined on a set of benchmark instances and its performance is favorably compared with a state-of-the-art approach from literature. Moreover, a careful analysis of the specific components of the approach is undertaken to provide insights into the impact of their interplay.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136061003","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
An integrated learning and progressive hedging matheuristic for stochastic network design problem 随机网络设计问题的综合学习与递进对冲数学
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2023-08-09 DOI: 10.1007/s10732-023-09515-w
Fatemeh Sarayloo, T. Crainic, W. Rei
{"title":"An integrated learning and progressive hedging matheuristic for stochastic network design problem","authors":"Fatemeh Sarayloo, T. Crainic, W. Rei","doi":"10.1007/s10732-023-09515-w","DOIUrl":"https://doi.org/10.1007/s10732-023-09515-w","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2023-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42926158","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
An efficient scenario penalization matheuristic for a stochastic scheduling problem 随机调度问题的一种有效的情景惩罚数学方法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2023-05-29 DOI: 10.1007/s10732-023-09513-y
Michel Vasquez, Mirsad Buljubasic, S. Hanafi
{"title":"An efficient scenario penalization matheuristic for a stochastic scheduling problem","authors":"Michel Vasquez, Mirsad Buljubasic, S. Hanafi","doi":"10.1007/s10732-023-09513-y","DOIUrl":"https://doi.org/10.1007/s10732-023-09513-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2023-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43968175","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信