<doi_batch xmlns="http://www.crossref.org/schema/4.4.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" version="4.4.0"><head><doi_batch_id>b63998f5-e989-48e9-be96-9aff5e967b74</doi_batch_id><timestamp>20250402051311216</timestamp><depositor><depositor_name>wseas:wseas</depositor_name><email_address>mdt@crossref.org</email_address></depositor><registrant>MDT Deposit</registrant></head><body><journal><journal_metadata language="en"><full_title>WSEAS TRANSACTIONS ON COMPUTER RESEARCH</full_title><issn media_type="electronic">2415-1521</issn><issn media_type="print">1991-8755</issn><archive_locations><archive name="Portico"/></archive_locations><doi_data><doi>10.37394/232018</doi><resource>http://wseas.org/wseas/cms.action?id=13372</resource></doi_data></journal_metadata><journal_issue><publication_date media_type="online"><month>1</month><day>10</day><year>2025</year></publication_date><publication_date media_type="print"><month>1</month><day>10</day><year>2025</year></publication_date><journal_volume><volume>13</volume><doi_data><doi>10.37394/232018.2025.13</doi><resource>https://wseas.com/journals/cr/2025.php</resource></doi_data></journal_volume></journal_issue><journal_article language="en"><titles><title>Software Implementation of Genetic Algorithm for Optimization of Cargo Placement in the Conditions of limited Warehouse Space</title></titles><contributors><person_name sequence="first" contributor_role="author"><given_name>Natalia</given_name><surname>Mamedova</surname><affiliation>Basic Department of Digital Economy, Plekhanov Russian University of Economics, 36, Stremyanny Lane, Moscow, 117997, RUSSIA</affiliation></person_name><person_name sequence="additional" contributor_role="author"><given_name>Yulia</given_name><surname>Khizhnyakova</surname><affiliation>Development Department, LAS LLC, 14k1, Murmansk passage, Moscow, 129075, RUSSIA</affiliation></person_name></contributors><jats:abstract xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1"><jats:p>In this paper, we propose a software implementation to solve the mathematical problem of optimal placement of cargo units on the territory of a multimodal transport and logistics center. Warehouse management in intermodal and multimodal transportation is complicated by the problem of selecting an assortment of cargo in conditions of limited storage space. The solution to this problem should be mathematically correct, automatizable, and scalable, since different types of warehouses and different transport systems are concentrated in the territory of multimodal transport and logistics centers. We propose to apply the genetic algorithm as a mathematical apparatus for solving the above problem and a ready-made software implementation for the optimal placement of cargo units. The algorithm determines the optimal subset of cargo units that can be placed in the warehouse taking into account the weight and value priority constraints of the selected cargo units.</jats:p></jats:abstract><publication_date media_type="online"><month>4</month><day>2</day><year>2025</year></publication_date><publication_date media_type="print"><month>4</month><day>2</day><year>2025</year></publication_date><pages><first_page>245</first_page><last_page>258</last_page></pages><publisher_item><item_number item_number_type="article_number">23</item_number></publisher_item><ai:program xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" name="AccessIndicators"><ai:free_to_read start_date="2025-04-02"/><ai:license_ref applies_to="am" start_date="2025-04-02">https://wseas.com/journals/cr/2025/a465118-341.pdf</ai:license_ref></ai:program><archive_locations><archive name="Portico"/></archive_locations><doi_data><doi>10.37394/232018.2025.13.23</doi><resource>https://wseas.com/journals/cr/2025/a465118-341.pdf</resource></doi_data><citation_list><citation key="ref0"><doi>10.1016/j.jer.2023.10.033</doi><unstructured_citation>Sun J., Wang R., Multi-objective optimization of a sustainable two echelon vehicle routing problem with simultaneous pickup and delivery in construction projects, Journal of Engineering Research, In Press, 2023, https://doi.org/10.1016/j.jer.2023.10.033. </unstructured_citation></citation><citation key="ref1"><doi>10.1016/j.cie.2021.107747</doi><unstructured_citation>Liu W., Zhou Y., Liu W., Qiu J., Xie N., Chang X., Chen J., A hybrid ACS-VTM algorithm for the vehicle routing problem with simultaneous delivery &amp; pickup and realtime traffic condition, Computers &amp; Industrial Engineering, Vol. 162, 107747, 2021, https://doi.org/10.1016/j.cie.2021.107747. </unstructured_citation></citation><citation key="ref2"><doi>10.1016/j.cor.2023.106467</doi><unstructured_citation>Praxedes R., Bulhões T., Subramanian A., Uchoa E., A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery, Computers &amp; Operations Research, Vol. 162, 106467, 2024, https://doi.org/10.1016/j.cor.2023.106467. </unstructured_citation></citation><citation key="ref3"><doi>10.1016/j.swevo.2021.100927</doi><unstructured_citation>Liu S., Tang K., Yao X., Memetic search for vehicle routing with simultaneous pickupdelivery and time windows, Swarm and Evolutionary Computation, Vol. 66, 100927, 2021, https://doi.org/10.1016/j.swevo.2021.10092 7. </unstructured_citation></citation><citation key="ref4"><doi>10.1016/j.procs.2019.01.112</doi><unstructured_citation>Grabusts P., Musatovs J., Golenkov V., The application of simulated annealing method for optimal route detection between objects, Procedia Computer Science, Vol. 149, pp.95-101, 2019, https://doi.org/10.1016/j.procs.2019.01.112. </unstructured_citation></citation><citation key="ref5"><doi>10.1016/j.knosys.2024.112160</doi><unstructured_citation>Ergüven E., Polat F., Relative distances approach for multi-traveling salesmen problem, Knowledge-Based Systems, Vol. 300, 112160, 2024, https://doi.org/10.1016/j.knosys.2024.1121. </unstructured_citation></citation><citation key="ref6"><doi>10.1016/j.engappai.2023.106351</doi><unstructured_citation>Roy A., Maity S., Moon I., Multi-vehicle clustered traveling purchaser problem using a variable-length genetic algorithm, Engineering Applications of Artificial Intelligence, Vol. 123, Part B, 106351, 2023, https://doi.org/10.1016/j.engappai.2023.1063 51. </unstructured_citation></citation><citation key="ref7"><doi>10.1016/j.tre.2015.02.009</doi><unstructured_citation>Yu Y., Machemehl R.B., Xie Ch., Demandresponsive transit circulator service network design, Transportation Research Part E: Logistics and Transportation Review, Vol. 76, pp.160-175, 2015, https://doi.org/10.1016/j.tre.2015.02.009. </unstructured_citation></citation><citation key="ref8"><doi>10.1016/s0377-2217(99)00018-1</doi><unstructured_citation>Kerbache L., Smith J.MacG., Multiobjective routing within large scale facilities using open finite queueing networks, European Journal of Operational Research, Vol. 121, Issue 1, pp.105-123, 2000, https://doi.org/10.1016/S0377- 2217(99)00018-1. </unstructured_citation></citation><citation key="ref9"><unstructured_citation>Prokofieva T.A., Multimodal transport and logistics centers as strategic points of growth of the Russian economy, Part 1, In Center of Economics, no. 2, pp. 10-19, 2021. </unstructured_citation></citation><citation key="ref10"><doi>10.1016/s0142-0615(97)00070-7</doi><unstructured_citation>Park Y.M., Park J.B., Won J.R., A hybrid genetic algorithm/dynamicprogramming approach to optimal long-term generation expansion planning, International Journal of Electrical Power &amp; Energy Systems, Volume 20, Issue 4, 1998, pp.295- 303, https://doi.org/10.1016/S0142- 0615(97)00070-7. </unstructured_citation></citation><citation key="ref11"><doi>10.1016/s1364-8152(96)00030-8</doi><unstructured_citation>Wang Q.J., Using genetic algorithms to optimise model parameters, Environmental Modelling &amp; Software, Vol. 12, Issue 1, 1997, pp.27-34, https://doi.org/10.1016/S1364- 8152(96)00030-8. </unstructured_citation></citation><citation key="ref12"><doi>10.1016/j.proeng.2011.08.278</doi><unstructured_citation>Chen J., Zhang Ch., Efficient Clustering Method Based on Rough Set and Genetic Algorithm, Procedia Engineering, Vol.15, 2011, pp.1498-1503, https://doi.org/10.1016/j.proeng.2011.08.27 8. </unstructured_citation></citation><citation key="ref13"><unstructured_citation>Kochenderfer M. J., Wheeler T. A., Algorithms for Optimization, MIT Press, 2019. </unstructured_citation></citation><citation key="ref14"><doi>10.1016/b978-1-55860-356-1.50016-9</doi><unstructured_citation>Horn J., Goldberg D. E., Genetic Algorithm Difficulty and the Modality of Fitness Landscapes, Foundations of Genetic Algorithms, Elsevier, Vol. 3, 1995, pp. 243- 269, https://doi.org/10.1016/B978-1- 55860- 356-1.50016-9. </unstructured_citation></citation><citation key="ref15"><unstructured_citation>Kohenderfer M., Wheeler T., Ray K. Algorithms for decision making / transl. from Engl. V. S. Yatsenkov, Moscow, DMK Press, p.684, 2023. </unstructured_citation></citation><citation key="ref16"><doi>10.1007/978-1-4684-2001-2_9</doi><unstructured_citation>Karp R. M., Reducibility among Combinatorial Problems, In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds) Complexity of Computer Computations, The IBM Research Symposia Series, Springer, Boston, MA, 1972, https://doi.org/10.1007/978-1-4684-2001- 2_9. </unstructured_citation></citation><citation key="ref17"><doi>10.1016/j.ins.2020.08.040</doi><unstructured_citation>D’Angelo G., Palmieri F., GGA: A modified genetic algorithm with gradient-based local search for solving constrained optimization problems, Information Sciences, Vol. 547, 2021, pp.136-162, https://doi.org/10.1016/j.ins.2020.08.040. </unstructured_citation></citation><citation key="ref18"><doi>10.1016/j.eswa.2017.08.018</doi><unstructured_citation>Dao S. D., Abhary K., Marian R., An innovative framework for designing genetic algorithm structures, Expert Systems with Applications, Vol. 90, 2017, pp.196- 208, https://doi.org/10.1016/j.eswa.2017.08.018. </unstructured_citation></citation><citation key="ref19"><doi>10.1016/j.jestch.2016.10.012</doi><unstructured_citation>Mahmoodabadi M.J., Nemati A.R., A novel adaptive genetic algorithm for global optimization of mathematical test functions and real-world problems, Engineering Science and Technology, an International Journal, Vol. 19, Issue 4, 2016, pp. 2002- 2021, https://doi.org/10.1016/j.jestch.2016.10.012. </unstructured_citation></citation><citation key="ref20"><unstructured_citation>Martello S., Toth P., Knapsack problems: algorithms and computer implementations. John Wiley &amp; Sons, Inc., USA, 296 p., 1990. </unstructured_citation></citation><citation key="ref21"><doi>10.1007/978-3-030-96935-6_4</doi><unstructured_citation>Wilbaut C., Hanafi S., Coelho I.M., Lucena A., The Knapsack Problem and Its Variants: Formulations and Solution Methods. In: Salhi, S., Boylan, J. (eds) The Palgrave Handbook of Operations Research, Palgrave Macmillan, Cham, pp 105-151, 2022, https://doi.org/10.1007/978-3-030-96935-6_4. </unstructured_citation></citation><citation key="ref22"><unstructured_citation>Reeves C.R., Genetic Algorithms. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems, Springer, Boston, MA, 2009, https://doi.org/10.1007/978-0- 387-39940- 9_562. </unstructured_citation></citation><citation key="ref23"><doi>10.1007/978-1-4684-8941-5</doi><unstructured_citation>Holland J.H., Genetic Algorithms and Adaptation. In: Selfridge, O.G., Rissland, E.L., Arbib, M.A. (eds) Adaptive Control of Ill-Defined Systems, NATO Conference Series, vol 16, Springer, Boston, MA, 1984, https://doi.org/10.1007/978-1- 4684-8941- 5_21. </unstructured_citation></citation><citation key="ref24"><doi>10.1016/j.engappai.2008.10.012</doi><unstructured_citation>Hnaien F., Delorme X., Dolgui A., Genetic algorithm for supply planning in two-level assembly systems with random lead times, Engineering Applications of Artificial Intelligence, Vol. 22, Issue 6, Pages 906- 915, 2009, https://doi.org/10.1016/j.engappai.2008.10.01 2.</unstructured_citation></citation></citation_list></journal_article></journal></body></doi_batch>