<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Artificial Intelligence-Driven Cargo Optimization Service for Logistics</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Solomiia</forename><surname>Fedushko</surname></persName>
							<email>solomiia.s.fedushko@lpnu.ua</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Information Management and Business Systems</orgName>
								<orgName type="department" key="dep2">Faculty of Management</orgName>
								<orgName type="institution">Comenius University Bratislava</orgName>
								<address>
									<addrLine>Odbojárov 10</addrLine>
									<postCode>820 05</postCode>
									<settlement>Bratislava</settlement>
									<country key="SK">Slovakia</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Yuriy</forename><surname>Syerov</surname></persName>
							<email>yurii.o.sierov@lpnu.ua</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Information Management and Business Systems</orgName>
								<orgName type="department" key="dep2">Faculty of Management</orgName>
								<orgName type="institution">Comenius University Bratislava</orgName>
								<address>
									<addrLine>Odbojárov 10</addrLine>
									<postCode>820 05</postCode>
									<settlement>Bratislava</settlement>
									<country key="SK">Slovakia</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department">Social Communication and Information Activity Department</orgName>
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>Bandera 12</addrLine>
									<postCode>79000</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Michal</forename><surname>Gregus</surname></persName>
							<email>michal.gregus@fm.uniba.sk</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Information Management and Business Systems</orgName>
								<orgName type="department" key="dep2">Faculty of Management</orgName>
								<orgName type="institution">Comenius University Bratislava</orgName>
								<address>
									<addrLine>Odbojárov 10</addrLine>
									<postCode>820 05</postCode>
									<settlement>Bratislava</settlement>
									<country key="SK">Slovakia</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Artificial Intelligence-Driven Cargo Optimization Service for Logistics</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">8577630A756FA50807A829E89127FE75</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T16:25+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Artificial intelligence, cargo optimization, logistics, particle swarm optimization, freight forwarding 1 0000-0001-7548-5856 (S. Fedushko)</term>
					<term>0000-0002-5293-4791 (Yu. Syerov)</term>
					<term>0000-0002-8156-8962 (M. Gregus)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The development of forwarding services is becoming more and more dynamic every day. Observing this trend, we should look for solutions that will provide customers with comfort, speed, and quality of service. This article introduced an intelligent forwarder model that runs as a web application. The solution model and methods used to implement the system and the algorithm that uses elements of artificial intelligence are presented. In logistics, a freight forwarder is a nonvessel operating common carrier that helps coordinate shipments and ensure the smooth transportation of goods from producers or manufacturers to end-users, markets, or final distribution points for corporations or individuals. Software that is based on artificial intelligence can make the forwarder's work more effective. The particle swarm optimization algorithm is a heuristic optimization method inspired by the collective behavior of social agents observed in nature, such as bird flocking, bee swarming, and fish schooling. In this paper, we propose a Cargo Optimizer service that is an expert system supporting determining the most profitable sets of orders using AI -more precisely, it will be the particle swarm optimization algorithm. In the scope of these tests, we did some actions on the level of the graphical user interface to test the connectivity of the whole system. Tests prevent unexpected operations and make the system safe and optimal. The comparison will consist of comparing the algorithms in terms of speed and quality of the data obtained.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Logistics <ref type="bibr" target="#b0">[1]</ref> is currently one of the fastest-growing industries. It involves planning and implementing the flow of products from the point of production to the point of sale or consumption. Freight forwarders coordinate the supply chain so that cargo is transported optimally. They find employment in many areas of the economy, including trade, services, and shipping. It is a very responsible job, with no room for error. In a situation where such a mistake occurs, it can be very costly for the shipping company <ref type="bibr" target="#b1">[2,</ref><ref type="bibr" target="#b2">3]</ref>. Many transport companies are regularly established around the world. They are entering any city where the squares are a typical sight. However, it is not only the domain of cities because in the surrounding areas, and even in many smaller towns, the view of various transport companies is seen, not to mention the hundreds of trucks encountered on the roads daily. Regarding shipping companies, the increase in their number results from the demand for shipping services. If a given country's economy is developing at a fast pace, the consequence of this is an increasing number of production plants and warehouses. It is connected with the need to transport the goods they produce to various destinations, both within and outside of this country <ref type="bibr" target="#b3">[4]</ref>. The IT industry has a more substantial impact on shipping services every day.</p><p>Programmers create software <ref type="bibr" target="#b4">[5]</ref> that allows you to replace the activities that the forwarder does daily. Among other things, software based on artificial intelligence can make the forwarder's work more effective. In computer science <ref type="bibr" target="#b5">[6]</ref><ref type="bibr" target="#b6">[7]</ref><ref type="bibr" target="#b7">[8]</ref>, artificial intelligence (AI) <ref type="bibr" target="#b8">[9]</ref><ref type="bibr" target="#b9">[10]</ref><ref type="bibr" target="#b10">[11]</ref> represents a significant area of exploration. Its focus lies in developing computer systems capable of emulating human-like cognitive processes, including learning, reasoning, and self-correction.</p><p>An Application Programming Interface (API) <ref type="bibr" target="#b11">[12]</ref> serves as a software intermediary that facilitates communication between two applications. Traditionally, a freight forwarder <ref type="bibr" target="#b12">[13]</ref><ref type="bibr" target="#b13">[14]</ref><ref type="bibr" target="#b14">[15]</ref><ref type="bibr" target="#b15">[16]</ref> acts as an intermediary connecting shippers or importers with carriers. In a broader context, a freight forwarder, also known as a nonvessel operating common carrier, assists in coordinating shipments and ensuring the smooth transportation of goods from producers or manufacturers to end-users, markets, or final distribution points for corporations or individuals.</p><p>The Knapsack problem <ref type="bibr" target="#b16">[17]</ref> involves optimizing the packing of a knapsack with integer volume F using objects from K different classes to maximize profit. Objects from class k, where k = 1, ..., K, consume integer units of knapsack volume and produce a profit rk. If the volume of the knapsack F is an integer multiple of the volumes bk, k = 1, ..., K, a straightforward solution is to fill the knapsack with objects from the class k with the highest profit-to-volume ratio rk/bk. Dynamic programming can address cases where the knapsack volume ratio is not an integer multiple of object volumes with a time complexity of O(FK).</p><p>The particle swarm optimization algorithm (PSO) <ref type="bibr" target="#b17">[18]</ref> is a heuristic optimization method inspired by the collective behavior of social agents observed in nature, such as bird flocking, bee swarming, and fish schooling. The freight market <ref type="bibr" target="#b18">[19]</ref> serves as the nexus where buyers and sellers of shipping services converge to negotiate deals. Various categorizations can be applied to this marketplace.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related Work</head><p>The optimization of cargo logistics through artificial intelligence (AI) has drawn inspiration from various swarm intelligence models and collective decision-making mechanisms observed in natural systems. A diverse range of studies has explored the application of swarm-based algorithms in different contexts, providing valuable insights into the potential enhancements achievable through mimicking biological phenomena.</p><p>Okubo's seminal work <ref type="bibr" target="#b19">[20]</ref> delves into the dynamic aspects of animal grouping, shedding light on swarms, schools, flocks, and herds. Although focused on biological systems, the principles of self-organization and coordinated behavior in groups offer conceptual foundations applicable to artificial systems, especially in optimizing logistics operations.</p><p>Schumann <ref type="bibr" target="#b20">[21]</ref> extends this perspective by exploring the transition from swarm simulations to swarm intelligence. This transition highlights the relevance of understanding collective behaviors and adaptive strategies exhibited by swarms, paving the way for informed design choices in AI-driven cargo optimization services.</p><p>Karaboga et al. <ref type="bibr" target="#b21">[22]</ref> present a comprehensive survey of the artificial bee colony (ABC) algorithm, showcasing its potential applications. While the ABC algorithm is rooted in the foraging behavior of honeybees, its adaptability and efficiency have inspired applications in optimization problems, including those encountered in logistics.</p><p>Ventocilla's work <ref type="bibr" target="#b22">[23]</ref> introduces a swarm-based approach to area exploration and coverage inspired by pheromones and bird flocks. This research provides valuable insights into decentralized decision-making mechanisms that can be harnessed for efficient logistics resource allocation and route planning.</p><p>Pourpanah et al. <ref type="bibr" target="#b23">[24]</ref> comprehensively review artificial fish swarm algorithms, emphasizing recent advances and practical applications. The piscine-inspired algorithms offer novel perspectives for optimizing cargo routing and resource allocation in logistics scenarios.</p><p>Bakar <ref type="bibr" target="#b24">[25]</ref> explores the understanding of collective decision-making in natural swarm systems, presenting applications and challenges. This work contributes to the theoretical foundations of swarm intelligence, offering a deeper comprehension of decision-making processes that can inform the design of AI-driven cargo optimization services.</p><p>The literature further includes contributions from Sadiku and Musa <ref type="bibr" target="#b25">[26]</ref>, Li and Clerc <ref type="bibr" target="#b26">[27]</ref>, and Zhang et al. <ref type="bibr" target="#b27">[28]</ref>, offering insights into multiple intelligences, swarm intelligence handbooks, and applications in various domains. These works provide a rich background for integrating swarm intelligence principles into AI-driven cargo optimization.</p><p>Finally, Abidin et al. <ref type="bibr" target="#b28">[29]</ref> introduce swarming robotics and discuss emerging trends in application development. This work broadens the scope of swarm intelligence, suggesting potential synergies between AI-driven cargo optimization and robotic swarm systems for efficient logistics operations.</p><p>The analysis of these works contributes to a holistic understanding of swarm intelligence models, offering a diverse array of inspirations and methodologies applicable to developing an artificial intelligence-driven cargo optimization service for logistics.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Description of the use of swarm optimization algorithm in the Cargo Optimizer</head><p>Cargo Optimizer would be an expert system supporting determining the most optimal trailer loading configurations. It would fetch data from the Distance Matrix API from Google Maps and data from the customer. Customers using our service (let us assume that it is some expedition/transportation company) would send a request to the freight market containing filters used to orders (max and min weight, max and min volume, max and min cost, location, and search radius). After getting a list of orders, he can choose which to send to Cargo Optimizer. The user has to add the maximum weight and volume of the trailer to the request with the order list to Cargo Optimizer <ref type="bibr" target="#b29">[30]</ref>. That way, we will obtain two lists of the most profitable orders (best income/cost ratio) that can be done in one go. This service's logic would collect data from clients and external services to generate the most profitable sets of orders using AI. More precisely, it will be the particle swarm optimization algorithm. The PSO algorithm can be used to optimize the function of many variables, and in this case, it will be used to find a set of goods that will fill the cargo space most cost-effectively. Figure <ref type="figure" target="#fig_0">1</ref> shows the dependencies between the components. There is a Graphical User Interface mainly on the outside (on the customer side). It directly connects to the FreightMarketDataFetcher and our main component, Cargo Optimizer. The latter has a connection to the RoutingDataFetcher. The PSO algorithm adapted to the needs of the cargo optimizer will retrieve data on available orders at the input. Each particle will contain a drawn set of goods with attributes such as cost, weight, cubic capacity, distance in meters, and duration in minutes between depot and destination. The study contains the fitness value returned by the target function for this set of goods. By target function, we mean a function that will take the list of goods as an input parameter and then convert the profitability value based on their attributes and return it as fitness. Apart from the attributes listed above, each particle will have the best set of goods remembered and the related fitness. Furthermore, the best set of goods will be remembered for the entire swarm, which will be used in the optimization process to update the speed and position of the particles. The particles will be updated according to the assumptions of the original PSO, and the condition for the algorithm to end is a specified number of iterations, after which two of the most profitable lists of orders will be returned.</p><p>A trailer with a maximum weight of W, a maximum volume of V, and a set of N elements {x1, xi, ..., xN}, each element having a specific value ci, weight wi, and volume vi.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>𝑚𝑎𝑥𝑖𝑚𝑖𝑧𝑒 ∑</head><p>𝑐 𝑖 𝑥 𝑖 𝑁 𝑖 = 1</p><p>, where xi = 0, 1 and i = 1, ..., n</p><p>𝑤𝑖𝑡ℎ 𝑐𝑜𝑛𝑠𝑡𝑟𝑎𝑖𝑛𝑡𝑠: ∑ 𝑤 𝑖 𝑥 𝑖 ≤ 𝑊</p><formula xml:id="formula_1">𝑁 𝑖 = 1 𝑎𝑛𝑑 ∑ 𝑣 𝑖 𝑥 𝑖 ≤ 𝑉 𝑁 𝑖 = 1 (2)</formula><p>The function which is responsible for determining the value of an order has been determined as follows:</p><formula xml:id="formula_2">𝑣𝑎𝑙𝑢𝑒 = 𝑐𝑜𝑠𝑡 𝑤𝑒𝑖𝑔ℎ𝑡 + 𝑣𝑜𝑙𝑢𝑚𝑒 + 𝑑𝑖𝑠𝑡𝑎𝑛𝑐𝑒 + 𝑑𝑢𝑟𝑎𝑡𝑖𝑜𝑛 (3)</formula><p>The cost, weight, volume, distance, and duration at the beginning of the program are scaled to a range of [0,1], so each has the same meaning. Therefore, in this case, the optimization task is based on finding a list with a maximum value, which is the sum of the values of all elements in that list. To provide more freedom for the user, to return the list with the second highest value so that he can finally decide which list of orders suits him better.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">PSO algorithm adapted to the Cargo Optimizer's diagram and pseudocode</head><p>Present a workflow diagram better to illustrate the logic operation in the Cargo Optimizer. Furthermore, it was decided to present the logic operation differently. The pseudocode that describes the contents of Figure <ref type="figure" target="#fig_2">3</ref>.  The pseudocode presented in Figure <ref type="figure" target="#fig_2">3</ref>. contains instructions on how to use the PSO algorithm implemented for Cargo Optimizer. This is how we tried to explain its operation step by step. What is worth noting is the fact that the attributes of the order and the way in which the value of a given order differs from the original backpacking problem. Returning the two best-order lists is also our bonus.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Automatic Tests</head><p>The cargo optimizer, as an expert system, should be reliable. It is essential to prove how reliable, fault-proof and optimized it is. To achieve this, the system will be tested in many ways, both manually and automatically.</p><p>Automatic tests are vital to developing and deploying any modern software project. It was created using particular testing frameworks, usually written in the same programming language as the program. These testing frameworks allow us to make assertions regarding parts of code, which usually define some particular logic, e.g., computing average value or realization of sorting algorithm. We can compare the characteristics returned values by function and check them against our expectations. It is also possible to mock-test objects and monitor their internal behavior, such as the order of called functions or used arguments <ref type="bibr" target="#b30">[31]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.1.">Unit Test</head><p>Unit testing is the most basic technique of all testing approaches. It tests tiny fragments of code, primarily single functions or methods that fulfill one purpose. Outside dependencies, such as web services <ref type="bibr" target="#b31">[32,</ref><ref type="bibr" target="#b32">33]</ref> or database connections, are avoided. If some outside dependencies are mixed with logic, they are replaced with mocked connections returning some fixed values <ref type="bibr" target="#b33">[34]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>RoutingDataFetcher Figure 4: UML component diagram -between the components and the RoutingDataFetcher component marked with red color</head><p>Figure <ref type="figure">4</ref> shows the dependencies between the components and the RoutingDataFetcher component marked in red. We posted it to illustrate which component is currently being tested.</p><p>In the scope of unit tests for RoutingDataFetcher, we tested internal functionalities of this component, such as: Figure <ref type="figure">6</ref> shows the dependencies between the components and the CargoOptimizer component marked in red. We posted it to illustrate which component is currently being tested.</p><p>In the scope of unit tests for RoutingDataFetcher, we tested internal functionalities of this component, such as:</p><formula xml:id="formula_3">• realization of the PSO algorithm, •</formula><p>Normalization of the input data.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.2.">Integration tests</head><p>The test goal is to execute the system to verify its behavior and reveal possible failures. The integration testing phase is performed to find errors in the unit interfaces <ref type="bibr" target="#b34">[35]</ref> and systematically build up the entire software system structure <ref type="bibr">[36 -38]</ref>. For example, in our system, one of the components is Cargo Optimizer, whose purpose is to implement a PSO algorithm to compute a list of the most profitable order sets.</p><p>In the case of this component, we will check whether it behaves as expected on the level of the enabled interface, but we will not check what exact processes are going on while producing results. In Figure <ref type="figure" target="#fig_4">7</ref>, we can see the dependencies between the components. RoutingDataFetcher and Distance Matrix API are marked red to show what part of the project was tested.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>RoutingDataFetcher and Distance Matrix API</head><p>In the scope of integration tests for RoutingDataFetcher, we tested the following:</p><p>• connectivity between the internal service of our system (RoutingDataFetcher) and the external Distance Matrix API.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>CargoOptimizer and RoutingDataFetcher</head><p>Figure <ref type="figure">8</ref>: UML component diagram -dependencies between the components. The cargo optimizer and the routingDataFetcher are marked red.</p><p>In Figure <ref type="figure">8</ref>, we can see the dependencies between the components. CargoOptimizer and RoutingDataFetcher are marked red to show what part of the project was tested.</p><p>In the scope of integration tests for RoutingDataFetcher, we tested the following:</p><p>• connectivity between internal services: CargoOptimizer and RoutingDataFetcher.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.3.">Performance tests</head><p>Performance tests are necessary when a system is based on performance-dependent functionalities. Successful products should not force customers to wait long for desired results or exceed some designated limit. In our system, it is strictly bound to the execution time of the PSO algorithm.</p><p>For different sets of inputs, we will require that results be produced within some designated time limit <ref type="bibr" target="#b38">[39]</ref>. Figure <ref type="figure" target="#fig_5">9</ref> shows the dependencies between the components and the CargoOptimizer component marked in red. We posted it to illustrate which component is currently being tested.</p><p>In the scope of unit performance for RoutingDataFetcher, we tested the following:</p><p>• speed and scalability of the realization of the PSO algorithm for different input sizes, • stability of the provided realization of the PSO algorithm.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.4.">End-to-end tests</head><p>End-to-end tests are used to check the functioning of the whole system, checking logic enabled for customers. In this case, all dependencies are included in the testing process: the system's internal components, read/write operations on files, connections to third-party data providers, and whatever is needed for the provided system. Put bluntly, this kind of testing checks whether a provided product fulfills its purpose <ref type="bibr" target="#b39">[40]</ref>. Figure <ref type="figure" target="#fig_6">10</ref> shows the dependencies between the components. We mark the components tested during the E2E test with a red rectangle. In the scope of this test, we use a client in the form of a program that uses a testing framework instead of the graphical user interface to simplify the testing process.</p><p>In the scope of unit performance for RoutingDataFetcher, we tested the following.</p><p>• overall connectivity and correctness of the propagated data between system components.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Manual tests</head><p>These tests are conducted without using remarkable testing and frameworks, automating testing and making test cases repeatable. Usually, manual tests are performed by company or beta testers, which are used to simulate the behaviors of actual customers. It means that what is tested is the enabled user interface (mainly graphical user interface), its logic, reliability, and faultproofness. An important part of manual testing is the evaluation of user experience <ref type="bibr" target="#b40">[41]</ref> -User Experience is an area focused on maximizing the comfortability of interfaces enabled for end users <ref type="bibr" target="#b41">[42]</ref>. Figure <ref type="figure" target="#fig_7">11</ref> shows the dependencies between the components. We marked the components being tested during manual tests with a red rectangle.</p><p>In the scope of these tests, we performed some actions on the level of the graphical user interface to test the connectivity of the entire system and enabled the elements of the graphical interface.</p><p>Figure <ref type="figure" target="#fig_8">12</ref> shows a manual system test to check if a user can proceed to the next step without filling in the required data. Missing data will appear on the screen, so the test was successful.  Figure <ref type="figure" target="#fig_9">13</ref> shows a screenshot of a manual test to retrieve information on the optimal order lists generated based on previously entered data.</p><p>The test was successful, and two best-order lists were displayed on the screen.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Queuing model</head><p>In this report, we also decided to present a queueing model. For analysis, we have selected the main component of our service, Cargo Optimizer, because it is the most important to our customers.</p><p>To calculate the queuing model factors that allow us to evaluate the operation of our service, we decided to simulate the operation and estimate the input data. M/M/c was selected as the queueing model. As for the arrival rate λ, we chose a value of 5 requests per second, the service rate μ equals 3, and the number of servers m of 2.</p><p>The calculation of coefficients is as follows <ref type="bibr" target="#b42">[43]</ref>:</p><p>• utilization of the server (4): 𝜌 = 𝜆 𝑚 * 𝜇 = 0,833</p><p>• profitability of an empty system (5): </p><formula xml:id="formula_5">𝑃 0 = 1/ [∑<label>(</label></formula><p>• mean wait in the queue <ref type="bibr" target="#b6">(7)</ref>:</p><formula xml:id="formula_7">𝑊 𝑞 = 𝐿 𝑞 𝜆 = 0,758<label>(7)</label></formula><p>• mean wait in the system (8):</p><formula xml:id="formula_8">𝑊 = 𝑊 𝑞 + 1 𝜇 = 1,091<label>(8)</label></formula><p>• mean number of customers in the system (9): 𝐿 = 𝜆 * 𝑊 = 5,455</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion</head><p>The intelligent forwarder system is created according to previously planned assumptions. The system communicates with external API's and processes data received from them. Communication occurs between the components that store data, those that process it, and those responsible for displaying it. An essential element of the system is an algorithm based on artificial intelligence. It is a particle swarm optimization algorithm whose task is to return the optimal list of orders based on the data entered by the user.</p><p>The system implementation also includes many tests. Tests help to prevent unexpected operations and make the system safe and optimal.</p><p>The Cargo Optimizer module, which uses elements of artificial intelligence and is the essential point of the system, also uses a queueing model. This is to improve the system performance for multiple users.</p><p>The system can be improved in the future by using a different algorithm for the cargo optimizer. A possible algorithm to use is a genetic algorithm, which operates similarly to the current algorithm. The two algorithms can then be compared based on their speed and the quality of data obtained.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: UML Component Diagram for Cargo Optimizer</figDesc><graphic coords="3,72.00,478.02,451.25,90.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Pseudocode for Cargo Optimizer</figDesc><graphic coords="4,72.00,460.16,409.15,278.38" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Workflow diagram for Cargo Optimizer</figDesc><graphic coords="5,72.50,72.00,450.00,582.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>•FreightMarketDataFetcherFigure 5 :CargoOptimizerFigure 6 :</head><label>56</label><figDesc>Figure 5: Example figure caption -Dependencies between the components and the FreightMarketDataFetcher component marked with red color</figDesc><graphic coords="6,72.00,628.55,451.25,92.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 7 :</head><label>7</label><figDesc>Figure 7: UML component diagram -dependencies between the components. The RoutingDataFetcher and Distance Matrix API are marked in red.</figDesc><graphic coords="7,72.00,591.30,451.25,95.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 9 :</head><label>9</label><figDesc>Figure 9: UML component diagram -Dependencies between the components and the CargoOptimizer component marked in red color</figDesc><graphic coords="8,72.00,467.41,451.25,93.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 10 :</head><label>10</label><figDesc>Figure 10: UML component diagram -dependencies between the components</figDesc><graphic coords="9,72.00,116.69,451.25,93.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Figure 11 :</head><label>11</label><figDesc>Figure 11: UML component diagram -manual tests with a red rectangle</figDesc><graphic coords="9,72.00,476.05,451.25,91.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head>Figure 12 :</head><label>12</label><figDesc>Figure 12: The screenshot shows a manual test.</figDesc><graphic coords="10,82.00,72.00,431.00,214.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_9"><head>Figure 13 :</head><label>13</label><figDesc>Figure 13: The screenshot shows the test result.</figDesc><graphic coords="10,83.75,324.29,427.00,195.50" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_10"><head>•</head><label></label><figDesc>mean number of customers in the queue (6):</figDesc></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>This study is funded by EU NextGenerationEU through the Recovery and Resilience Plan for Slovakia under project No. 09I03-03-V01-000153.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">The integrated logistics management system: a framework and casestudy</title>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">Neng</forename><surname>Chiu</surname></persName>
		</author>
		<idno type="DOI">10.1108/09600039510093249</idno>
		<ptr target="https://doi.org/10.1108/09600039510093249" />
	</analytic>
	<monogr>
		<title level="j">International Journal of Physical Distribution &amp; Logistics Management</title>
		<imprint>
			<biblScope unit="volume">25</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="4" to="22" />
			<date type="published" when="1995">1995</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Optimizing shipping company operations using business process modelling</title>
		<author>
			<persName><forename type="first">D</forename><surname>Lyridis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Fyrvik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Kapetanis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ventikos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Anaxagorou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Uthaug</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Psaraftis</surname></persName>
		</author>
		<idno type="DOI">10.1080/03088830500300636</idno>
	</analytic>
	<monogr>
		<title level="j">Maritime Policy &amp; Management</title>
		<imprint>
			<biblScope unit="volume">32</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="403" to="420" />
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Logistics and Supply Chain Management</title>
		<author>
			<persName><forename type="first">A</forename><surname>Szymonik</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2012">2012</date>
			<publisher>Press</publisher>
			<biblScope unit="page">358</biblScope>
		</imprint>
		<respStmt>
			<orgName>Technical University of Lodz</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">The evaluation of freight forwarding business existences</title>
		<author>
			<persName><forename type="first">A</forename><surname>Anggorowati</surname></persName>
		</author>
		<idno type="DOI">10.2991/grost-17.2018.62</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Conference on Global Research on Sustainable Transport (GROST 2017)</title>
				<meeting>the Conference on Global Research on Sustainable Transport (GROST 2017)</meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">The Implementation of Delivery Order Online as an Effort of Operational Efficiency</title>
		<author>
			<persName><forename type="first">G</forename><surname>Syntia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Fahira</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Himawan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Keke</surname></persName>
		</author>
		<idno type="DOI">10.1088/1742-6596/1573/1/012031</idno>
	</analytic>
	<monogr>
		<title level="j">J. Phys.: Conf. Ser</title>
		<imprint>
			<biblScope unit="volume">1573</biblScope>
			<biblScope unit="page">12031</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Achieving Performability and Reliability of Data Storage in the Internet of Things</title>
		<author>
			<persName><forename type="first">N</forename><surname>Taheri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Jamali</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Esmaeili</surname></persName>
		</author>
		<idno type="DOI">10.5815/ijem.2022.01.02</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Engineering and Manufacturing (IJEM)</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="12" to="28" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">A Comprehensive Survey on the Applications of Swarm Intelligence and Bio-Inspired Evolutionary Strategies</title>
		<author>
			<persName><forename type="first">A</forename><surname>Tzanetos</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Dounias</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-49724-8_15</idno>
	</analytic>
	<monogr>
		<title level="m">Machine Learning Paradigms: Advances in Deep Learning-Based Technological Applications</title>
				<editor>
			<persName><forename type="first">G</forename><forename type="middle">A</forename><surname>Tsihrintzis</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><forename type="middle">C</forename><surname>Jain</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="337" to="378" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Advances in Artificial Systems for Medicine and Education II</title>
		<author>
			<persName><forename type="first">N</forename><surname>Shakhovska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Shakhovska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Fedushko</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-</idno>
		<idno>030-12082-5_48</idno>
		<ptr target="https://doi.org/10.1007/978-3-" />
	</analytic>
	<monogr>
		<title level="m">Advances in Intelligent Systems and Computing</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="volume">902</biblScope>
			<biblScope unit="page" from="527" to="537" />
		</imprint>
	</monogr>
	<note>Some Aspects of the Method for Tourist Route Creation</note>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Swarm Intelligence in Optimization and Robotics</title>
		<author>
			<persName><forename type="first">C</forename><surname>Blum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Groß</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-662-43505-2_66</idno>
		<ptr target="https://doi.org/10.1007/978-3-662-43505-2_66" />
	</analytic>
	<monogr>
		<title level="m">Springer Handbook of Computational Intelligence</title>
				<meeting><address><addrLine>Berlin, Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2015">2015</date>
			<biblScope unit="page" from="1291" to="1309" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Non-Functional Requirements Classification Using Machine Learning Algorithms</title>
		<author>
			<persName><forename type="first">A</forename><surname>Rahman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Nayem</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Siddik</surname></persName>
		</author>
		<idno type="DOI">10.5815/ijisa.2023.03.05</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Intelligent Systems and Applications (IJISA)</title>
		<imprint>
			<biblScope unit="volume">15</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="56" to="69" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Artificial Intelligence : Definition, Trends, Techniques, and Cases</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">N</forename><surname>Kok</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Artificial Intelligence</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page">401</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<ptr target="https://www.mulesoft.com/resources/api/what-is-an-api" />
		<title level="m">What is an API? (Application Programming Interface</title>
				<imprint>
			<publisher>MuleSoft</publisher>
			<date type="published" when="2023-11-03">Nov. 03, 2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Freight Forwarding Industry: Function, Economic Role and Future Market in Bangladesh</title>
		<author>
			<persName><forename type="first">S</forename><surname>Sarker</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Bangladesh Maritime Journal</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="93" to="98" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
	<note>BMJ)</note>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Artificial Swarm Intelligence</title>
		<author>
			<persName><forename type="first">L</forename><surname>Rosenberg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Willcox</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-29516-5_79</idno>
		<ptr target="https://doi.org/10.1007/978-3-030-29516-5_79" />
	</analytic>
	<monogr>
		<title level="m">Intelligent Systems and Applications</title>
				<editor>
			<persName><forename type="first">Y</forename><surname>Bi</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">R</forename><surname>Bhatia</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Kapoor</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="1054" to="1070" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">A Effective Decision Making Approach &quot;Human Swarming with Artificial Swarm Intelligence</title>
		<author>
			<persName><forename type="first">V</forename><surname>Singh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">S</forename><surname>Dhillon</surname></persName>
		</author>
		<idno type="DOI">10.26483/ijarcs.v8i4.4157</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Advanced Research in Computer Science, Special Issue</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="427" to="430" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">A Robotic Path Planning by Using Crow Swarm Optimization Algorithm</title>
		<author>
			<persName><forename type="first">M</forename><surname>Yousif</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Salim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Jummar</surname></persName>
		</author>
		<idno type="DOI">10.5815/ijmsc.2021.01.03</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Mathematical Sciences and Computing(IJMSC)</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="20" to="25" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">The stochastic knapsack problem</title>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">W</forename><surname>Ross</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">H K</forename><surname>Tsang</surname></persName>
		</author>
		<idno type="DOI">10.1109/26.31166</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Communications</title>
		<imprint>
			<biblScope unit="volume">37</biblScope>
			<biblScope unit="issue">7</biblScope>
			<biblScope unit="page" from="740" to="747" />
			<date type="published" when="1989-07">Jul. 1989</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Particle Swarm Optimization for the Multidimensional Knapsack Problem</title>
		<author>
			<persName><forename type="first">F</forename><surname>Hembecker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Lopes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Godoy</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-540-71618-1_40</idno>
	</analytic>
	<monogr>
		<title level="m">Adaptive and Natural Computing Algorithms</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">B</forename><surname>Beliczynski</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Dzielinski</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Iwanowski</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><surname>Ribeiro</surname></persName>
		</editor>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2007">2007</date>
			<biblScope unit="volume">4431</biblScope>
			<biblScope unit="page" from="358" to="365" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<monogr>
		<ptr target="https://lawexplores.com/the-economic-of-shipping-freight-markets" />
		<title level="m">The Economic of Shipping Freight Markets</title>
				<imprint>
			<date type="published" when="2023-05">Nov. 05, 2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Dynamical aspects of animal grouping: Swarms, schools, flocks, and herds</title>
		<author>
			<persName><forename type="first">A</forename><surname>Okubo</surname></persName>
		</author>
		<idno type="DOI">10.1016/0065-227X(86)90003-1</idno>
	</analytic>
	<monogr>
		<title level="j">Advances in Biophysics</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="1" to="94" />
			<date type="published" when="1986">1986</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">From Swarm Simulations to Swarm Intelligence</title>
		<author>
			<persName><forename type="first">A</forename><surname>Schumann</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">EAI Endorsed Transactions on Serious Games</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="461" to="468" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">A comprehensive survey: artificial bee colony (ABC) algorithm and applications</title>
		<author>
			<persName><forename type="first">D</forename><surname>Karaboga</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Gorkemli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Ozturk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Karaboga</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10462-012-9328-0</idno>
		<ptr target="https://doi.org/10.1007/s10462-012-9328-0" />
	</analytic>
	<monogr>
		<title level="j">Artif Intell Rev</title>
		<imprint>
			<biblScope unit="volume">42</biblScope>
			<biblScope unit="page" from="21" to="57" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<monogr>
		<title level="m" type="main">Swarm-based Area Exploration and Coverage based on Pheromones and Bird Flocks</title>
		<author>
			<persName><forename type="first">E</forename><surname>Ventocilla</surname></persName>
		</author>
		<ptr target="https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-212190" />
		<imprint>
			<date type="published" when="2013-11-17">2013. November 17, 2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">A review of artificial fish swarm algorithms: recent advances and applications</title>
		<author>
			<persName><forename type="first">F</forename><surname>Pourpanah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">P</forename><surname>Lim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X.-Z</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Yazdani</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10462-022-10214-4</idno>
		<ptr target="https://doi.org/10.1007/s10462-022-10214-4" />
	</analytic>
	<monogr>
		<title level="j">Artif Intell Rev</title>
		<imprint>
			<biblScope unit="volume">56</biblScope>
			<biblScope unit="page" from="1867" to="1903" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Understanding of Collective Decision-Making in Natural Swarms System, Applications and Challenges</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Bakar</surname></persName>
		</author>
		<idno type="DOI">10.17509/ajse.v1i3.39637</idno>
		<ptr target="https://doi.org/10.17509/ajse.v1i3.39637" />
	</analytic>
	<monogr>
		<title level="j">ASEAN Journal of Science and Engineering</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="161" to="170" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<monogr>
		<title level="m" type="main">A Primer on Multiple Intelligences</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">N O</forename><surname>Sadiku</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Musa</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-77584-1</idno>
		<ptr target="https://doi.org/10.1007/978-3-030-77584-1" />
		<imprint>
			<date type="published" when="2021">2021</date>
			<publisher>Springer International Publishing</publisher>
			<pubPlace>Cham</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Swarm Intelligence</title>
		<author>
			<persName><forename type="first">X</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Clerc</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-91086-4_11</idno>
	</analytic>
	<monogr>
		<title level="m">Handbook of Metaheuristics</title>
				<editor>
			<persName><forename type="first">M</forename><surname>Gendreau</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">J.-Y</forename><surname>Potvin</surname></persName>
		</editor>
		<meeting><address><addrLine>Springe</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="353" to="384" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Swarm Intelligence and Its Applications</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Agarwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Bhatnagar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Balochian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Yan</surname></persName>
		</author>
		<idno type="DOI">10.1155/2013/528069</idno>
	</analytic>
	<monogr>
		<title level="j">The Scientific World Journal</title>
		<imprint>
			<biblScope unit="volume">2013</biblScope>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">An introduction to swarming robotics: application development trends</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Abidin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Arshad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Ngah</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10462-013-9397-8</idno>
	</analytic>
	<monogr>
		<title level="j">Artif Intell Rev</title>
		<imprint>
			<biblScope unit="volume">43</biblScope>
			<biblScope unit="page" from="501" to="514" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Cargo Optimizer Service documentation</title>
		<author>
			<persName><forename type="first">M</forename><surname>Kwapisz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Gierowski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Szewczyk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Seminar work</title>
				<meeting><address><addrLine>Poland</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Benefits and limitations of automated software testing: Systematic literature review and practitioner survey</title>
		<author>
			<persName><forename type="first">D</forename><surname>Rafi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Moses</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Petersen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mäntylä</surname></persName>
		</author>
		<idno type="DOI">10.1109/IWAST.2012.6228988</idno>
	</analytic>
	<monogr>
		<title level="m">7th International Workshop on Automating Software Test</title>
				<imprint>
			<date type="published" when="2012">2012</date>
			<biblScope unit="page" from="36" to="42" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">Web intelligence in practice</title>
		<author>
			<persName><forename type="first">E</forename><surname>Molnár</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Molnár</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Kryvinska</surname></persName>
		</author>
		<idno type="DOI">10.1007/s12927-014-0006-4</idno>
		<ptr target="https://doi.org/10.1007/s12927-014-0006-4" />
	</analytic>
	<monogr>
		<title level="j">J Serv Sci Res</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<biblScope unit="page" from="149" to="172" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<analytic>
		<title level="a" type="main">Model of Smart Locating Application for Small Businesses</title>
		<author>
			<persName><forename type="first">O</forename><surname>Shlyakhetko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Syerov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Gregus</surname></persName>
		</author>
		<idno type="DOI">10.3390/electronics12091993</idno>
		<ptr target="https://doi.org/10.3390/electronics12091993" />
	</analytic>
	<monogr>
		<title level="j">Electronics</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page">1993</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<monogr>
		<title level="m" type="main">Automatic Unit Test Amplification For DevOps</title>
		<author>
			<persName><forename type="first">B</forename><surname>Danglot</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page">160</biblScope>
		</imprint>
		<respStmt>
			<orgName>Université de Lille</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<analytic>
		<title level="a" type="main">Indian Sign Language Recognition Using 2-D Convolution Neural Network and Graphical User Interface</title>
		<author>
			<persName><forename type="first">R</forename><surname>Shashidhar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">N</forename><surname>Arunakumari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Manjunath</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Roopa</surname></persName>
		</author>
		<idno type="DOI">10.5815/ijigsp.2022.02.06</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Image, Graphics and Signal Processing</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="61" to="73" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<monogr>
		<title level="m" type="main">A Practical approach to UML-based derivation of integration tests</title>
		<author>
			<persName><forename type="first">F</forename><surname>Basanieri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bertolino</surname></persName>
		</author>
		<imprint>
			<biblScope unit="page">10</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<analytic>
		<title level="a" type="main">A Decision-Making Technique for Software Architecture Design</title>
		<author>
			<persName><forename type="first">J</forename><surname>Ahamed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Nandi</surname></persName>
		</author>
		<idno type="DOI">10.5815/ijmsc.2023.04.05</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Mathematical Sciences and Computing</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="44" to="49" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<analytic>
		<title level="a" type="main">Early Formalization of AI-tools Usage in Software Engineering in Europe: Study of 2023</title>
		<author>
			<persName><forename type="first">D</forename><surname>Pashchenko</surname></persName>
		</author>
		<idno type="DOI">10.5815/ijitcs.2023.06.03</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Information Technology and Computer Science</title>
		<imprint>
			<biblScope unit="volume">15</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="29" to="36" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b38">
	<analytic>
		<title level="a" type="main">Experience with performance testing of software systems: issues, an approach, and case study</title>
		<author>
			<persName><forename type="first">E</forename><surname>Weyuker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Vokolos</surname></persName>
		</author>
		<idno type="DOI">10.1109/32.888628</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Software Engineering</title>
		<imprint>
			<biblScope unit="volume">26</biblScope>
			<biblScope unit="issue">12</biblScope>
			<biblScope unit="page" from="1147" to="1156" />
			<date type="published" when="2000">2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">End-to-end integration testing design</title>
		<author>
			<persName><forename type="first">W</forename><surname>Tsai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Bai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Paul</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Shao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Agarwal</surname></persName>
		</author>
		<idno type="DOI">10.1109/CMPSAC.2001.960613</idno>
	</analytic>
	<monogr>
		<title level="m">25th Annual International Computer Software and Applications Conference. COMPSAC 2001</title>
				<meeting><address><addrLine>USA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2001">2001</date>
			<biblScope unit="page" from="166" to="171" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b40">
	<monogr>
		<title level="m" type="main">Effective UI: The Art of Building Great User Experience in Software</title>
		<author>
			<persName><forename type="first">J</forename><surname>Anderson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mcree</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Wilson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">E</forename><surname>Team</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2010">2010</date>
			<publisher>O&apos;Reilly Media, Inc</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b41">
	<analytic>
		<title level="a" type="main">Trade-off between automated and manual software testing</title>
		<author>
			<persName><forename type="first">O</forename><surname>Taipale</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kasurinen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Karhu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Smolander</surname></persName>
		</author>
		<idno type="DOI">10.1007/s13198-011-0065-6</idno>
	</analytic>
	<monogr>
		<title level="j">Int J. Syst. Assur. Eng. Manag</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="114" to="125" />
			<date type="published" when="2011-06">June 2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b42">
	<analytic>
		<title level="a" type="main">M/M/C queueing model for waiting time of customers in bank sectors</title>
		<author>
			<persName><forename type="first">S</forename><surname>Sundari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Srinivasan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Mathematical Sciences &amp; Applications</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="issue">3</biblScope>
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
