基于分治的启发式算法在若干整数优化问题中的应用与评价

Q3 Decision Sciences

Yugoslav Journal of Operations Research Pub Date : 2021-11-09 DOI:10.2298/yjor2111015030m

Fernando A. Morales

{"title":"基于分治的启发式算法在若干整数优化问题中的应用与评价","authors":"Fernando A. Morales","doi":"10.2298/yjor2111015030m","DOIUrl":null,"url":null,"abstract":"In this paper three heuristic algorithms using the Divide-and-Conquer\n paradigm are developed and assessed for three integer optimizations\n problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem\n (BPP) and Travelling Salesman Problem (TSP). For each case, the algorithm is\n introduced, together with the design of numerical experiments, in order to\n empirically establish its performance from both points of view: its\n computational time and its numerical accuracy.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"9 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application and assessment of divide-and-conquer-based heuristic algorithms for some integer optimization problems\",\"authors\":\"Fernando A. Morales\",\"doi\":\"10.2298/yjor2111015030m\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper three heuristic algorithms using the Divide-and-Conquer\\n paradigm are developed and assessed for three integer optimizations\\n problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem\\n (BPP) and Travelling Salesman Problem (TSP). For each case, the algorithm is\\n introduced, together with the design of numerical experiments, in order to\\n empirically establish its performance from both points of view: its\\n computational time and its numerical accuracy.\",\"PeriodicalId\":52438,\"journal\":{\"name\":\"Yugoslav Journal of Operations Research\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Yugoslav Journal of Operations Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2298/yjor2111015030m\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Yugoslav Journal of Operations Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2298/yjor2111015030m","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Decision Sciences","Score":null,"Total":0}

引用次数: 0

摘要

针对多维背包问题(d-KP)、箱包问题(BPP)和旅行商问题(TSP)这三个整数优化问题，提出了三种启发式算法，并对其进行了评估。针对每种情况，介绍了该算法，并设计了数值实验，以便从计算时间和数值精度两个方面经验地确定其性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Application and assessment of divide-and-conquer-based heuristic algorithms for some integer optimization problems

In this paper three heuristic algorithms using the Divide-and-Conquer paradigm are developed and assessed for three integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem (BPP) and Travelling Salesman Problem (TSP). For each case, the algorithm is introduced, together with the design of numerical experiments, in order to empirically establish its performance from both points of view: its computational time and its numerical accuracy.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Yugoslav Journal of Operations Research Decision Sciences-Management Science and Operations Research

CiteScore

2.50

自引率

0.00%

发文量

审稿时长

24 weeks