CINXE.COM

DSpace at KDPU: Mathematical Model of a Two-Factor Transportation Problem With Weighting Coefficients

<!DOCTYPE html> <html> <head> <title>DSpace at KDPU: Mathematical Model of a Two-Factor Transportation Problem With Weighting Coefficients</title> <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /> <meta name="Generator" content="DSpace 6.3" /> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <link rel="shortcut icon" href="/favicon.ico" type="image/x-icon"/> <link rel="stylesheet" href="/static/css/jquery-ui-1.10.3.custom/redmond/jquery-ui-1.10.3.custom.css" type="text/css" /> <link rel="stylesheet" href="/static/css/bootstrap/bootstrap.min.css" type="text/css" /> <link rel="stylesheet" href="/static/css/bootstrap/bootstrap-theme.min.css" type="text/css" /> <link rel="stylesheet" href="/static/css/bootstrap/dspace-theme.css" type="text/css" /> <link rel="search" type="application/opensearchdescription+xml" href="/open-search/description.xml" title="DSpace"/> <link rel="schema.DCTERMS" href="https://purl.org/dc/terms/" /> <link rel="schema.DC" href="https://purl.org/dc/elements/1.1/" /> <meta name="DC.creator" content="Vakaliuk, T. A." /> <meta name="DC.creator" content="Chyzhmotria, O. V." /> <meta name="DC.creator" content="Семеріков, Сергій Олексійович" /> <meta name="DC.creator" content="Мінтій, Ірина Сергіївна" /> <meta name="DC.creator" content="Вакалюк, Тетяна Анатоліївна" /> <meta name="DC.creator" content="Чижмотря, Олексій Володимирович" /> <meta name="DCTERMS.dateAccepted" content="2023-12-11T07:57:25Z" scheme="DCTERMS.W3CDTF" /> <meta name="DCTERMS.available" content="2023-12-11T07:57:25Z" scheme="DCTERMS.W3CDTF" /> <meta name="DCTERMS.issued" content="2023-11-27" scheme="DCTERMS.W3CDTF" /> <meta name="DCTERMS.bibliographicCitation" content="Vakaliuk T. A. Mathematical Model of a Two-Factor Transportation Problem With Weighting Coefficients / T. A. Vakaliuk, O. V. Chyzhmotria, S. O. Semerikov, I. S. Mintii // 2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT), Lviv, Ukraine. – 2023. – P. 1-6. – DOI : 10.1109/CSIT61576.2023.10324171" xml:lang="uk" /> <meta name="DC.identifier" content="979-8-3503-6046-2" /> <meta name="DC.identifier" content="979-8-3503-6045-5" /> <meta name="DC.identifier" content="979-8-3503-6047-9" /> <meta name="DC.identifier" content="2766-3639" /> <meta name="DC.identifier" content="2766-3655" /> <meta name="DC.identifier" content="https://doi.org/10.1109/CSIT61576.2023.10324171" scheme="DCTERMS.URI" /> <meta name="DC.identifier" content="http://elibrary.kdpu.edu.ua/xmlui/handle/123456789/8485" scheme="DCTERMS.URI" /> <meta name="DC.description" content="[1] O. Pavlenko, D. Velykodnyi, O. Lavrentieva, and S. Filatov, “The Procedures of Logistic Transport Systems Simulation into the Petri Nets Environment,” CEUR Workshop Proceedings, vol. 2732, pp. 854–868, 2020.&#xD;&#xA;[2] V. Aulin, A. Hrynkiv, O. Lyashuk, Y. Vovk, S. Lysenko, D. Holub, T. Zamota, A. Pankov, M. Sokol, V. Ratynskyi, and O. Lavrentieva, “Increasing the Functioning Efficiency of the Working Warehouse of the “UVK Ukraine” Company Transport and Logistics Center,” Communications - Scientific Letters of the University of Zilina, vol. 22, no. 2, pp. 3–14, 2020.&#xD;&#xA;[3] S. O. Semerikov, T. A. Vakaliuk, I. S. Mintii, and S. O. Didkivska, “Challenges facing distance learning during martial law: results of a survey of Ukrainian students,” Educational Technology Quarterly, Oct. 2023. [Online]. Available: https://doi.org/10.55056/etq.637&#xD;&#xA;[4] A. Burduk and K. Musiał, “Optimization of chosen transport task by using generic algorithms,” in Computer Information Systems and Industrial Management, K. Saeed and W. Homenda, Eds. Cham: Springer International Publishing, 2016, pp. 197–205.&#xD;&#xA;[5] V. Prifti, I. Dervishi, K. Dhoska, I. Markja, and A. Pramono, “Minimization of transport costs in an industrial company through linear programming,” IOP Conference Series: Materials Science and Engineering, vol. 909, no. 1, p. 012040, dec 2020.&#xD;&#xA;[6] P. C. Pop, C. Sabo, B. Biesinge, B. Hu, and G. R. Raidl, “Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm,” Carpathian Journal of Mathematics, vol. 33, no. 3, pp. 364–370, 2017.&#xD;&#xA;[7] O. Chyzhmotria, O. Chyzhmotria, and T. A. Vakaliuk, “Algorithm of Analysis and Conversion of Input Data of a Two-factor Multivariative Transport Problem with Weight Coefficients,” in Proceedings of The Fourth International Workshop on Computer Modeling and Intelligent Systems (CMIS-2021), Zaporizhzhia, Ukraine, April 27, 2021, ser. CEUR Workshop Proceedings, S. Subbotin, Ed. CEUR-WS.org, 2021, vol. 2864, pp. 455–464. [Online]. Available: https://ceur-ws.org/Vol-2864/paper40.pdf&#xD;&#xA;[8] P. Pandian and G. Natarajan, “Solving Two Stage Transportation Problems,” in Control, Computation and Information Systems, P. Balasubramaniam, Ed. Berlin, Heidelberg: Springer, 2011, pp. 159–165.&#xD;&#xA;[9] E. Garajová and M. Rada, “Interval transportation problem: feasibility, optimality and the worst optimal value,” Central European Journal of Operations Research, vol. 31, no. 3, pp. 769–790, Sep 2023.&#xD;&#xA;[10] O. Cosma, P. C. Pop, and C. Sabo, “An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem,” in Hybrid Artificial Intelligent Systems, H. Pérez Garcı́a, L. Sánchez González, M. Castejón Limas, H. Quintián Pardo, and E. Corchado Rodrı́guez, Eds. Cham: Springer, 2019, pp. 157–167.&#xD;&#xA;[11] Y. Deng, Y. Zheng, and J. Li, “Route optimization model in collaborative logistics network for mixed transportation problem considered cost discount based on GATS,” Journal of Ambient Intelligence and Humanized Computing, vol. 10, no. 1, pp. 409–416, Jan 2019.&#xD;&#xA;[12] M. R. Islam, M. R. Mahmud, and R. M. Pritom, “Transportation scheduling optimization by a collaborative strategy in supply chain management with TPL using chemical reaction optimization,” Neural Computing and Applications, vol. 32, no. 8, pp. 3649–3674, Apr 2020.&#xD;&#xA;[13] S. Gupta, H. Garg, and S. Chaudhary, “Parameter estimation and optimization of multi-objective capacitated stochastic transportation problem for gamma distribution,” Complex &amp; Intelligent Systems, vol. 6, no. 3, pp. 651–667, Oct 2020. [Online]. Available: https://doi.org/10.1007/s40747-020-00156-1&#xD;&#xA;[14] P. I. Stetsiuk, O. P. Bysaha, and S. S. Tregubenko, “Two-stage transportation problem with constraint on the number of intermediate locations,” Computer mathematics, vol. 2, pp. 119–128, 2018" xml:lang="uk" /> <meta name="DCTERMS.abstract" content="The article presents a two-factor transportation problem with weighting coefficients, which is formulated as a problem of finding the most profitable plan for the transportation of homogeneous cargo from points of departure to points of consumption in the conditions of two factors and the presence of weighting coefficients. The task is to develop a mathematical model of this problem. It is proposed to use the method of reducing the initial problem to the form of a classical transportation problem for the use of any of the existing solution algorithms in the future. The content of the developed step-by-step algorithm for reducing a two-factor transportation problem with weighting coefficients to the form of a classical transportation problem is presented, and the corresponding general scheme is given. The conclusions are drawn and the advantages of developing a software product for solving a two-factor transportation problem with weighting coefficients using the developed method are argued." xml:lang="uk" /> <meta name="DC.language" content="en" xml:lang="uk" scheme="DCTERMS.RFC1766" /> <meta name="DC.publisher" content="IEEE" xml:lang="uk" /> <meta name="DC.subject" content="transportation problem" xml:lang="uk" /> <meta name="DC.subject" content="mathematical model" xml:lang="uk" /> <meta name="DC.subject" content="tariff matrix" xml:lang="uk" /> <meta name="DC.subject" content="factor" xml:lang="uk" /> <meta name="DC.subject" content="weighting coefficient" xml:lang="uk" /> <meta name="DC.subject" content="transportation plan" xml:lang="uk" /> <meta name="DC.title" content="Mathematical Model of a Two-Factor Transportation Problem With Weighting Coefficients" xml:lang="uk" /> <meta name="DC.type" content="Article" xml:lang="uk" /> <meta name="citation_keywords" content="transportation problem; mathematical model; tariff matrix; factor; weighting coefficient; transportation plan" /> <meta name="citation_isbn" content="979-8-3503-6046-2" /> <meta name="citation_issn" content="2766-3639" /> <script type='text/javascript' src="/static/js/jquery/jquery-1.10.2.min.js"></script> <script type='text/javascript' src='/static/js/jquery/jquery-ui-1.10.3.custom.min.js'></script> <script type='text/javascript' src='/static/js/bootstrap/bootstrap.min.js'></script> <script type='text/javascript' src='/static/js/holder.js'></script> <script type="text/javascript" src="/utils.js"></script> <script type="text/javascript" src="/static/js/choice-support.js"> </script> <!-- HTML5 shim and Respond.js IE8 support of HTML5 elements and media queries --> <!--[if lt IE 9]> <script src="/static/js/html5shiv.js"></script> <script src="/static/js/respond.min.js"></script> <![endif]--> </head> <body class="undernavigation"> <a class="sr-only" href="#content">Skip navigation</a> <header class="navbar navbar-inverse navbar-fixed-top"> <div class="container"> <div class="navbar-header"> <button type="button" class="navbar-toggle" data-toggle="collapse" data-target=".navbar-collapse"> <span class="icon-bar"></span> <span class="icon-bar"></span> <span class="icon-bar"></span> </button> <a class="navbar-brand" href="/"><img height="25" src="/image/dspace-logo-only.png" alt="DSpace logo" /></a> </div> <nav class="collapse navbar-collapse bs-navbar-collapse" role="navigation"> <ul class="nav navbar-nav"> <li class=""><a href="/"><span class="glyphicon glyphicon-home"></span> Головна сторінка</a></li> <li class="dropdown"> <a href="#" class="dropdown-toggle" data-toggle="dropdown">Перегляд <b class="caret"></b></a> <ul class="dropdown-menu"> <li><a href="/community-list">Фонди та зібрання</a></li> <li class="divider"></li> <li class="dropdown-header">Перегляд матеріалів за:</li> <li><a href="/browse?type=dateissued">Дати випуску</a></li> <li><a href="/browse?type=author">Автори</a></li> <li><a href="/browse?type=title">Заголовки</a></li> <li><a href="/browse?type=subject">Теми</a></li> </ul> </li> <li class=""><script type="text/javascript"> <!-- Javascript starts here document.write('<a href="#" onClick="var popupwin = window.open(\'/help/index_uk.html\',\'dspacepopup\',\'height=600,width=550,resizable,scrollbars\');popupwin.focus();return false;">Довідка<\/a>'); // --> </script><noscript><a href="/help/index_uk.html" target="dspacepopup">Довідка</a></noscript></li> </ul> <div class="nav navbar-nav navbar-right"> <ul class="nav navbar-nav navbar-right"> <li class="dropdown"> <a href="#" class="dropdown-toggle" data-toggle="dropdown"><span class="glyphicon glyphicon-user"></span> Вхід: <b class="caret"></b></a> <ul class="dropdown-menu"> <li><a href="/mydspace">Мій архів матеріалів</a></li> <li><a href="/subscribe">Оновлення на e-mail</a></li> <li><a href="/profile">Обліковий запис</a></li> </ul> </li> </ul> <form method="get" action="/simple-search" class="navbar-form navbar-right"> <div class="form-group"> <input type="text" class="form-control" placeholder="Шукати&nbsp;в&nbsp;архіві" name="query" id="tequery" size="25"/> </div> <button type="submit" class="btn btn-primary"><span class="glyphicon glyphicon-search"></span></button> </form></div> </nav> </div> </header> <main id="content" role="main"> <div class="container"> <ol class="breadcrumb btn-success"> <li><a href="/">DSpace at KDPU</a></li> <li><a href="/handle/0564/46">Електронні публікації</a></li> <li><a href="/handle/0564/47">Фізико-математичний факультет</a></li> <li><a href="/handle/0564/56">Кафедра інформатики та прикладної математики</a></li> </ol> </div> <div class="container"> <div class="well">Будь ласка, використовуйте цей ідентифікатор, щоб цитувати або посилатися на цей матеріал: <code>http://elibrary.kdpu.edu.ua/xmlui/handle/123456789/8485</code></div> <table class="table itemDisplayTable"> <tr><td class="metadataFieldLabel dc_title">Назва:&nbsp;</td><td class="metadataFieldValue dc_title">Mathematical&#x20;Model&#x20;of&#x20;a&#x20;Two-Factor&#x20;Transportation&#x20;Problem&#x20;With&#x20;Weighting&#x20;Coefficients</td></tr> <tr><td class="metadataFieldLabel dc_contributor">Автори:&nbsp;</td><td class="metadataFieldValue dc_contributor"><a class="author"href="/browse?type=author&amp;value=Vakaliuk%2C+T.+A.">Vakaliuk,&#x20;T.&#x20;A.</a><br /><a class="author"href="/browse?type=author&amp;value=Chyzhmotria%2C+O.+V.">Chyzhmotria,&#x20;O.&#x20;V.</a><br /><a class="author"href="/browse?type=author&amp;value=%D0%A1%D0%B5%D0%BC%D0%B5%D1%80%D1%96%D0%BA%D0%BE%D0%B2%2C+%D0%A1%D0%B5%D1%80%D0%B3%D1%96%D0%B9+%D0%9E%D0%BB%D0%B5%D0%BA%D1%81%D1%96%D0%B9%D0%BE%D0%B2%D0%B8%D1%87">Семеріков,&#x20;Сергій&#x20;Олексійович</a><br /><a class="author"href="/browse?type=author&amp;value=%D0%9C%D1%96%D0%BD%D1%82%D1%96%D0%B9%2C+%D0%86%D1%80%D0%B8%D0%BD%D0%B0+%D0%A1%D0%B5%D1%80%D0%B3%D1%96%D1%97%D0%B2%D0%BD%D0%B0">Мінтій,&#x20;Ірина&#x20;Сергіївна</a><br /><a class="author"href="/browse?type=author&amp;value=%D0%92%D0%B0%D0%BA%D0%B0%D0%BB%D1%8E%D0%BA%2C+%D0%A2%D0%B5%D1%82%D1%8F%D0%BD%D0%B0+%D0%90%D0%BD%D0%B0%D1%82%D0%BE%D0%BB%D1%96%D1%97%D0%B2%D0%BD%D0%B0">Вакалюк,&#x20;Тетяна&#x20;Анатоліївна</a><br /><a class="author"href="/browse?type=author&amp;value=%D0%A7%D0%B8%D0%B6%D0%BC%D0%BE%D1%82%D1%80%D1%8F%2C+%D0%9E%D0%BB%D0%B5%D0%BA%D1%81%D1%96%D0%B9+%D0%92%D0%BE%D0%BB%D0%BE%D0%B4%D0%B8%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B8%D1%87">Чижмотря,&#x20;Олексій&#x20;Володимирович</a></td></tr> <tr><td class="metadataFieldLabel dc_subject">Ключові слова:&nbsp;</td><td class="metadataFieldValue dc_subject">transportation&#x20;problem<br />mathematical&#x20;model<br />tariff&#x20;matrix<br />factor<br />weighting&#x20;coefficient<br />transportation&#x20;plan</td></tr> <tr><td class="metadataFieldLabel dc_date_issued">Дата публікації:&nbsp;</td><td class="metadataFieldValue dc_date_issued">27-лис-2023</td></tr> <tr><td class="metadataFieldLabel dc_publisher">Видавництво:&nbsp;</td><td class="metadataFieldValue dc_publisher">IEEE</td></tr> <tr><td class="metadataFieldLabel dc_identifier_citation">Бібліографічний опис:&nbsp;</td><td class="metadataFieldValue dc_identifier_citation">Vakaliuk&#x20;T.&#x20;A.&#x20;Mathematical&#x20;Model&#x20;of&#x20;a&#x20;Two-Factor&#x20;Transportation&#x20;Problem&#x20;With&#x20;Weighting&#x20;Coefficients&#x20;&#x2F;&#x20;T.&#x20;A.&#x20;Vakaliuk,&#x20;O.&#x20;V.&#x20;Chyzhmotria,&#x20;S.&#x20;O.&#x20;Semerikov,&#x20;I.&#x20;S.&#x20;Mintii&#x20;&#x2F;&#x2F;&#x20;2023&#x20;IEEE&#x20;18th&#x20;International&#x20;Conference&#x20;on&#x20;Computer&#x20;Science&#x20;and&#x20;Information&#x20;Technologies&#x20;(CSIT),&#x20;Lviv,&#x20;Ukraine.&#x20;–&#x20;2023.&#x20;–&#x20;P.&#x20;1-6.&#x20;–&#x20;DOI&#x20;:&#x20;10.1109&#x2F;CSIT61576.2023.10324171</td></tr> <tr><td class="metadataFieldLabel dc_description_abstract">Короткий огляд (реферат):&nbsp;</td><td class="metadataFieldValue dc_description_abstract">The&#x20;article&#x20;presents&#x20;a&#x20;two-factor&#x20;transportation&#x20;problem&#x20;with&#x20;weighting&#x20;coefficients,&#x20;which&#x20;is&#x20;formulated&#x20;as&#x20;a&#x20;problem&#x20;of&#x20;finding&#x20;the&#x20;most&#x20;profitable&#x20;plan&#x20;for&#x20;the&#x20;transportation&#x20;of&#x20;homogeneous&#x20;cargo&#x20;from&#x20;points&#x20;of&#x20;departure&#x20;to&#x20;points&#x20;of&#x20;consumption&#x20;in&#x20;the&#x20;conditions&#x20;of&#x20;two&#x20;factors&#x20;and&#x20;the&#x20;presence&#x20;of&#x20;weighting&#x20;coefficients.&#x20;The&#x20;task&#x20;is&#x20;to&#x20;develop&#x20;a&#x20;mathematical&#x20;model&#x20;of&#x20;this&#x20;problem.&#x20;It&#x20;is&#x20;proposed&#x20;to&#x20;use&#x20;the&#x20;method&#x20;of&#x20;reducing&#x20;the&#x20;initial&#x20;problem&#x20;to&#x20;the&#x20;form&#x20;of&#x20;a&#x20;classical&#x20;transportation&#x20;problem&#x20;for&#x20;the&#x20;use&#x20;of&#x20;any&#x20;of&#x20;the&#x20;existing&#x20;solution&#x20;algorithms&#x20;in&#x20;the&#x20;future.&#x20;The&#x20;content&#x20;of&#x20;the&#x20;developed&#x20;step-by-step&#x20;algorithm&#x20;for&#x20;reducing&#x20;a&#x20;two-factor&#x20;transportation&#x20;problem&#x20;with&#x20;weighting&#x20;coefficients&#x20;to&#x20;the&#x20;form&#x20;of&#x20;a&#x20;classical&#x20;transportation&#x20;problem&#x20;is&#x20;presented,&#x20;and&#x20;the&#x20;corresponding&#x20;general&#x20;scheme&#x20;is&#x20;given.&#x20;The&#x20;conclusions&#x20;are&#x20;drawn&#x20;and&#x20;the&#x20;advantages&#x20;of&#x20;developing&#x20;a&#x20;software&#x20;product&#x20;for&#x20;solving&#x20;a&#x20;two-factor&#x20;transportation&#x20;problem&#x20;with&#x20;weighting&#x20;coefficients&#x20;using&#x20;the&#x20;developed&#x20;method&#x20;are&#x20;argued.</td></tr> <tr><td class="metadataFieldLabel dc_description">Опис:&nbsp;</td><td class="metadataFieldValue dc_description">[1]&#x20;O.&#x20;Pavlenko,&#x20;D.&#x20;Velykodnyi,&#x20;O.&#x20;Lavrentieva,&#x20;and&#x20;S.&#x20;Filatov,&#x20;“The&#x20;Procedures&#x20;of&#x20;Logistic&#x20;Transport&#x20;Systems&#x20;Simulation&#x20;into&#x20;the&#x20;Petri&#x20;Nets&#x20;Environment,”&#x20;CEUR&#x20;Workshop&#x20;Proceedings,&#x20;vol.&#x20;2732,&#x20;pp.&#x20;854–868,&#x20;2020.&#x0D;&#x0A;[2]&#x20;V.&#x20;Aulin,&#x20;A.&#x20;Hrynkiv,&#x20;O.&#x20;Lyashuk,&#x20;Y.&#x20;Vovk,&#x20;S.&#x20;Lysenko,&#x20;D.&#x20;Holub,&#x20;T.&#x20;Zamota,&#x20;A.&#x20;Pankov,&#x20;M.&#x20;Sokol,&#x20;V.&#x20;Ratynskyi,&#x20;and&#x20;O.&#x20;Lavrentieva,&#x20;“Increasing&#x20;the&#x20;Functioning&#x20;Efficiency&#x20;of&#x20;the&#x20;Working&#x20;Warehouse&#x20;of&#x20;the&#x20;“UVK&#x20;Ukraine”&#x20;Company&#x20;Transport&#x20;and&#x20;Logistics&#x20;Center,”&#x20;Communications&#x20;-&#x20;Scientific&#x20;Letters&#x20;of&#x20;the&#x20;University&#x20;of&#x20;Zilina,&#x20;vol.&#x20;22,&#x20;no.&#x20;2,&#x20;pp.&#x20;3–14,&#x20;2020.&#x0D;&#x0A;[3]&#x20;S.&#x20;O.&#x20;Semerikov,&#x20;T.&#x20;A.&#x20;Vakaliuk,&#x20;I.&#x20;S.&#x20;Mintii,&#x20;and&#x20;S.&#x20;O.&#x20;Didkivska,&#x20;“Challenges&#x20;facing&#x20;distance&#x20;learning&#x20;during&#x20;martial&#x20;law:&#x20;results&#x20;of&#x20;a&#x20;survey&#x20;of&#x20;Ukrainian&#x20;students,”&#x20;Educational&#x20;Technology&#x20;Quarterly,&#x20;Oct.&#x20;2023.&#x20;[Online].&#x20;Available:&#x20;https:&#x2F;&#x2F;doi.org&#x2F;10.55056&#x2F;etq.637&#x0D;&#x0A;[4]&#x20;A.&#x20;Burduk&#x20;and&#x20;K.&#x20;Musiał,&#x20;“Optimization&#x20;of&#x20;chosen&#x20;transport&#x20;task&#x20;by&#x20;using&#x20;generic&#x20;algorithms,”&#x20;in&#x20;Computer&#x20;Information&#x20;Systems&#x20;and&#x20;Industrial&#x20;Management,&#x20;K.&#x20;Saeed&#x20;and&#x20;W.&#x20;Homenda,&#x20;Eds.&#x20;Cham:&#x20;Springer&#x20;International&#x20;Publishing,&#x20;2016,&#x20;pp.&#x20;197–205.&#x0D;&#x0A;[5]&#x20;V.&#x20;Prifti,&#x20;I.&#x20;Dervishi,&#x20;K.&#x20;Dhoska,&#x20;I.&#x20;Markja,&#x20;and&#x20;A.&#x20;Pramono,&#x20;“Minimization&#x20;of&#x20;transport&#x20;costs&#x20;in&#x20;an&#x20;industrial&#x20;company&#x20;through&#x20;linear&#x20;programming,”&#x20;IOP&#x20;Conference&#x20;Series:&#x20;Materials&#x20;Science&#x20;and&#x20;Engineering,&#x20;vol.&#x20;909,&#x20;no.&#x20;1,&#x20;p.&#x20;012040,&#x20;dec&#x20;2020.&#x0D;&#x0A;[6]&#x20;P.&#x20;C.&#x20;Pop,&#x20;C.&#x20;Sabo,&#x20;B.&#x20;Biesinge,&#x20;B.&#x20;Hu,&#x20;and&#x20;G.&#x20;R.&#x20;Raidl,&#x20;“Solving&#x20;the&#x20;two-stage&#x20;fixed-charge&#x20;transportation&#x20;problem&#x20;with&#x20;a&#x20;hybrid&#x20;genetic&#x20;algorithm,”&#x20;Carpathian&#x20;Journal&#x20;of&#x20;Mathematics,&#x20;vol.&#x20;33,&#x20;no.&#x20;3,&#x20;pp.&#x20;364–370,&#x20;2017.&#x0D;&#x0A;[7]&#x20;O.&#x20;Chyzhmotria,&#x20;O.&#x20;Chyzhmotria,&#x20;and&#x20;T.&#x20;A.&#x20;Vakaliuk,&#x20;“Algorithm&#x20;of&#x20;Analysis&#x20;and&#x20;Conversion&#x20;of&#x20;Input&#x20;Data&#x20;of&#x20;a&#x20;Two-factor&#x20;Multivariative&#x20;Transport&#x20;Problem&#x20;with&#x20;Weight&#x20;Coefficients,”&#x20;in&#x20;Proceedings&#x20;of&#x20;The&#x20;Fourth&#x20;International&#x20;Workshop&#x20;on&#x20;Computer&#x20;Modeling&#x20;and&#x20;Intelligent&#x20;Systems&#x20;(CMIS-2021),&#x20;Zaporizhzhia,&#x20;Ukraine,&#x20;April&#x20;27,&#x20;2021,&#x20;ser.&#x20;CEUR&#x20;Workshop&#x20;Proceedings,&#x20;S.&#x20;Subbotin,&#x20;Ed.&#x20;CEUR-WS.org,&#x20;2021,&#x20;vol.&#x20;2864,&#x20;pp.&#x20;455–464.&#x20;[Online].&#x20;Available:&#x20;https:&#x2F;&#x2F;ceur-ws.org&#x2F;Vol-2864&#x2F;paper40.pdf&#x0D;&#x0A;[8]&#x20;P.&#x20;Pandian&#x20;and&#x20;G.&#x20;Natarajan,&#x20;“Solving&#x20;Two&#x20;Stage&#x20;Transportation&#x20;Problems,”&#x20;in&#x20;Control,&#x20;Computation&#x20;and&#x20;Information&#x20;Systems,&#x20;P.&#x20;Balasubramaniam,&#x20;Ed.&#x20;Berlin,&#x20;Heidelberg:&#x20;Springer,&#x20;2011,&#x20;pp.&#x20;159–165.&#x0D;&#x0A;[9]&#x20;E.&#x20;Garajová&#x20;and&#x20;M.&#x20;Rada,&#x20;“Interval&#x20;transportation&#x20;problem:&#x20;feasibility,&#x20;optimality&#x20;and&#x20;the&#x20;worst&#x20;optimal&#x20;value,”&#x20;Central&#x20;European&#x20;Journal&#x20;of&#x20;Operations&#x20;Research,&#x20;vol.&#x20;31,&#x20;no.&#x20;3,&#x20;pp.&#x20;769–790,&#x20;Sep&#x20;2023.&#x0D;&#x0A;[10]&#x20;O.&#x20;Cosma,&#x20;P.&#x20;C.&#x20;Pop,&#x20;and&#x20;C.&#x20;Sabo,&#x20;“An&#x20;Efficient&#x20;Hybrid&#x20;Genetic&#x20;Algorithm&#x20;for&#x20;Solving&#x20;a&#x20;Particular&#x20;Two-Stage&#x20;Fixed-Charge&#x20;Transportation&#x20;Problem,”&#x20;in&#x20;Hybrid&#x20;Artificial&#x20;Intelligent&#x20;Systems,&#x20;H.&#x20;Pérez&#x20;Garcı́a,&#x20;L.&#x20;Sánchez&#x20;González,&#x20;M.&#x20;Castejón&#x20;Limas,&#x20;H.&#x20;Quintián&#x20;Pardo,&#x20;and&#x20;E.&#x20;Corchado&#x20;Rodrı́guez,&#x20;Eds.&#x20;Cham:&#x20;Springer,&#x20;2019,&#x20;pp.&#x20;157–167.&#x0D;&#x0A;[11]&#x20;Y.&#x20;Deng,&#x20;Y.&#x20;Zheng,&#x20;and&#x20;J.&#x20;Li,&#x20;“Route&#x20;optimization&#x20;model&#x20;in&#x20;collaborative&#x20;logistics&#x20;network&#x20;for&#x20;mixed&#x20;transportation&#x20;problem&#x20;considered&#x20;cost&#x20;discount&#x20;based&#x20;on&#x20;GATS,”&#x20;Journal&#x20;of&#x20;Ambient&#x20;Intelligence&#x20;and&#x20;Humanized&#x20;Computing,&#x20;vol.&#x20;10,&#x20;no.&#x20;1,&#x20;pp.&#x20;409–416,&#x20;Jan&#x20;2019.&#x0D;&#x0A;[12]&#x20;M.&#x20;R.&#x20;Islam,&#x20;M.&#x20;R.&#x20;Mahmud,&#x20;and&#x20;R.&#x20;M.&#x20;Pritom,&#x20;“Transportation&#x20;scheduling&#x20;optimization&#x20;by&#x20;a&#x20;collaborative&#x20;strategy&#x20;in&#x20;supply&#x20;chain&#x20;management&#x20;with&#x20;TPL&#x20;using&#x20;chemical&#x20;reaction&#x20;optimization,”&#x20;Neural&#x20;Computing&#x20;and&#x20;Applications,&#x20;vol.&#x20;32,&#x20;no.&#x20;8,&#x20;pp.&#x20;3649–3674,&#x20;Apr&#x20;2020.&#x0D;&#x0A;[13]&#x20;S.&#x20;Gupta,&#x20;H.&#x20;Garg,&#x20;and&#x20;S.&#x20;Chaudhary,&#x20;“Parameter&#x20;estimation&#x20;and&#x20;optimization&#x20;of&#x20;multi-objective&#x20;capacitated&#x20;stochastic&#x20;transportation&#x20;problem&#x20;for&#x20;gamma&#x20;distribution,”&#x20;Complex&#x20;&amp;&#x20;Intelligent&#x20;Systems,&#x20;vol.&#x20;6,&#x20;no.&#x20;3,&#x20;pp.&#x20;651–667,&#x20;Oct&#x20;2020.&#x20;[Online].&#x20;Available:&#x20;https:&#x2F;&#x2F;doi.org&#x2F;10.1007&#x2F;s40747-020-00156-1&#x0D;&#x0A;[14]&#x20;P.&#x20;I.&#x20;Stetsiuk,&#x20;O.&#x20;P.&#x20;Bysaha,&#x20;and&#x20;S.&#x20;S.&#x20;Tregubenko,&#x20;“Two-stage&#x20;transportation&#x20;problem&#x20;with&#x20;constraint&#x20;on&#x20;the&#x20;number&#x20;of&#x20;intermediate&#x20;locations,”&#x20;Computer&#x20;mathematics,&#x20;vol.&#x20;2,&#x20;pp.&#x20;119–128,&#x20;2018</td></tr> <tr><td class="metadataFieldLabel dc_identifier_uri">URI (Уніфікований ідентифікатор ресурсу):&nbsp;</td><td class="metadataFieldValue dc_identifier_uri"><a href="https://doi.org/10.1109/CSIT61576.2023.10324171">https:&#x2F;&#x2F;doi.org&#x2F;10.1109&#x2F;CSIT61576.2023.10324171</a><br /><a href="https://elibrary.kdpu.edu.ua/xmlui/handle/123456789/8485">http:&#x2F;&#x2F;elibrary.kdpu.edu.ua&#x2F;xmlui&#x2F;handle&#x2F;123456789&#x2F;8485</a></td></tr> <tr><td class="metadataFieldLabel dc_identifier_isbn">ISBN:&nbsp;</td><td class="metadataFieldValue dc_identifier_isbn">979-8-3503-6046-2<br />979-8-3503-6045-5<br />979-8-3503-6047-9</td></tr> <tr><td class="metadataFieldLabel dc_identifier_issn">ISSN:&nbsp;</td><td class="metadataFieldValue dc_identifier_issn">2766-3639<br />2766-3655</td></tr> <tr><td class="metadataFieldLabel">Розташовується у зібраннях:</td><td class="metadataFieldValue"><a href="/handle/0564/56">Кафедра інформатики та прикладної математики</a><br/></td></tr> </table><br/> <div class="panel panel-info"><div class="panel-heading">Файли цього матеріалу:</div> <table class="table panel-body"><tr><th id="t1" class="standard">Файл</th> <th id="t2" class="standard">Опис</th> <th id="t3" class="standard">Розмір</th><th id="t4" class="standard">Формат</th><th>&nbsp;</th></tr> <tr><td headers="t1" class="standard break-all"><a target="_blank" href="/bitstream/123456789/8485/1/conference_paper.pdf">conference_paper.pdf</a></td><td headers="t2" class="standard break-all"></td><td headers="t3" class="standard">192.78 kB</td><td headers="t4" class="standard">Adobe PDF</td><td class="standard" align="center"><a class="btn btn-primary" target="_blank" href="/bitstream/123456789/8485/1/conference_paper.pdf">Переглянути/Відкрити</a></td></tr></table> </div> <div class="container row"> <a class="btn btn-default" href="/handle/123456789/8485?mode=full"> Показати повний опис матеріалу </a> <a class="statisticsLink btn btn-primary" href="/handle/123456789/8485/statistics">Перегляд статистики</a> </div> <br/> <br/> <p class="submitFormHelp alert alert-info">Усі матеріали в архіві електронних ресурсів захищені авторським правом, всі права збережені.</p> </div> </main> <footer class="navbar navbar-inverse navbar-bottom"> <div id="designedby" class="container text-muted"> <div id="footer_feedback" class="pull-right"> </div> </div> </footer> </body> </html>

Pages: 1 2 3 4 5 6 7 8 9 10