On Investigation of Natural Algorithms and Their Complex Application for Optimization of Logistics Tasks
Introduction. At present, with the increase in the number of data and the complexity of various processes in many branches of the national economy, the classical methods of answering have ceased to meet the needs. So, for example, if you consider the logistics industry (this and transportation, and...
        Saved in:
      
    
          | Published in | Kìbernetika ta komp'ûternì tehnologìï (Online) no. 1; pp. 11 - 18 | 
|---|---|
| Main Authors | , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
            V.M. Glushkov Institute of Cybernetics
    
        30.06.2022
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 2707-4501 2707-451X 2707-451X  | 
| DOI | 10.34229/2707-451X.22.1.2 | 
Cover
| Abstract | Introduction. At present, with the increase in the number of data and the complexity of various processes in many branches of the national economy, the classical methods of answering have ceased to meet the needs. So, for example, if you consider the logistics industry (this and transportation, and various cartographic services for consumers), we see how dynamically developing these areas. To construct optimal routes, if we continued to use old algorithms, we would have to spend a huge amount of computer resources and time to get results. Instead, the study finds new methods that make it possible to speed up and simplify the solution of problems. So, for example, for logistics problems, instead of classical combinatorial problems, algorithms are being replaced by environmental scientists. They were called natural algorithms. For example, scientists have noticed that ants find the shortest route to food using the iteration and intensity of a pheromone trace that leaves previous ants who are moving along the path. This idea formed the basis of the algorithm of the ant colony. Even if in reality ants find the optimal way more difficult than the simplified idea of researchers, it turned out that this simplification was enough to find an optimal route between some points of the type like ants looking for an optimal route food.
To develop a complex meta-algorithm that would solve the problem of logistics network, the following methods are taken into account: natural algorithms, salesman problem, dynamic programming methods, combinatorial approaches, algorithms for complex data analysis.
This paper considers the application of methods of natural algorithms to solve the problem of coordinated logistics.
The purpose of the paper. The aim of the work is to increase the efficiency of using natural algorithms in logistics problems. In general, the main tasks of logistics are to forecast the amount of costs, products and resources under certain circumstances. However, the required amount of material, information, financial, service and other data flows is not always available in logistics tasks, many variables are unknown. Then heuristic methods of algorithms come to the rescue to solve such problems of an applied nature.
Results. The software implementation of the model in the Python programming language was performed. Some methods of dynamic programming, fuzzy logic were used and the hyperopt library was used to implement the script. Keywords: natural algorithms, logistics, ant algorithm, meta-algorithm. | 
    
|---|---|
| AbstractList | Introduction. At present, with the increase in the number of data and the complexity of various processes in many branches of the national economy, the classical methods of answering have ceased to meet the needs. So, for example, if you consider the logistics industry (this and transportation, and various cartographic services for consumers), we see how dynamically developing these areas. To construct optimal routes, if we continued to use old algorithms, we would have to spend a huge amount of computer resources and time to get results. Instead, the study finds new methods that make it possible to speed up and simplify the solution of problems. So, for example, for logistics problems, instead of classical combinatorial problems, algorithms are being replaced by environmental scientists. They were called natural algorithms. For example, scientists have noticed that ants find the shortest route to food using the iteration and intensity of a pheromone trace that leaves previous ants who are moving along the path. This idea formed the basis of the algorithm of the ant colony. Even if in reality ants find the optimal way more difficult than the simplified idea of researchers, it turned out that this simplification was enough to find an optimal route between some points of the type like ants looking for an optimal route food. To develop a complex meta-algorithm that would solve the problem of logistics network, the following methods are taken into account: natural algorithms, salesman problem, dynamic programming methods, combinatorial approaches, algorithms for complex data analysis. This paper considers the application of methods of natural algorithms to solve the problem of coordinated logistics. The purpose of the paper. The aim of the work is to increase the efficiency of using natural algorithms in logistics problems. In general, the main tasks of logistics are to forecast the amount of costs, products and resources under certain circumstances. However, the required amount of material, information, financial, service and other data flows is not always available in logistics tasks, many variables are unknown. Then heuristic methods of algorithms come to the rescue to solve such problems of an applied nature. Results. The software implementation of the model in the Python programming language was performed. Some methods of dynamic programming, fuzzy logic were used and the hyperopt library was used to implement the script. Introduction. At present, with the increase in the number of data and the complexity of various processes in many branches of the national economy, the classical methods of answering have ceased to meet the needs. So, for example, if you consider the logistics industry (this and transportation, and various cartographic services for consumers), we see how dynamically developing these areas. To construct optimal routes, if we continued to use old algorithms, we would have to spend a huge amount of computer resources and time to get results. Instead, the study finds new methods that make it possible to speed up and simplify the solution of problems. So, for example, for logistics problems, instead of classical combinatorial problems, algorithms are being replaced by environmental scientists. They were called natural algorithms. For example, scientists have noticed that ants find the shortest route to food using the iteration and intensity of a pheromone trace that leaves previous ants who are moving along the path. This idea formed the basis of the algorithm of the ant colony. Even if in reality ants find the optimal way more difficult than the simplified idea of researchers, it turned out that this simplification was enough to find an optimal route between some points of the type like ants looking for an optimal route food. To develop a complex meta-algorithm that would solve the problem of logistics network, the following methods are taken into account: natural algorithms, salesman problem, dynamic programming methods, combinatorial approaches, algorithms for complex data analysis. This paper considers the application of methods of natural algorithms to solve the problem of coordinated logistics. The purpose of the paper. The aim of the work is to increase the efficiency of using natural algorithms in logistics problems. In general, the main tasks of logistics are to forecast the amount of costs, products and resources under certain circumstances. However, the required amount of material, information, financial, service and other data flows is not always available in logistics tasks, many variables are unknown. Then heuristic methods of algorithms come to the rescue to solve such problems of an applied nature. Results. The software implementation of the model in the Python programming language was performed. Some methods of dynamic programming, fuzzy logic were used and the hyperopt library was used to implement the script. Keywords: natural algorithms, logistics, ant algorithm, meta-algorithm.  | 
    
| Author | Tretynyk, Violeta Andriichuk, Victor  | 
    
| Author_xml | – sequence: 1 givenname: Victor surname: Andriichuk fullname: Andriichuk, Victor organization: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" – sequence: 2 givenname: Violeta orcidid: 0000-0002-3538-8207 surname: Tretynyk fullname: Tretynyk, Violeta organization: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"  | 
    
| BookMark | eNp1kMtOwzAQRS1UJKDwAez8Ay32JI6TZVXxqFTRTZHYWdNk3BrSOLLDo3w9oYXuWM3oSufo6l6wQeMbYuxainGSAhQ3oIUepUo-jwHGcgwn7PwYDY6_kGfsKsYXIQQUUiS5OmebRcNnzTvFzq2xc77h3vJH7N4C1nxSr31w3WYbOTYVX27IBT7127amTz5p29qVB8b6wBdt57bu6yiZ-7XrrWXkS4yv8ZKdWqwjXf3eIXu6u11OH0bzxf1sOpmPSqkkjGxZ2qrKkywTK8i0lmWlC5WBtalQ0FfOimpFVVqQJSms0pLUyiaEIs-ttkUyZLODt_L4Ytrgthh2xqMz-8CHtcHQ16rJIJEVeqUoUSqtEpVrREW5BpkC2RR7Fxxcb02Luw-s66NQCrOf3vxsa_qdPw2AkQZ6SB6gMvgYA9n_mec_5ht9mIl7 | 
    
| Cites_doi | 10.1007/978-3-642-21434-9_8 10.1007/978-3-642-25566-3_40 10.1145/2487575.2487629  | 
    
| ContentType | Journal Article | 
    
| DBID | AAYXX CITATION ADTOC UNPAY DOA  | 
    
| DOI | 10.34229/2707-451X.22.1.2 | 
    
| DatabaseName | CrossRef Unpaywall for CDI: Periodical Content Unpaywall DOAJ Directory of Open Access Journals  | 
    
| DatabaseTitle | CrossRef | 
    
| DatabaseTitleList | CrossRef  | 
    
| Database_xml | – sequence: 1 dbid: DOA name: Open Access - DOAJ url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository  | 
    
| DeliveryMethod | fulltext_linktorsrc | 
    
| Discipline | Sciences (General) | 
    
| EISSN | 2707-451X | 
    
| EndPage | 18 | 
    
| ExternalDocumentID | oai_doaj_org_article_aeef07b5e3554d3587aa5e872142ef4a 10.34229/2707-451x.22.1.2 10_34229_2707_451X_22_1_2  | 
    
| GroupedDBID | AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ ADTOC UNPAY  | 
    
| ID | FETCH-LOGICAL-c1512-fccfdd83660b26771cd79562ff405238569dbed49efe10f571e5bf3ea088f7f93 | 
    
| IEDL.DBID | UNPAY | 
    
| ISSN | 2707-4501 2707-451X  | 
    
| IngestDate | Fri Oct 03 12:46:26 EDT 2025 Mon Sep 15 08:18:05 EDT 2025 Tue Jul 01 03:06:33 EDT 2025  | 
    
| IsDoiOpenAccess | true | 
    
| IsOpenAccess | true | 
    
| IsPeerReviewed | true | 
    
| IsScholarly | true | 
    
| Issue | 1 | 
    
| Language | English | 
    
| License | https://creativecommons.org/licenses/by-nc-sa/4.0 cc-by-nc  | 
    
| LinkModel | DirectLink | 
    
| MergedId | FETCHMERGED-LOGICAL-c1512-fccfdd83660b26771cd79562ff405238569dbed49efe10f571e5bf3ea088f7f93 | 
    
| ORCID | 0000-0002-3538-8207 | 
    
| OpenAccessLink | https://proxy.k.utb.cz/login?url=http://cctech.org.ua/images/docs/Articles/2022/paper_22_1_2.pdf | 
    
| PageCount | 8 | 
    
| ParticipantIDs | doaj_primary_oai_doaj_org_article_aeef07b5e3554d3587aa5e872142ef4a unpaywall_primary_10_34229_2707_451x_22_1_2 crossref_primary_10_34229_2707_451X_22_1_2  | 
    
| ProviderPackageCode | CITATION AAYXX  | 
    
| PublicationCentury | 2000 | 
    
| PublicationDate | 2022-6-30 | 
    
| PublicationDateYYYYMMDD | 2022-06-30 | 
    
| PublicationDate_xml | – month: 06 year: 2022 text: 2022-6-30 day: 30  | 
    
| PublicationDecade | 2020 | 
    
| PublicationTitle | Kìbernetika ta komp'ûternì tehnologìï (Online) | 
    
| PublicationYear | 2022 | 
    
| Publisher | V.M. Glushkov Institute of Cybernetics | 
    
| Publisher_xml | – name: V.M. Glushkov Institute of Cybernetics | 
    
| References | ref0 ref2 ref1 ref4 ref3 ref5  | 
    
| References_xml | – ident: ref1 doi: 10.1007/978-3-642-21434-9_8 – ident: ref4 – ident: ref3 – ident: ref2 doi: 10.1007/978-3-642-25566-3_40 – ident: ref0 – ident: ref5 doi: 10.1145/2487575.2487629  | 
    
| SSID | ssj0002910385 ssib044750725  | 
    
| Score | 2.1895177 | 
    
| Snippet | Introduction. At present, with the increase in the number of data and the complexity of various processes in many branches of the national economy, the... | 
    
| SourceID | doaj unpaywall crossref  | 
    
| SourceType | Open Website Open Access Repository Index Database  | 
    
| StartPage | 11 | 
    
| SubjectTerms | ant algorithm logistics meta-algorithm natural algorithms  | 
    
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwELYQF-ih4lHULQX5wIG2CtiOHSfHBYEQ4nFZpL1ZdjwuqEsWkUWl_76exMByQFy4Wkkm-jyZR2bmMyE7vOZWypiWeGB5Jl3gmWW8zkof3ZFCthHAaeTzi-LkSp6O1XjuqC_sCevpgXvg9i1AYNopQMfoc1VqaxWUGqnCIMguNGJlNZdMRU1CFjumk6aiTRYVEoFjP6PQDIm-Ge9LnLkUotpPi3y8J8RezBpfOamOy_8TWXpo7uy_v3YymXNAxyvkc4oc6bB_41WyAM0aWU3fZkt3E4H0j3VyfdnQOf6MaUOngV7YjmGDDie_p_c3s-vbltrG0xEWCihahQk80uFLOZvGaJZeRoNymyY18SFn3bzQTd3SkW3_tF_I1fHR6PAkSycqZDV69izUdfC-zIuCOVFozWuvY4IkQpD4e7hUReUdeFlBAM6C0hyUCznYaIuCDlW-QRabaQNfCZVegC3iTdLWkklbKlsIF5zT3MWYjA_IzycIzV1PnGFiwtHhbRBvg3gbIQw3YkAOEOTnC5HzuluImmCSJpj3NGFAfj1v0dsiH5PIbx8hcpMsCxyH6PoHv5PF2f0DbMUgZea2O338D2ds34k priority: 102 providerName: Directory of Open Access Journals  | 
    
| Title | On Investigation of Natural Algorithms and Their Complex Application for Optimization of Logistics Tasks | 
    
| URI | http://cctech.org.ua/images/docs/Articles/2022/paper_22_1_2.pdf https://doaj.org/article/aeef07b5e3554d3587aa5e872142ef4a  | 
    
| UnpaywallVersion | publishedVersion | 
    
| hasFullText | 1 | 
    
| inHoldings | 1 | 
    
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: Open Access - DOAJ customDbUrl: eissn: 2707-451X dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0002910385 issn: 2707-451X databaseCode: DOA dateStart: 20200101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2707-451X dateEnd: 99991231 omitProxy: true ssIdentifier: ssib044750725 issn: 2707-4501 databaseCode: M~E dateStart: 20200101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre  | 
    
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LbxMxEB5BegAOQHmIQFv5wIGH9mGvd705hoqqQpBySKRwWvykUZPdqJuIwK-vZ-OUIsQBbivLa2v382M-j-cbgJdUU8m5pyXGplnElaORTKmOSuO3oxzVRixGI38aFacT_mGaT3d5TpNEa5QuRQ9-vJbJbOHnVJuYRrfJMNwTQ7bOkqVcegrPWEUrTwyNuw17hW857cHeZPR5-AVTyokUFb27BMjhmU63fs2MMzZIdoWbmLHYU8XfdqZOwP8e3FnXS_nju5zPb-w6Jw_g6y52Z3vZ5CJer1Ssf_4p5fi_H_QQ7geLlISK-3DL1o9gP8z5lrwKwtSvH8P5WU1u6HI0NWkcGclOuYMM59-ay9nqfNESWRsyRgcEwdVmbjdk-MtNTryVTM78QrUIEaDYyMcuDmmmWzKW7UX7BCYn78fHp1HI1BBptBgip7UzpsyKIlWsEIJqIzzxYs5xPHYu82JglDV8YJ2lqcsFtblymZV-jXPCDbKn0Kub2j4Dwg2zsvAvcal5ymWZy4Ipp5Sgytt6tA9vdihVy60gR-WJTAdphZBWiHP4k314hzheV0Qt7a7A41GFqVlJa10qVG7R9DJZXgopc1sKFKOzjss-vL0eBX_vchO6fP5PtV_AXYR_ewHxAHqry7U99FbOSh11pwNHYTxfAbyc-kQ | 
    
| linkProvider | Unpaywall | 
    
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LbxMxELYgPQAHSnmIQEE-cOChfdjrXW-OaUVVIUg5JFI4LeNXGzXZjbqJCPx6PBunFCEOcFtZXlu7nx_zeTzfEPKKaQZCeFpibJpFQjkWQcp0VBq_HeWoNmIxGvnTqDidiA_TfLrLc5okWqN0KXrw4zUks4WfU21iGt0mw3BPDNk6T5aw9BSe84pVnhgad5vsFb7ltEf2JqPPwy-YUk6mqOjdJUAOz2y69WtmgvNBsivcxJzHnir-tjN1Av73yJ11vYTv32A-v7HrnOyTr7vYne1lk8t4vVKx_vGnlOP_ftADcj9YpDRUPCC3bP2QHIQ539LXQZj6zSNycVbTG7ocTU0bR0fQKXfQ4fy8uZqtLhYthdrQMTogKK42c7uhw19ucuqtZHrmF6pFiADFRj52cUgz3dIxtJftYzI5eT8-Po1CpoZIo8UQOa2dMWVWFKnihZRMG-mJF3dO4LFzmRcDo6wRA-ssS10umc2Vyyz4Nc5JN8iekF7d1PYpocJwC4V_SYAWqYAyh4Irp5Rkytt6rE_e7lCqlltBjsoTmQ7SCiGtEOfwJ_vkCHG8roha2l2Bx6MKU7MCa10qVW7R9DJZXkqA3JYSxeisE9An765Hwd-73IQun_1T7efkLsK_vYB4SHqrq7V94a2clXoZRvJP5HX5Tw | 
    
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+Investigation+of+Natural+Algorithms+and+Their+Complex+Application+for+Optimization+of+Logistics+Tasks&rft.jtitle=K%C3%ACbernetika+ta+komp%27%C3%BBtern%C3%AC+tehnolog%C3%AC%C3%AF+%28Online%29&rft.au=Victor+Andriichuk&rft.au=Violeta+Tretynyk&rft.date=2022-06-30&rft.pub=V.M.+Glushkov+Institute+of+Cybernetics&rft.issn=2707-4501&rft.eissn=2707-451X&rft.issue=1&rft.spage=11&rft.epage=18&rft_id=info:doi/10.34229%2F2707-451X.22.1.2&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_aeef07b5e3554d3587aa5e872142ef4a | 
    
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2707-4501&client=summon | 
    
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2707-4501&client=summon | 
    
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2707-4501&client=summon |