<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Applying A Multi-Objective Genetic Optimization Algorithm to Select Automotive Parts Suppliers</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Kazemi</surname><given-names>Mina</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Mehrabi</surname><given-names>Abolghasem</given-names></name><xref ref-type="aff" rid="aff2"/></contrib>
<contrib contrib-type="author"><name><surname>Anbarzadeh</surname><given-names>Amin</given-names></name><xref ref-type="aff" rid="aff3"/></contrib>
<contrib contrib-type="author"><name><surname>Farahani</surname><given-names>Zahra</given-names></name><xref ref-type="aff" rid="aff4"/></contrib>
<aff id="aff1">Department of Computer Engineering, Mala. C., Islamic Azad University, Malard, Iran.</aff>
<aff id="aff2">Department of Mechanical Engineering, Head of the Body Engineering Department, SAIPA, Tehran, Iran.</aff>
<aff id="aff3">Department of Mechanical Engineering, Technical and Vocational University (TVU), Tehran, Iran.</aff>
<aff id="aff4">Department of Industrial Engineering, Engineering Expert of the Department of Body Engineering, SAIPA, Tehran, Iran.</aff>
</contrib-group>
<abstract><p>This paper proposes a multi-objective mathematical model to select the best suppliers of parts and products to improve vehicle quality and reduce costs. The results are presented in two sizes, and a sensitivity analysis of the demand parameter has been performed. For each of the medium and large sizes, the indices of the Unconstrained Non-Dominated Sorting Genetic Algorithm II (NSGA-II), including computational time, Maximum Spread Index (MSI), metric distance index, and the number of efficient solutions, have been calculated. The results show that the number of efficient solutions increases with problem size, indicating the high efficiency of the undefeated NSGA-II in finding efficient solutions for the supplier selection problem.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Supplier selection</kwd><kwd>Automotive industry</kwd><kwd>Multi-objective genetic algorithm</kwd><kwd>Non-dominated sorting</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1">
<p>genetic algorithm II .</p>
</sec>
<sec id="sec-2"><label>1</label><title>Introduction</title>
<p>The supplier selection problem is complex, and numerous quantitative and qualitative performance criteria, such as quality, price, flexibility, and delivery time, must be considered to determine the most appropriate supplier. In this regard, multi-criteria decision-making methods in a fuzzy environment have been used for supplier selection, and a method for calculating weights and ranking alternatives using the fuzzy TOPSIS technique has been proposed <xref ref-type="bibr" rid="ref-1">[1]</xref>. The Pareto algorithm leads to weak convergence; therefore, the NSGA-II algorithm is considered a suitable alternative for solving such problems <xref ref-type="bibr" rid="ref-2">[2]</xref>. Chita and Subbaraj <xref ref-type="bibr" rid="ref-3">[3]</xref> studied the reverse flow of materials from consumers to producers for material recycling. In reverse logistics, parameters such as facility capacities, demand, cost, quality, and others are uncertain. Considering these issues, this research presents a probabilistic mixed-integer linear programming model for designing a reverse logistics network. To solve this type of model, it was first converted into a deterministic model. The proposed model is multi-product and multi-echelon, simultaneously incorporating transportation costs and facility establishment costs.</p>
<p>An efficient method based on a genetic algorithm with priority-based encoding was proposed to solve the model. Razaei Kallaj <xref ref-type="bibr" rid="ref-4">[4]</xref> noted that, because suppliers play a fundamental role in cost, quality, service, and other criteria in achieving supply chain objectives, they are vital components of an organization and can significantly affect organizational performance. Since supplier selection problems in the real world face uncertainty and various constraints for both buyers and suppliers, the supplier selection process under multiple sourcing in an uncertain environment has been studied. Ghasemi and Abolghasemian <xref ref-type="bibr" rid="ref-5">[5]</xref> investigated the development of an optimal order quantity determination model with appropriate supplier selection using a multi-objective genetic optimization algorithm. In this study, the model was solved using the multi-objective NSGA-II metaheuristic, and, for validation, using the particle swarm optimization metaheuristic, with the results compared to those obtained from the first method.</p>
<p>Focusing solely on economic performance to optimize costs or return on investment cannot lead to the development of a sustainable supply chain. The impacts of supply chain activities on social life and environmental issues that contribute to sustainable development must also be considered. However, among the three dimensions of sustainability, economic, social, and environmental, the economic dimension has the greatest influence <xref ref-type="bibr" rid="ref-6">[6]</xref>. Given the complexities of the supplier selection process for automotive parts, a multi-sourcing approach is necessary <xref ref-type="bibr" rid="ref-7">[7]</xref>. Supplier selection in supply chain management is a group multi-criteria decision-making problem. The degree of data uncertainty, the number of decision-makers, and the nature of the criteria are among the issues that must be considered in such problems <xref ref-type="bibr" rid="ref-8">[8]</xref>. In the first stage, the supplier selection problem in the automotive industry is modeled. To develop a comprehensive supplier selection model, four issues must be incorporated: which parts to purchase from which suppliers, in what quantities, and during which time periods. Additionally, the criteria considered in the model for supplier selection, including the objective functions and existing constraints, are particularly important.</p>
<p>After preparing the model, an appropriate algorithm is required to solve it, one that provides an acceptable, efficient solution that meets the defined objectives and constraints. The multi-objective mathematical model was initially solved by treating each objective separately using a genetic algorithm. Subsequently, since the supplier selection problem involves multiple objective functions and an optimal solution for one objective may not be suitable for others, it leads to Pareto-optimal (efficient) solutions. Therefore, the NSGA-II algorithm, one of the most widely used and powerful algorithms for solving multi-objective optimization problems, was employed. Its efficiency has been proven in various applications.</p>
<p>To model the supplier selection problem in the automotive industry, certain assumptions must be established first. Then, objective functions are formulated based on the defined criteria for supplier selection. Finally, the constraints within which the obtained solution must be valid are specified <xref ref-type="bibr" rid="ref-9">[9]</xref>. After completing the modeling process, an appropriate algorithm is used to find the optimal solution. The selection of the algorithm depends on the characteristics of the developed model and must be capable of providing optimal solutions considering the objectives and constraints. The mathematical model of supplier selection involves different and conflicting objectives. Therefore, in multi-objective problems, there is no absolute optimal solution. In such cases, an optimal solution for one objective may yield poorer outcomes for others, leading to Pareto-efficient solutions. Taguchi introduced an engineering method for product or process design aimed at minimizing variability and sensitivity to noise factors <xref ref-type="bibr" rid="ref-10">[10]</xref>. In the Taguchi method, appropriate factors are first identified, then the levels of each factor are selected, and finally a suitable experimental design is determined for these control factors. After defining the experimental design, experiments are conducted and analyzed to identify the optimal parameter combination <xref ref-type="bibr" rid="ref-3">[3]</xref>.</p>
</sec>
<sec id="sec-3"><label>2</label><title>Modelling</title>
<p>Modeling assumptions are as follows:</p>
<p>I. Rework cost is applied separately for each part produced by each manufacturer.</p>
<p>II. The developed model is multi-objective and linear.</p>
<p>III. The designed model is a multi-period model that allocates orders across the specified periods.</p>
<p>IV. The ordering cost of item p from supplier s is independent of the quantity ordered.</p>
<p>V. Lots received from suppliers are transferred to a temporary warehouse and inspected. These lots contain an average number of defective items, q, that are identified during inspection and replaced by the supplier. VI. Holding items after the end of the first period incurs inventory holding costs. These costs are calculated for each part based on the available information.</p>
<p>VII. Since inventory levels for each part do not usually reach zero at the end of the planning horizon, the initial inventory for each part at the beginning of the next planning period is treated separately.</p>
<p>VIII. All suppliers have limited capacity, and each supplier&apos;s capacity is fixed in each period.</p>
<p>IX. Given fixed setup costs for the supplier&apos;s production line and the policy of sourcing not all required items from a single supplier, minimum and maximum limits for each item in each period must be considered. The indices used in modeling the problem are as follows:</p>
<p>p Index representing the required part types.</p>
<p>s Index representing the suppliers under consideration.</p>
<p>t Index representing the time periods.</p>
<p>The parameters of the model are defined as follows:</p>
<p>Cpst Purchasing cost of product type p from supplier s in time period t.</p>
<p>COpst Ordering cost of product type p from supplier s in time period t.</p>
<p>Dpt Demand for product type p in time period t.</p>
<p>Hpst Holding cost of product type p from supplier s in time period t.</p>
<p>Trpst Transportation cost of one unit of product type p from supplier s in time period t.</p>
<p>QRpst Quality level of product type p received from supplier s in time period t, based on the defect (return) rate.</p>
<p>QRWpst Quality level of product type p received from supplier s in time period t, based on the rework rate of the supplier.</p>
<p>QSpst Overall quality level of suppliers for producing product type p in time period p.</p>
<p>TDpst Production lead time of product type p by supplier s in time period t.</p>
<p>CAPps The maximum production capacity of suppliers for the product type.</p>
<p>EFps Initial inventory of product type p at supplier s at the beginning of the planning horizon.</p>
<p>ENps max Maximum allowable inventory level of product type p at supplier s at the end of the time period.</p>
<p>NSUps The maximum required quantity from suppliers for producing the product type.</p>
<p>NSLps Minimum required quantity from suppliers for producing the product type.</p>
<p>The decision variables of the model are defined as follows:</p>
<p>Xpst The quantity of product type P that must be supplied from suppliers in the time period t.</p>
<p>Ypst If supplier s supplied product p in time period t, it takes the value 1; otherwise, it takes the value 0.</p>
<p>Ipst Supplier&apos;s inventory of product in time period t.</p>
<p>ENps Ending inventory of supplier s&apos; warehouse of product p.</p>
<p>The objective function of the model is defined as follows:</p>
<p>First objective function: Minimize the total cost, which consists of five components: purchasing cost, fixed ordering cost, holding cost, and transportation cost.</p>
<p>Purchasing cost: equals the total purchasing cost of selected healthy items from selected suppliers during the planning time periods. The aforementioned cost is calculated as follows:</p>
<p>∑ ∑ ∑ Cpst Xpst(1 − QRpst). (1)</p>
<p>p s t</p>
<p>Ordering cost function:</p>
<p>∑ ∑ ∑ COpst Ypst. (2)</p>
<p>p s t</p>
<p>Holding cost function:</p>
<p>∑ ∑ ∑ Hpst Ipst. (3)</p>
<p>p s t</p>
<p>Transportation cost function:</p>
<p>∑ ∑ ∑ Trpst Xpst. (4)</p>
<p>p s t</p>
<p>Finally, the total cost function is as follows:</p>
<p>MinZ1 = ∑ ∑ ∑ Cpst Xpst(1 − QRpst) + ∑ ∑ ∑ COpst Ypst + ∑ ∑ ∑ Hpst Ipst</p>
<p>p s t p s t p s t (5)</p>
<p>+ ∑ ∑ ∑ Trpst Xpst.</p>
<p>p s t</p>
<p>Second objective function: Minimization of waiting time as follows:</p>
<p>MinZ2 = ∑ ∑ ∑ TDpst Xpst. (6)</p>
<p>p s t</p>
<p>Third objective function: Minimize the number of returned items as follows:</p>
<p>MinZ3 = ∑ ∑ ∑ QRpst Xpst. (7)</p>
<p>p s t</p>
<p>Fourth objective function: Minimize the amount of rework as follows:</p>
<p>MinZ4 = ∑ ∑ ∑ QRWpst Xpst. (8)</p>
<p>p s t</p>
<p>Fifth objective function: Maximizing quality as follows:</p>
<p>MaxZ5 = ∑ ∑ ∑ QSpst Xpst. (9)</p>
<p>p s t</p>
<p>The constraint equations of the model are defined as follows:</p>
<p>∑ Xpst + Tpst−1 − Ipst = Dpt for all p, t, (10)</p>
<p>Ipst = EFps, for all p, s, t = 1, (11)</p>
<p>Ipst = ENps, for all p, s, t = T, (10) ENps = ENps max, for all p, s, (13)</p>
<p>Xpst ≤ CAPps Ypst, for all p, s, t, (14)</p>
<p>∑ Ypst ≤ NSUps, (15)</p>
<p>∑ Ypst ≥ NSLps. (16)</p>
<p>Constraint (10) of the supplier selection model concerns satisfying the total customer demand over the planning horizon, which is calculated using the following relationship. Under this constraint, the inventory accumulated at the end of one period is carried over to the beginning of the next. Constraint (11) represents the initial inventory level at the beginning of each period. Constraints (12) and (13) specify the maximum allowable level of remaining inventory at the end of the planning period for each supplier. Constraint (14) indicates the maximum permissible production capacity and ensures that a supplier cannot initiate production unless it has been selected. Constraints (15) and (16) define the minimum and maximum number of suppliers required for the production and supply of products.</p>
</sec>
<sec id="sec-4"><label>3</label><title>Results</title>
<p>In tuning the parameters of the Non-dominated Sorting Genetic Algorithm-II (NSGA-II), three levels were considered for each factor. Each experiment was repeated 5 times, and the average of the resulting values was used for the final evaluation. <xref ref-type="table" rid="tab1">Table 1</xref> presents the parameter settings for the proposed algorithms. <xref ref-type="table" rid="tab2">Table 2</xref> shows the optimal parameters obtained after parameter tuning using the Taguchi method.</p>
<p>The first problem was defined with five products, eight suppliers, and 6 time periods, while the second problem was defined with 10 products, 12 suppliers, and 9 time periods. Accordingly, in this section, the aforementioned problems were solved using a multi-objective genetic optimization algorithm, and <xref ref-type="table" rid="tab3">Tables 3</xref> and 4 present the efficient solutions obtained from the algorithm outputs, respectively. The dispersion of efficient solutions relative to one another for medium and large problem sizes is illustrated in Fig 1. and 2, respectively.</p>
<p>In an efficient parameter design, the primary objective is to identify and adjust the factors that minimize the variation in the response variable, while the subsequent objective is to distinguish between controllable and uncontrollable factors. The ultimate goal of this method is to determine the optimal combination of controllable factor levels. The method of defining and examining all possible conditions in an experiment involving multiple factors is known as the Design of Experiments (DOE). In some publications, this approach is referred to as a factorial design. In this study, three levels are considered for each factor. For each algorithm, the experimental design is determined by the number of factors and their corresponding levels, and the design is then implemented. It should be noted that each experiment is repeated an average of five times, and the mean values obtained are used for the final analysis. <xref ref-type="table" rid="tab2">Table 2</xref> presents the parameter tuning levels of the proposed algorithms, and <xref ref-type="table" rid="tab3">Table 3</xref> shows the optimal parameters obtained after parameter tuning using the Taguchi method.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>NSGA-II parameters level.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,633.5,537.1,695.9"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<table-wrap id="tab2"><label>Table 2</label><caption><p>Optimum NSGA-II parameters.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,571.3,537.1,605.9"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<fig id="fig1"><label>Figure 1</label><caption><p>Scatterplot of efficient solutions of problem objectives relative to each other at average size.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,372,537.1,604.9"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<table-wrap id="tab3"><label>Table 3</label><caption><p>An efficient solution to the medium-sized supplier selection problem.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,58.4,537.1,326.6"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<table-wrap id="tab4"><label>Table 4</label><caption><p>Efficient solution to the large-scale supplier selection problem.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:6:66,470,537.1,757.6"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<fig id="fig2"><label>Figure 2</label><caption><p>Scatterplot of efficient solutions of the problem objectives relative to each other on a large scale.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:6:66,290.9,537.1,756.6"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
<sec id="sec-5"><label>4</label><title>Conclusion</title>
<p>In this study, the problem of selecting parts suppliers in the automotive industry is investigated as a multi-objective, multi-period problem under real-world supply chain constraints. To achieve an efficient decision, a mathematical model is developed that simultaneously considers total cost, lead time, the rate of returned items, the level of rework, and quality performance. Given the conflicting nature of the objective functions and the problem&apos;s computational complexity, the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is employed to solve the model. The results from solving the model for medium- and large-sized problem instances indicate that the NSGA-II algorithm is highly effective at generating a diverse and comprehensive set of Pareto-efficient solutions. The increase in the number of efficient solutions in the larger instance demonstrates the algorithm&apos;s scalability and effectiveness in addressing large, complex problems in the automotive industry.</p>
<table-wrap id="tab5"><label>Table 5</label><caption><p>summarizes the performance indices for the medium- and large-sized problems. According to Table 5, lower CPU time and SM values indicate better algorithmic performance. Therefore, as the problem size increases, computational time increases, while the SM value decreases compared to the medium size due to the greater number of efficient (Pareto-optimal) solutions. In addition, the MSI value increases with problem size and the number of efficient solutions, demonstrating the high efficiency of the multi-objective genetic optimization algorithm for larger problem sizes.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:6:66,54.8,537.1,125.3"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Moreover, the appropriate dispersion of solutions in the objective space enables decision-makers to select the most desirable solution according to managerial priorities. An evaluation of the algorithm&apos;s performance indicators, including Computational Time (CPU time), Spacing Index (SI), Maximum Spread Index (MSI), Solution Distribution Metric (SM), and the Number of Pareto Front Solutions (NPF), reveals that although computational time increases with problem size, the quality of solutions improves in terms of diversity and coverage of the Pareto space. The reduction in the SM value for the larger problem size, due to the increased number of efficient solutions, indicates a more uniform distribution of solutions and enhanced search capability of the algorithm. Furthermore, the increase in the MSI value reflects an improvement in the extent of objective space coverage and the algorithm&apos;s ability to identify more diverse solutions.</p>
<p>Overall, this research demonstrates that the multi-objective genetic optimization algorithm NSGA-II can be used as an efficient and reliable tool for decision-making in supplier selection and order allocation in the automotive industry. In addition to cost reduction, the proposed model contributes to quality improvement, reduced lead times, and better control of defective items, and it can serve as a suitable basis for supply chain managers&apos; decisions under real, complex conditions. It is recommended that future research explicitly incorporate parameter uncertainty using fuzzy or robust optimization approaches and compare the performance of NSGA-II with other advanced metaheuristic algorithms.</p>
</sec>
<sec id="sec-6"><title>Acknowledgments</title>
<p>The authors would like to express their sincere appreciation to all individuals whose valuable comments and support contributed to the successful completion of this study.</p>
</sec>
<sec id="sec-7"><title>Funding</title>
<p>This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.</p>
</sec>
<sec id="sec-8"><title>Data Availability</title>
<p>The data supporting the findings of this study are available from the corresponding author upon reasonable request.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Luo, J., Gu, Q., Chen, L., Li, X., &amp; Li, P. (2025). Multi-objective optimization for ore blending schemes in the open-pit phosphate mine using an improved NSGA-II algorithm. Green and smart mining engineering, 2(1), 42–56. <ext-link ext-link-type="uri" xlink:href="https://ui.adsabs.harvard.edu/link_gateway/2025GSME....2...42L/doi:10.1016/j.gsme.2024.12.004">https://ui.adsabs.harvard.edu/link_gateway/2025GSME....2...42L/doi:10.1016/j.gsme.2024.12.004</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Altiparmak, F., Gen, M., Lin, L., &amp; Karaoglan, I. (2009). A steady-state genetic algorithm for multi-product supply chain network design. Computers &amp; industrial engineering, 56(2), 521–537. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cie.2007.05.012">https://doi.org/10.1016/j.cie.2007.05.012</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Chitra, C., &amp; Subbaraj, P. (2012). A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks. Expert systems with applications, 39(1), 1518–1525. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2011.08.044">https://doi.org/10.1016/j.eswa.2011.08.044</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Rezaei Kallaj, M., Abolghasemian, M., Moradi Pirbalouti, S., Sabk Ara, M., &amp; Pourghader Chobar, A. (2021). Vehicle routing problem in relief supply under a crisis condition considering blood types. Mathematical problems in engineering, 2021(1), 7217182. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1155/2021/7217182">https://doi.org/10.1155/2021/7217182</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Ghasemi, P., Abolghasemian, M., &amp; others. (2023). A Stackelberg game for closed-loop supply chains under uncertainty with genetic algorithm and gray wolf optimization. Supply chain analytics, 4, 100040. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.sca.2023.100040">https://doi.org/10.1016/j.sca.2023.100040</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>6</label><mixed-citation>Ghasemi, P., Ali, S. M., Abolghasemian, M., Malakoot, R. A., &amp; Chobar, A. P. (2025). A stochastic sustainable closed-loop supply chain networks for used solar photovoltaic systems: Meta-heuristic comparison and real case study. Sustainable operations and computers, 6, 15–33. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.susoc.2024.11.001">https://doi.org/10.1016/j.susoc.2024.11.001</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>7</label><mixed-citation>Hemmati, A., Kaveh, F., Abolghasemian, M., &amp; Pourghader Chobar, A. (2024). Simulating the line balance to provide an improvement plan for optimal production and costing in petrochemical industries. Engineering management and soft computing, 10(1), 190–212. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.22091/jemsc.2024.11189.1198">https://doi.org/10.22091/jemsc.2024.11189.1198</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>8</label><mixed-citation>Edalatpanah, S. A., Hassani, F. S., Smarandache, F., Sorourkhah, A., Pamucar, D., &amp; Cui, B. (2024). A hybrid time series forecasting method based on neutrosophic logic with applications in financial issues. Engineering applications of artificial intelligence, 129, 107531. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.engappai.2023.107531">https://doi.org/10.1016/j.engappai.2023.107531</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>9</label><mixed-citation>Sorourkhah, A., Azar, A., Babaie-Kafaki, S., &amp; Shafiei Nik Abadi, M. (2017). Using weighted-robustness analysis in strategy selection (case study: Saipa automotive research and innovation center). Industrial management journal, 9(4), 665–690. (In Persian). <ext-link ext-link-type="uri" xlink:href="https://imj.ut.ac.ir/article_66391_8f3bfa851d53ca8958377d034c93602b.pdf?lang=e">https://imj.ut.ac.ir/article_66391_8f3bfa851d53ca8958377d034c93602b.pdf?lang=e</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>10</label><mixed-citation>Kordsofla, M. M., &amp; Sorourkhah, A. (2023). Strategic adaptation in travel agencies: Integrating MARA with SWOT for uncertainty navigation. Journal of operational and strategic analytics, 1(4), 173–188. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.56578/josa010403">https://doi.org/10.56578/josa010403</ext-link></mixed-citation></ref>
</ref-list></back>
</article>