固定收费运输问题最优解的新算法

IF 0.9 4区计算机科学 Q4 COMPUTER SCIENCE, CYBERNETICS

Kybernetika Pub Date : 2023-03-10 DOI:10.14736/kyb-2023-1-0045

Nermin Kartlı, E. Bostanci, Mehmet Serdar Guzel

{"title":"固定收费运输问题最优解的新算法","authors":"Nermin Kartlı, E. Bostanci, Mehmet Serdar Guzel","doi":"10.14736/kyb-2023-1-0045","DOIUrl":null,"url":null,"abstract":"Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a ﬁxed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can ﬁnd the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this reason, new algorithms have been proposed in recent years to provide an approximate solution for the problem. The vast majority of these algorithms are meta-heuristic algorithms. In this study, we propose a new heuristic algorithm to ﬁnd an optimal solution for the 1-stage FCTP. We compare the results of our algorithm with the results of other existing algorithms.","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"19 5 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new algorithm for optimal solution of fixed charge transportation problem\",\"authors\":\"Nermin Kartlı, E. Bostanci, Mehmet Serdar Guzel\",\"doi\":\"10.14736/kyb-2023-1-0045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a ﬁxed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can ﬁnd the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this reason, new algorithms have been proposed in recent years to provide an approximate solution for the problem. The vast majority of these algorithms are meta-heuristic algorithms. In this study, we propose a new heuristic algorithm to ﬁnd an optimal solution for the 1-stage FCTP. We compare the results of our algorithm with the results of other existing algorithms.\",\"PeriodicalId\":49928,\"journal\":{\"name\":\"Kybernetika\",\"volume\":\"19 5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-03-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Kybernetika\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.14736/kyb-2023-1-0045\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kybernetika","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.14736/kyb-2023-1-0045","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}

引用次数: 0

摘要

固定收费运输问题是一个供应链问题。在这个问题中，除了每个运输产品的单位成本外，还需要一个固定成本。目的是以尽可能低的成本进行运输过程。与所有供应链问题一样，这个问题可能有一个、两个或三个阶段。即使是单阶段问题，也没有一种算法可以在多项式时间内找到问题的最优解。由于这个原因，近年来提出了新的算法来提供这个问题的近似解。这些算法中的绝大多数是元启发式算法。在本研究中，我们提出一种新的启发式算法来寻找一阶段FCTP的最优解。我们将算法的结果与其他现有算法的结果进行了比较。

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

查看原文本刊更多论文

A new algorithm for optimal solution of fixed charge transportation problem

Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a ﬁxed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can ﬁnd the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this reason, new algorithms have been proposed in recent years to provide an approximate solution for the problem. The vast majority of these algorithms are meta-heuristic algorithms. In this study, we propose a new heuristic algorithm to ﬁnd an optimal solution for the 1-stage FCTP. We compare the results of our algorithm with the results of other existing algorithms.

求助全文

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

来源期刊

Kybernetika 工程技术-计算机：控制论

CiteScore

1.30

自引率

20.00%

发文量

审稿时长

6 months

期刊介绍： Kybernetika is the bi-monthly international journal dedicated for rapid publication of high-quality, peer-reviewed research articles in fields covered by its title. The journal is published by Nakladatelství Academia, Centre of Administration and Operations of the Czech Academy of Sciences for the Institute of Information Theory and Automation of The Czech Academy of Sciences. Kybernetika traditionally publishes research results in the fields of Control Sciences, Information Sciences, Statistical Decision Making, Applied Probability Theory, Random Processes, Operations Research, Fuzziness and Uncertainty Theories, as well as in the topics closely related to the above fields.