Комплексний алгоритм для системи програмного обслуговування логістики гуманітарних послуг
| dc.citation.epage | 88 | |
| dc.citation.issue | 1 | |
| dc.citation.journalTitle | Комп'ютерні системи та мережі | |
| dc.citation.spage | 79 | |
| dc.citation.volume | 5 | |
| dc.contributor.affiliation | Національний університет “Львівська політехніка” | |
| dc.contributor.affiliation | Lviv Polytechnic National University | |
| dc.contributor.author | Обшта, А. Ф. | |
| dc.contributor.author | Бугаєць, В. В. | |
| dc.contributor.author | Obshta, A. | |
| dc.contributor.author | Buhaiets, V. | |
| dc.coverage.placename | Львів | |
| dc.coverage.placename | Lviv | |
| dc.date.accessioned | 2025-07-23T09:11:16Z | |
| dc.date.created | 2023-02-28 | |
| dc.date.issued | 2023-02-28 | |
| dc.description.abstract | Розглянуто проблему проєктування кросплатформної системи програмного обслуговування логістики гуманітарних послуг. Розглянуто програмні аналоги міжнародних поставок. Наведено порівняння популярних програмних продуктів у сфері міжнародної торгівлі. Оглянуто технології для розроблення програмного обслуговування для забезпечення кросплатформності системи для логістики гуманітарних послуг. Наведено алгоритми, використовувані у системі для розв’язування транспортної задачі, а саме задачі маршрутизації. за допомогою яких вибирають найоптимальніший шлях між пунктами постачання. Запропоновано загальний алгоритм роботи системи та наведено структурну схему аплікації. | |
| dc.description.abstract | The problem of designing a cross-platform software system for the logistics of humanitarian services is considered. Existing software analogs of international deliveries are considered. A comparison of popular software products in the field of international trade is given. The technologies for developing software services to ensure the cross-platform system for the logistics of humanitarian services are reviewed. The algorithms used in the system for solving the transportation problem, namely the routing problem, are presented, with the help of which the most optimal path between the supply points is selected. The general algorithm of the system operation is proposed and the structural diagram of the application is presented. | |
| dc.format.extent | 79-88 | |
| dc.format.pages | 10 | |
| dc.identifier.citation | Обшта А. Ф. Комплексний алгоритм для системи програмного обслуговування логістики гуманітарних послуг / А. Ф. Обшта, В. В. Бугаєць // Комп'ютерні системи та мережі. — Львів : Видавництво Львівської політехніки, 2023. — Том 5. — № 1. — С. 79–88. | |
| dc.identifier.citationen | Obshta A. Cross-platform software system for the logistics of humanitarian services / A. Obshta, V. Buhaiets // Computer Systems and Networks. — Lviv : Lviv Politechnic Publishing House, 2023. — Vol 5. — No 1. — P. 79–88. | |
| dc.identifier.doi | doi.org/10.23939/csn2023.01.079 | |
| dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/111644 | |
| dc.language.iso | uk | |
| dc.publisher | Видавництво Львівської політехніки | |
| dc.publisher | Lviv Politechnic Publishing House | |
| dc.relation.ispartof | Комп'ютерні системи та мережі, 1 (5), 2023 | |
| dc.relation.ispartof | Computer Systems and Networks, 1 (5), 2023 | |
| dc.relation.references | 1. Bloch, J. (2018). Effective Java: A Tutorial. 3rd ed. Upper Saddle River, NJ: Addison-Wesley. 901 p. DOI: 10.1145/2185359.2185361. | |
| dc.relation.references | 2. Walls, C. (2018). Spring in Action: A Tutorial. Shelter Island, NY: Manning Publications Co. 500 p. DOI: 10.1145/3174280.3174282. | |
| dc.relation.references | 3. Chen, C., Xu, Y., Chen, X., Luo, X., & Wang, W. (2021). Java Virtual Machine: A Survey. ACM Computing Surveys, 54(3), 1–38. DOI: 10.1145/3456553. | |
| dc.relation.references | 4. Al-Khayyal, M. A., Birch, D. M. T., & Hassan, M. B. M. E. (2014). A review of truck dispatching problems and solution approaches. Transportation Research Part B: Methodological, 66, 1–34. DOI: 10.1016/j.trb.2014.07.002. | |
| dc.relation.references | 5. Olli Bräysy and Michel Gendreau. (2005). Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science, 39(1):104–118. DOI: 10.1287/trsc.1030.0056 | |
| dc.relation.references | 6. Gendreau, M., Laporte, G., & Séguin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88(1), 3–12. DOI: 10.1016/0377-2217(95)00090-3. | |
| dc.relation.references | 7. Shmoys, D. B., & Tardos, É. (2000). Network flows and graph algorithms. In Handbook of Discrete and Computational Geometry, 609–655. CRC Press. DOI: 10.1007/3-540-36484-0_19. | |
| dc.relation.references | 8. Simonis, H. (2006). Constraint applications in networks. In F. Rossi, P. van Beek, & T. Walsh (Eds.), Handbook of Constraint Programming, Vol. 2, 875–903. Elsevier. DOI: 10.1016/S1361-8608(05)00062- | |
| dc.relation.references | 9. Dechter, R. (2003). Constraint processing. Morgan Kaufmann. DOI: 10.1016/B978-1-55860-890-X5000-2. | |
| dc.relation.references | 10. Carsten. J. Drexl, A. (1995). A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence Dependent Setups. ORSA Journal on computing, 7(2):160–165. DOI: 10.1287/ijoc.7.2.160 | |
| dc.relation.references | 11. Holub, P., Liška, M., Rudová, H., & Troubil, P. (2010). “Comparison of CP and IP Techniques for Data Transfer Planning”. In 28th Workshop of the UK Special Interest Group on Planning and Scheduling, 69–70. ISBN 978-88-904924-1-9 | |
| dc.relation.references | 12. Dantzig, G. B. (1951). Maximization of a linear function of variables subject to linear inequalities. In T. C. Koopmans (Ed.), Activity Analysis of Production and Allocation, 339-347. Wiley & Chapman-Hall. ISBN: 978-0471387594. | |
| dc.relation.references | 13. Achterberg, T. (2007). “Constraint Integer Programming”. Doctoral thesis, Technische Universität Berlin. DOI: 10.1007/978-3-540-68155-7. | |
| dc.relation.references | 14. Fowler, M. (2014). SOLID Principles: An Introduction. MartinFowler.com. DOI: 10.1145/2531701.2531703. | |
| dc.relation.references | 15. Freeman, E., Robson, E., Bates, B., & Sierra, K. (2014). Head First Design Patterns (1st ed.). O’Reilly. 867 p. ISBN: 978-0-596-00712-4. | |
| dc.relation.references | 16. Achterberg, T., Berthold, T., Koch, T., & Wolter, K. (2008). “Constraint Integer Programming: A New Approach to Integrate CP and MIP”. In: “Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems”, Vol. 01, 6–20. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-540-68155-7_4. | |
| dc.relation.references | 17. Perron, L. (2011). “Operations Research and Constraint Programming at Google." In: "Principles and Practice of Constraint Programming – CP 2011”, p. 2. Publisher: Springer, Berlin Heidelberg. DOI: 10.1007/978-3-642-23786-7_1 | |
| dc.relation.references | 18. Mittelmann, H. (2014). Mixed Integer Linear Programming Benchmark (MIPLIB2010). [online] Available at: http://plato.asu.edu/ftp/milpc.html. | |
| dc.relation.references | 19. Tuláček, M. (2014). Algorithms for automated logistics. Bc. Michal Tuláček Algorithms for automated logistics. http://www.tulacek.eu/mgr_thesis/thesis.pdf. DOI: 10.1145/2531701.2531703. | |
| dc.relation.references | 20. Molodid, O. K. (2018). The transportation problem. (Electronic resource). Kyiv, Ukraine: Igor Sikorsky Kyiv Polytechnic Institute. DOI: 10.13140/RG.2.2.27260.79842 | |
| dc.relation.references | 21. Podotyaka, O. O., & Podotyaka, O. M. (2021). Solving a bicriteria transportation problem based on block normalization of criteria. Bulletin of Kharkiv National Automobile and Highway University, 92(1), 60. DOI:10.30977/BUL.2219-5548.2021.92.1.60 | |
| dc.relation.referencesen | 1. Bloch, J. (2018). Effective Java: A Tutorial. 3rd ed. Upper Saddle River, NJ: Addison-Wesley. 901 p. DOI: 10.1145/2185359.2185361. | |
| dc.relation.referencesen | 2. Walls, C. (2018). Spring in Action: A Tutorial. Shelter Island, NY: Manning Publications Co. 500 p. DOI: 10.1145/3174280.3174282. | |
| dc.relation.referencesen | 3. Chen, C., Xu, Y., Chen, X., Luo, X., & Wang, W. (2021). Java Virtual Machine: A Survey. ACM Computing Surveys, 54(3), 1–38. DOI: 10.1145/3456553. | |
| dc.relation.referencesen | 4. Al-Khayyal, M. A., Birch, D. M. T., & Hassan, M. B. M. E. (2014). A review of truck dispatching problems and solution approaches. Transportation Research Part B: Methodological, 66, 1–34. DOI: 10.1016/j.trb.2014.07.002. | |
| dc.relation.referencesen | 5. Olli Bräysy and Michel Gendreau. (2005). Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science, 39(1):104–118. DOI: 10.1287/trsc.1030.0056 | |
| dc.relation.referencesen | 6. Gendreau, M., Laporte, G., & Séguin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88(1), 3–12. DOI: 10.1016/0377-2217(95)00090-3. | |
| dc.relation.referencesen | 7. Shmoys, D. B., & Tardos, É. (2000). Network flows and graph algorithms. In Handbook of Discrete and Computational Geometry, 609–655. CRC Press. DOI: 10.1007/3-540-36484-0_19. | |
| dc.relation.referencesen | 8. Simonis, H. (2006). Constraint applications in networks. In F. Rossi, P. van Beek, & T. Walsh (Eds.), Handbook of Constraint Programming, Vol. 2, 875–903. Elsevier. DOI: 10.1016/S1361-8608(05)00062- | |
| dc.relation.referencesen | 9. Dechter, R. (2003). Constraint processing. Morgan Kaufmann. DOI: 10.1016/B978-1-55860-890-X5000-2. | |
| dc.relation.referencesen | 10. Carsten. J. Drexl, A. (1995). A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence Dependent Setups. ORSA Journal on computing, 7(2):160–165. DOI: 10.1287/ijoc.7.2.160 | |
| dc.relation.referencesen | 11. Holub, P., Liška, M., Rudová, H., & Troubil, P. (2010). "Comparison of CP and IP Techniques for Data Transfer Planning". In 28th Workshop of the UK Special Interest Group on Planning and Scheduling, 69–70. ISBN 978-88-904924-1-9 | |
| dc.relation.referencesen | 12. Dantzig, G. B. (1951). Maximization of a linear function of variables subject to linear inequalities. In T. C. Koopmans (Ed.), Activity Analysis of Production and Allocation, 339-347. Wiley & Chapman-Hall. ISBN: 978-0471387594. | |
| dc.relation.referencesen | 13. Achterberg, T. (2007). "Constraint Integer Programming". Doctoral thesis, Technische Universität Berlin. DOI: 10.1007/978-3-540-68155-7. | |
| dc.relation.referencesen | 14. Fowler, M. (2014). SOLID Principles: An Introduction. MartinFowler.com. DOI: 10.1145/2531701.2531703. | |
| dc.relation.referencesen | 15. Freeman, E., Robson, E., Bates, B., & Sierra, K. (2014). Head First Design Patterns (1st ed.). O’Reilly. 867 p. ISBN: 978-0-596-00712-4. | |
| dc.relation.referencesen | 16. Achterberg, T., Berthold, T., Koch, T., & Wolter, K. (2008). "Constraint Integer Programming: A New Approach to Integrate CP and MIP". In: "Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems", Vol. 01, 6–20. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-540-68155-7_4. | |
| dc.relation.referencesen | 17. Perron, L. (2011). "Operations Research and Constraint Programming at Google." In: "Principles and Practice of Constraint Programming – CP 2011", p. 2. Publisher: Springer, Berlin Heidelberg. DOI: 10.1007/978-3-642-23786-7_1 | |
| dc.relation.referencesen | 18. Mittelmann, H. (2014). Mixed Integer Linear Programming Benchmark (MIPLIB2010). [online] Available at: http://plato.asu.edu/ftp/milpc.html. | |
| dc.relation.referencesen | 19. Tuláček, M. (2014). Algorithms for automated logistics. Bc. Michal Tuláček Algorithms for automated logistics. http://www.tulacek.eu/mgr_thesis/thesis.pdf. DOI: 10.1145/2531701.2531703. | |
| dc.relation.referencesen | 20. Molodid, O. K. (2018). The transportation problem. (Electronic resource). Kyiv, Ukraine: Igor Sikorsky Kyiv Polytechnic Institute. DOI: 10.13140/RG.2.2.27260.79842 | |
| dc.relation.referencesen | 21. Podotyaka, O. O., & Podotyaka, O. M. (2021). Solving a bicriteria transportation problem based on block normalization of criteria. Bulletin of Kharkiv National Automobile and Highway University, 92(1), 60. DOI:10.30977/BUL.2219-5548.2021.92.1.60 | |
| dc.relation.uri | http://plato.asu.edu/ftp/milpc.html | |
| dc.relation.uri | http://www.tulacek.eu/mgr_thesis/thesis.pdf | |
| dc.rights.holder | © Національний університет “Львівська політехніка”, 2023 | |
| dc.rights.holder | © Обшта А. Ф., Бугаєць В. В., 2023 | |
| dc.subject | кросплатформність | |
| dc.subject | програмне обслуговування | |
| dc.subject | логістика | |
| dc.subject | алгоритм | |
| dc.subject | аплікація | |
| dc.subject | cross-platform | |
| dc.subject | software service | |
| dc.subject | logistics | |
| dc.subject | algorithm | |
| dc.subject | application | |
| dc.subject.udc | 004.4 | |
| dc.title | Комплексний алгоритм для системи програмного обслуговування логістики гуманітарних послуг | |
| dc.title.alternative | Cross-platform software system for the logistics of humanitarian services | |
| dc.type | Article |
Files
License bundle
1 - 1 of 1