THEORETICAL ASPECTS REGARDING ARTIFICIAL INTELLIGENCE ALGORITHMS USED IN SERIAL PRODUCTION PROGRAMMING

Fuzzy systems (FSs) have been extensively applied to automatic control, pattern recognition, and decision analysis. However, a common bottleneck is encountered in the derivation of fuzzy rules, which is often difficult, time consuming, and relies on expert knowledge. To automate the design of FSs, many metaheuristic learning algorithms have been proposed. One major optimization category uses Swarm Intelligence (SI) model (Kennedy et al., 2001). The SI technique studies collective behavior in decentralized systems. Its development was based on mimicking the social behavior of animals or insects in an effort to find the optima in the problem space. SI models are initialized with a population of random solutions. One well-known SI model is particle swarm optimization (PSO) (Kennedy & Eberhart, 1995). Many modified PSO models have been proposed and successfully applied to different optimization problems (Clerc & Kennedy, 2002; Bergh & Engelbrecht, 2004; Ratnaweera et al., 2004; Juang, 2004; Kennedy & Mendes, 2006; Parrott & Li, 2006; Chen & Li, 2007). FS design using PSO has also been proposed in several studies (Juang, 2004; Chatterjee et al., 2005; Juang et al., 2007; Araujo & Coelho, 2008; Sharma et al., 2009). Another well-known SI is ant colony optimization (ACO) (Dorigo & Stutzle, 2004). The ACO technique is inspired by real ant colony observations. It is a multi-agent approach that was originally proposed to solve difficult discrete combinatorial optimization problems, such as the traveling salesman problem (TSP) (Dorigo et al., 1996; Dorigo & Gambardella, 1997). In the original ACO meta-heuristic, artificial ant colonies cooperate to find good solutions for difficult discrete optimization problems. Different ACO models have been applied to FS design problems (Cassillas et al., 2000; Cassillas et al., 2005; Mucientes & Casillas; 2007; Juang & Lo, 2007; Juang et al., 2008; Juang & Lu; 2009). In (Cassillas et al.,2000; Mucientes & Casillas; 2007; Juang et al., 2008; Juang & Lu; 2009), the FS input space was partitioned in grid type with antecedent part parameters of an FS manually assigned in advance. In (Juang & Lo, 2007), the FS input space was flexibly partitioned using a fuzzy clustering-like algorithm in order to reduce the total number of rules. For all of these studies, the consequent part parameters were optimized in discrete space using ACO. Since only the consequent part parameters are optimized, and the optimization space is restricted to be discrete, the designed FSs are unsuitable for problems where high accuracy is a major concern. Source: Fuzzy Systems, Book edited by: Ahmad Taher Azar, ISBN 978-953-7619-92-3, pp. 216, February 2010, INTECH, Croatia, downloaded from SCIYO.COM

<p><strong>Context and relevance.</strong>The traveling salesman problem (TSP) is one of the key NP-hard combinatorial optimization problems with wide applications in logistics, transportation planning, and other fields. Exact methods for solving TSP become inefficient as the problem dimension increases, making the use of metaheuristic methods such as simulated annealing (SA), ant colony optimization (ACO), and particle swarm optimization (PSO) relevant. <strong>Objective. </strong>To conduct a comparative analysis of the effectiveness of SA, ACO and PSO for solving the traveling salesman problem with 100 points, to evaluate their convergence and to identify the optimal parameters. <strong>Hypothesis. </strong>The ant algorithm, due to the pheromone trail mechanism, will provide higher accuracy of solutions compared to SA and PSO, but will require more computational resources. <strong>Methods and materials. </strong>The study conducted computational experiments with varying parameters of each algorithm. For SA, the initial temperature and cooling coefficient were analyzed, for ACO, the influence of pheromones and distances, for PSO, the cognitive and social coefficients. <strong>Results. </strong>ACO showed the best results, finding a route with a length of 9.23, demonstrating high efficiency for medium-sized problems. PSO took an intermediate position with a route length of 32.64, making it suitable for moderately complex problems. SA was the least effective, with a route length of 45.2, which limits its use for complex routing networks. <strong>Conclusions. </strong>The ant algorithm demonstrated the greatest efficiency due to the balance between exploring the solution space and exploiting the found routes, which is especially important for maritime Arctic logistics, where sustainable route optimization is required under high uncertainty. PSO showed good convergence, but it is inferior to ACO in terms of accuracy. SA, despite its simplicity, is less effective for high-dimensional problems. The obtained results are of particular practical value for route optimization in the Arctic region, where traditional methods often prove to be ineffective.</p>

Each university has different regulations in making lecture schedule according to the conditions of respective institution. In this study, regulation on lecture scheduling used the maximum limit of credits of lecturer in a day, in which if exceeds the maximum limit, then the schedule of course will be moved on another day. This study attempts to optimize the schedule preparation in each semester by considering the maximum limit of credits of a lecturer in a day. Lecture scheduling is a combination of space, time, and resources. It is categorized into combinatorial optimization group. There are two methods for solving the combinatorial optimization problems, i.e. exact and approximation method. The approximation method consists of two types, heuristics and metaheuristics. The algorithm metaheuristics categories include genetic algorithm (GA), particle swarm optimization (PSO), ant colony optimization (ACO), bee colony optimization (BCO), simulated annealing, and so on. This paper employed metaheuristics approach. Research on the preparation of lecture scheduling using ACO algorithm has been conducted and proven to be able to prepare the lecture scheduling. The ACO algorithm has numbers of parameters that in solving issues, one must manually set a number of parameters by using the Design of Experiments (DoE) tool, which takes time to solve the optimization problem. Hence, to solve the issue, an automated parameter optimization is required. PSO algorithm has fewer parameters compared to the ACO. Therefore, the purpose of this paper is a hybrid between PSO and ACO in preparing lecture scheduling.

Based on the mobile robot path planning problem, on the basis of the improved grid method, this paper proposes an improved ant colony algorithm, the particle swarm optimization algorithm can be incorporated into the ant colony algorithm. Firstly, using the particle swarm optimization algorithm to search for global path roughly. At the same time of search for dynamic pheromone intelligent distribution, to get ant colony algorithm's initial pheromone distribution and according to the pheromone content to eliminate some poor path. Secondly, using ant colony algorithm for the optimal path, it was gotten by particle swarm optimization for the secondary search. Finally, get the optimal solution of path search. The simulation results show that, the fusion algorithm does better than the ant colony algorithm in terms of path optimization.

The empty loading rate is high in the one-to-one line of distribution, which causes an empty return phenomenon, resulting in higher distribution costs. To reduce the costs of supply logistics in same city, the TSP solution is employed to optimize the problem to make the effect that one route serves numerous demand points. Taking the supply route of a supermarket in Jinan City as an example, the Simulated Annealing, Genetic algorithm and Ant Colony algorithm are utilized to calculate the optimal routes at 10 times. The advantages and the disadvantages of each algorithm for this case are compared. Based on the above, a joint algorithm “Ant Colony-Particle Swarm” algorithm is designed. Through the solution of the supply route in supermarket chains in same city, the joint algorithm “Ant Colony – Particle Swarm” algorithm proved to be having a high convergence speed and good practical value for the TSP problem.

To determine the optimal trajectory of mobile robots in a complex environment and to enhance the effectiveness of search efficiency and path optimization, an improved ant colony (ACO) algorithm is proposed. A fusion algorithm of improved particle swarm optimization (PSO) and ACO algorithm is proposed to solve for optimal paths. Firstly, we improve the PSO and adaptively adjust the inertia weight to facilitate the particle search. Besides, we disturb the particles with the chaotic variables to increase the convergence speed. Secondly, the pheromone distribution on the path is adjusted based on the optimal solution of PSO to solve the initial pheromone insufficiency issue in the ACO algorithm. Then, to optimize the update strategy, we adaptively adjust the pheromone intensity values. We also provide a wide range of control schemes for updating the parameters for balancing the search capability and convergence. The results in the simulation environment show that our algorithm is more effective than other improved algorithms. The improved fusion algorithm converges faster and finds shorter optimal path. The method can improve the comprehensive performance and achieve the rapid path planning for mobile robots.

In order to solve the optimization of new energy bus line network, a new energy bus line network based on ant colony algorithm and low-carbon concept is proposed. Firstly, the model of public transport network is established combined with OD matrix, and the improved ant colony algorithm is used to iteratively optimize the initial suboptimal route set, optimize the objective function, and finally obtain the optimal public transport route set. Secondly, the improved ant colony algorithm based on simulated annealing solves the design of public transport network, and the optimization scheme greatly reduces the number of passenger transfers and the total travel time of passengers. Finally, simulated annealing algorithm, basic ant colony algorithm, and simulated annealing improved ant colony algorithm are used to optimize the objective function. It is proved that the improved ant colony algorithm of simulated annealing can find the optimal solution of the three algorithms when solving the problem of public transport network design, which is better than the solution of basic ant colony and simulated annealing algorithm. The solution efficiency is 10.6 times that of simulated annealing algorithm and 3.5 times that of basic ant colony algorithm.

Artificial Intelligence (AI) is revolutionizing the accounting profession, offering transformative capabilities for automating tasks, enhancing decision-making, and improving financial accuracy. As AI becomes integral to accounting practices, it brings both significant opportunities and notable ethical challenges. This review examines the intersection of AI and ethical accounting, providing insights into how professionals can navigate the evolving landscape. The adoption of AI in accounting introduces opportunities for increased efficiency and accuracy. AI systems can handle repetitive tasks such as data entry, reconciliation, and transaction categorization, freeing accountants to focus on strategic activities. Advanced AI algorithms can analyze large volumes of financial data to identify patterns, detect anomalies, and provide real-time insights, enhancing decision-making and forecasting accuracy. Moreover, AI-driven predictive analytics can aid in risk assessment and management, helping organizations to anticipate and mitigate potential financial threats. However, the integration of AI in accounting also raises significant ethical concerns. One of the primary challenges is ensuring transparency and accountability in AI decision-making processes. As AI systems often operate as "black boxes," understanding and explaining their outputs can be difficult, potentially leading to issues of trust and compliance. Ethical accounting necessitates that AI systems be designed with transparency in mind, providing clear explanations for their decisions and actions. Data privacy and security represent another critical ethical consideration. The extensive use of financial data by AI systems necessitates robust measures to protect sensitive information from breaches and unauthorized access. Accountants must ensure that AI systems comply with data protection regulations and ethical standards, safeguarding the confidentiality and integrity of financial data. Bias and fairness in AI algorithms are also pressing ethical issues. If not properly addressed, biases in AI systems can lead to unfair outcomes, such as biased financial recommendations or discriminatory practices. Ensuring fairness requires ongoing monitoring and evaluation of AI systems to identify and mitigate biases. In conclusion, while AI offers substantial benefits for the accounting profession, it also presents ethical challenges that must be carefully managed. Accountants must navigate these challenges by promoting transparency, ensuring data privacy and security, and addressing biases in AI systems. By doing so, the accounting profession can harness the potential of AI while upholding ethical standards and maintaining public trust. Keywords: AI, Ethical Accounting, Navigating, Challenges, Opportunities.

This paper provide a solution for the medium size power plant in economic load dispatch problem using an Ant Colony Optimization and Particle Swarm Optimization with renewable energy. Renewable energy sources are a reasonable choice to tackle the issue of traditional method of electricity produced. Wind power has proven to be promising alternative sources to overcoming the world’s energy crises. Wind intermittent nature and strong penetration into power system is a major challenge to their reliability and securely installations. In this work, ELD problem is formulated using wind cost function. The Renewable power variability and uncertainty entail additional costs, called penalty costs. The algorithms Ant Colony and Particle Swarm Optimization are used to allocate the thermal and wind generating units at minimal operating cost to meet load demand. The proposed calculation has been approved on 26 bus system. The Results obtained with this methodology are compared with each others.

Purpose This study aims to investigate ethical consideration into the data quality management and biases for fairness in artificial intelligence (AI) algorithms. It looks at how biases in AI systems could make it difficult to maintain data quality control in medical travel and tourism. Design/methodology/approach The systematic review of the literature from January 2019 to March 2025 (72 out of 925 articles) considers a variety of keyword combinations used for data quality control in AI systems. The process of systematic literature review aids in identifying studies on data quality management for medical tourism and travel. Findings The results of the study show that data quality visibility should be increased, data rectification should be done consistently and data momentum should be managed. It indicates that audience behavior in medical travel and tourism is significantly impacted by AI-powered digital branding and marketing. Research limitations/implications The research is limited to the single source of methodology, and it is limited in terms of articles collected from Jan 2019 to March 2025. It can be extended to the last decade for more insights and issues in AI use for medical travel and tourism. Practical implications Practical applications include efficient patient processing for international medical travel and tourism, as well as automated AI machine learning. Future research investigations should consistently segment data evaluation to overcome the limited regulatory compliance of data quality management. Social implications Patients (medical tourism) are primary elements in healthy social settings that can be facilitated through AI’s efficient use and maintaining the quality of the data management. Originality/value This study aims to address the main ethical concerns about the quality of AI data, data use monitoring and ethical support for data decisions and implementations inside the AI framework. The usage of digital branding, mobile app development, digital audience behavior, digital marketing principles and artificial intelligence in marketing are some of the important concepts used to accomplish the research goals.

In this chapter, one gives an introduction to different kinds of particle swarm optimization (PSO) algorithms. One also introduces artificial neural networks (ANNs), support vector machines (SVMs) and evolutionary computing to show how PSO may be used to determine optimal parameters using an ANN or SVM regime, for classification of DNA strings. In addition, PSO is used in the design of an SVM-based clustering algorithm. Ant colony optimization (ACO) algorithms are also introduced in the chapter. Using ACO algorithms has been of great success to solve many discrete optimization and non-deterministic polynomial (NP)-hard problems, for instance the travelling salesman problem. The behaviour of ants is also used, for instance, to design an algorithm for data clustering. We want to develop later a similar application based on this clustering algorithm and compare it with the SVM one using PSO.

This study explores transit‐oriented development (TOD) in Dhaka City using optimization algorithms to provide urban planning and policy‐making insights. The analysis examined the distribution of the TOD index values across the city and identified areas with varying levels of TOD potential. Two optimization algorithms, ant colony optimization (ACO) and particle swarm optimization (PSO), were employed to assess and compare the TOD index values. The results highlight the significance of transit infrastructure in promoting sustainable urban development, particularly in proximity to existing mass rapid transit (MRT) lines. PSO is more suitable for this study among the optimization algorithms because it offers a more precise TOD potential assessment. The findings suggest prioritizing investments in transit infrastructure and implementing TOD‐friendly policies to foster sustainable urban growth and improve residents’ quality of life. Future studies can benefit from optimizing the algorithm parameters and incorporating real‐world data to improve the accuracy of the TOD assessments.

The present article investigates the effectiveness of evolutionary computation algorithms in a specific optimisation task, namely morphological segmentation of words into subword segments, focusing on the definition of stems and endings. More precisely, particle swarm optimisation (PSO) is compared to an earlier study on the same task using ant colony optimisation (ACO), using a number of different optimisation criteria, for each of which independent experiments are run. In the present article, the system architecture has been revised over earlier implementations, to allow substantially faster simulation times (by several orders of magnitude), which in turn allows the realisation of more iterations. The effect of local search to the PSO final segmentation quality is investigated in detail, with different local search processes being compared in terms of their effectiveness. In addition, issues involving the convergence of PSO are examined, encompassing variants which adopt global versus local training schemes. Experimental results show that, for different datasets, as a rule both PSO and ACO achieve higher segmentation accuracies than manual tuning. A comparison between ACO and PSO is made, over the different criteria used. When focusing on the highest performing criteria, ACO and PSO are comparable, while the system revisions allow the process to be completed much faster. In terms of the highest segmentation accuracy obtained for a specific system configuration, PSO is more effective, by achieving the highest segmentation accuracy amongst all optimisation methods tested.

In this paper, the no-wait flow shop scheduling problem under makespan and flowtime criteria is addressed. The no-wait flowshop is a variant of the well-known flowshop scheduling problem where all processes follow the previous one without any interruption for operations of a job. Owing to the problem is known to be NP-hard for more than two machines, a hybrid meta-heuristic algorithm based on ant colony optimization (ACO) and simulated annealing (SA) algorithm is improved. First, at each step, due to the characteristic of ACO algorithm that include solution construction and pheromone trail updating, some different areas of search space are checked and best solution is selected. Then, to enhance the quality and diversity of the solution and finding best neighbor of this solution, a novel SA is presented. Moreover, a new principle is applied for global pheromone update based on the probability function like SA algorithm. The proposed approach solution is compared with several the state-of-the-art algorithms in the literature. The reported results show that the proposed algorithms are effective and the new approach for local search in ACO algorithm is efficient for solving the no-wait flow shop problem. Then, we employed another hybrid ACO algorithm based on hybridization of ACO with variable neighborhood search (VNS) and compare the results given by two proposed algorithms. These results show that our new hybrid provides better results than ACO-VNS algorithm.

The research and development of metaheuristic methods are critical issues in computer science. In the past decade, metaheuristic algorithms have been used in many engineering applications such as optimization of engineering problems, telecommunications, information security, and image processing. Many metaheuristic algorithms such as particle swarm optimization (PSO), ant colony optimization (ACO), and genetic algorithm (GA) are recently becoming very popular.There are many studies conducted in the literature on the comparison of PSO with other metaheuristic algorithms. In this chapter, various studies carried out between the years of 2010 and 2020 about the comparison of PSO with the other metaheuristic algorithms will be examined. The metaheuristic algorithms to be considered are simulated annealing (SA), genetic algorithm (GA), differential evolution (DE), ant colony optimization (ACO), artificial bee colony (ABC) algorithm, particle swarm optimization (PSO), tabu search (TS), harmony search (HS), firefly algorithm (FF), cuckoo search (CS), bat-inspired algorithm (BA), water wave optimization (WWO), clonal selection algorithm (CLONALG), chemical reaction optimization (CRO), sine cosine algorithm (SCA), glowworm swarm optimization (GSO), and grey wolf optimizer (GWO). This study aims to evaluate and analyze the covered papers according to several criteria such as (a) rates of studies according to publishing years, (b) the metaheuristic algorithms that are compared to PSO, (c) performance evaluation of compared algorithms, (d) the metaheuristic algorithms with their inspirational approaches and their initial proposed studies and years, (e) the field of subjects where the algorithms are applied in the reviewed studies, and (f) used databases in the examined studies.This study is a comprehensive literature review of the comparison of PSO with the most popular metaheuristic algorithms. The intention of this review is to be useful for researchers who want to conduct a survey on this area of the subject as this chapter will cover the essential and helpful analysis of the related research.