Designing a sustainable integrated production system model under uncertainty considering the discount in production outsourcing costs
Subject Areas : Production PlanningSaeed Shahdoust 1 , Mohammad Fallah 2 , Esmaeil Najafi 3
1 - 1Department of Industrial Engineering, Islamic Azad University, Central Tehran Branch
2 - Department of Industrial Engineering, Islamic Azad University, Central Tehran Branch
3 - Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
Keywords: sustainable integrated production system, robust-fuzzy-probabilistic optimization method, MOGWO algorithm,
Abstract :
Sustainability in the integrated production system in supply chain networks has led to the creation of competitive advantage for companies. Therefore, companies should have proper management of their supply chain network to increase their market share. Therefore, in this article, a dual-objective model of a sustainable integrated production system is presented, taking into account the simultaneous reduction of possible costs on the system, the amount of greenhouse gas emissions, and the application of discounts on the costs of outsourcing production under uncertainty and the control of non-deterministic parameters with the robust optimization method. . Due to the NP-hard nature of the problem, the exact epsilon constraint method and meta-heuristic algorithms MOPSO, NSGA II, and MOGWO have been used to solve the model. The results of the calculations showed that the NSGA II algorithm is effective in obtaining the indicators of the number of effective answers and the distance index, and the MOPSO algorithm is also in obtaining the indicators of the most spread, the average computing time, and the distance from the ideal point, and the MOGWO algorithm is also in obtaining the averages of the first objective function . Also, the results of the implementation of the TOPSIS method for ranking the algorithms for solving the problem of a sustainable integrated production system included obtaining a desirability weight of 0.5882 for the MOPSO algorithm, obtaining a desirability weight of 0.1397 for the MOGWO algorithm, and obtaining a desirability weight of 0.7491 for the NSGA II algorithm.
Designing a sustainable integrated production system model under uncertainty considering the discount in production outsourcing costs
Abstract
Purpose: Sustainability in the integrated production system in supply chain networks has led to the creation of competitive advantage for companies. Therefore, companies should have proper management of their supply chain network to increase their market share. Therefore, companies with proper design of the integrated production system in the company can take steps to reduce the cost and also reduce the amount of pollution by properly planning production or outsourcing production. Therefore, in this paper, a bi-objective model of a sustainable integrated production system is presented, taking into account the simultaneous reduction of possible costs on the system, the amount of greenhouse gas emissions, and the application of discounts on the costs of outsourcing production under uncertainty and the control of parameters with the robust-fuzzy-probabilistic optimization method. The main goal in this problem is cost minimization of the entire production system and minimization of greenhouse gas emissions.
Methodology: Due to the NP-hard nature of the problem, the exact epsilon constraint method and MOPSO, NSGA II, and MOGWO have been used to solve the model. Also, to compare the solution methods, indices such as NPF, MSI, SM, MID, and CPU-Time have been used. The selection of the most efficient solution method has also been made with TOPSIS.
Findings: The results of the calculations showed that the NSGA II is effective in obtaining the indicators of the number of effective solution and the distance index, and the MOPSO is also in obtaining the indicators of the most spread, the average computing time, and the distance from the ideal point, and the MOGWO is also in obtaining the averages of the first objective function and The second one has worked better than other algorithms. Also, the results of the implementation of the TOPSIS method for ranking the algorithms for solving the problem of a sustainable integrated production system included obtaining a desirability weight of 0.5882 for the MOPSO, obtaining a desirability weight of 0.1397 for the MOGWO, and obtaining a desirability weight of 0.7491 for the NSGA II.
Originality/Value: This article helps the integrated production system in the production units to use the discount in the production of outsourced parts. Also, the use of the new control method of uncertainty parameters helps managers in planning production correctly. Finally, the implementation of the model requires the development of solution methods, which is considered in this paper.
Keywords: Sustainable Integrated Production System, Robust-Fuzzy-Probabilistic Optimization Method, MOGWO
1. Introduction
Sustainability affects multiple links in the supply chain and is becoming increasingly important by all relevant stakeholders. Sustainability in supply chain management (SSCM) is becoming a necessity for businesses. With a significant increase in recent research, it is evident that the topic of sustainability in supply chain management is a topic of interest to academics and industrialists (Sharda & Banerjee, 2013). Specifically, the different goals that are proposed in the sustainability of the supply chain network are the simultaneous consideration of economic aspects such as system costs, environmental aspects such as carbon dioxide emissions, and social aspects such as human aspects (Chan et al., 2017). One of the most important members of the supply chain network are production centers, which are considered as the beating heart of the supply chain network. This member is responsible for the production of deliverable products along the supply chain network. The basic principle in production centers is to design an integrated production system to respond to customer demand (Ojstersek et al., 2020). In manufacturing systems, mass customization is a method that provides the flexibility of process design systems such as job shop manufacturing systems with economic benefits in product design systems that include assembly lines or assembly production systems (Chu & Tsai, 1990). In the design of sustainable production systems, remanufacturing systems or combined remanufacturing-manufacturing systems can also be used due to the constructive social, economic and environmental effects. Sustainability in production systems means reducing production costs, using maximum returns and reproducing products, and increasing social responsibilities for increasing quality. The importance of sustainability in integrated production systems has led to the creation of various models and different solution methods in operations research problems. So far, countless researchers have turned to modeling such systems. Shirazi et al presented a mixed integer nonlinear programming model for mobile phone manufacturing system problem. This paper provides extensive coverage of important manufacturing features used in CMS design and increases the flexibility of the existing model in managing part demand fluctuations more economically by adding machine and PP stock decisions. The goals of the paper are to minimize the costs and balance the work load. AMOSA has been used to solve the problem (Shirazi et al., 2014).
The most important topic of integrated production systems is presented to design the system model of the production system in stable conditions in this paper. The existence of different models that are not controlled in uncertainty with appropriate methods, cannot accurately show its results in the real world. Hence, this article is as follows:
· Considering the sustainable in the integrated production system (economy and environmental aspects)
· Using the machine to purchase returnable products
· Considering a discount in the production of outsourced parts
· Considering uncertainty in the model and using the new optimistic-pessimistic robust-fuzzy-probabilistic control method
· Solving the model with different meta-heuristic algorithms
As stated, the objective functions of this model is to minimize the costs of the total integrated production system and minimize the amount of greenhouse emissions. Important decisions that lead to the optimization of the objectives of the problem include determining the machines usage rate in each cell, determining the optimal level of discount, the optimal allocation of flow between the levels of the production system, the number of machines used in each cell and the number of outsourcing parts for production.
2. Literature Review
Bayram & Şahin designed a multi-period dynamic production system and designed a new mathematical model. The objective function of the mathematical model was the management of intracellular and extracellular materials, the cost of purchasing machines, reconfiguration of the plan, etc. In order to solve the problem, they used the SA and genetics and stated that the methods proposed by them are better than other solutions in terms of the quality of the answer and the solution time (Bayram & Şahin, 2016). Alhourani discussed the design of the cellular production system considering the reliability of the machines as well as the routing of the production process. He stated that considering these factors, in addition to the sequence of operations and production volume, makes the problem more complicated but more realistic. As a result, mathematical methods were used to solve the designed model (Alhourani, 2016). Arampantzi & Minis proposed a new multi-objective mixed integer linear programming (MMILP) model to study the role of sustainability in supply chain network design (SSCND), as well as significant decisions in designing or redesigning high-performance sustainable supply chains. Adopted the cost objective includes investment, operating, and pollutant costs. The environmental objective takes into account the amounts of emissions and waste generation in each link of the supply chain. Social purpose considers employment opportunities, and prioritizes the development of social community and improvement of working conditions (Arampantzi & Minis, 2017). Ćwikła & Foit presented the assumptions, concepts, relationships and hardware and software equipment of the laboratory of integrated production systems, which provided the possibility of research and training for the integration of production and trade (Ćwikła & Foit, 2017). Nujoom et al. to evaluate a sustainable production system design considering the measurement of energy consumption and CO2 emissions using different energy sources (oil as a direct energy source for thermal energy production and oil or solar as an indirect energy source for production Electricity) addressed these problems. For this purpose, they developed a multi-objective mathematical model including economic and ecological constraints with the aim of minimizing total cost, energy consumption and CO2 emissions for a production system design. For the real-world scenario, the uncertainty in a number of input parameters was controlled through the development of a fuzzy multi-objective model (Nujoom et al., 2018). Golpîra et al. presented a non-deterministic planning model of the integrated production system with the aim of cost minimization. They used the robust method to control the uncertain parameter of demand and supply (Golpîra et al., 2018).
Rabbani et al. presented a new multi-objective mathematical model for dynamic coupled manufacturing system (DCMS) considering machine reliability and alternative process routes. In this dynamic model, the problem of integrated cellular production (cell/part/machine) as well as the assignment of operators to cells is modeled. The goals of the paper are to minimize the costs associated with DCMS, optimize the use of labor and minimize the amount of variance with work between different cells (Rabbani et al., 2019). Khezri et al. proposed an environmental multi-objective problem for a reconfigurable manufacturing system. The main goal of the problem was the simultaneous optimization of the total production time, hazardous environmental waste and the total costs of the problem. To solve the problem, they used multi-objective programming methods with GAMS software (Khezri et al., 2019). Sadeghi et al considered the stages of design, control and production of blood sugar products in a three-level supply chain. The first step in their paper is to design a manufacturing system based on a layered cell manufacturing system (CMS), for which a mixed integer linear programming approach is proposed to minimize the number of cells required. They simulated their problem using the OptQuest feature. The results of the statistical analysis showed that the reorder point values obtained by OptQuest changed significantly compared to the ROP values estimated at the design stage (Sadeghi et al., 2020). Tirkolaee et al. discussed the prioritization of suppliers in a sustainable supply chain integrated production system using the Fuzzy Network Analysis Process (FANP) and Fuzzy Decision Evaluation (DEMATEL) methods. Prioritization of suppliers was done using TOPSIS method. After selecting the suppliers, a three-objective model of the supply chain with the objectives of quantifying the cost of the entire chain, maximizing the weighted value of the products by considering the suppliers' priorities, and maximizing the reliability of the supply chain was designed and solved using the WGP method (Tirkolaee et al., 2020). Lufika & Meutia presented an integrated green and lean production system. This study aims to analyze waste and measure energy consumption in the production process of peeled bread based on the concept of lean and green production. VSM and EVSM exist as a tool to describe the material and energy consumption flow of the production process. Research results show energy savings of up to 0.13 kWh (Lufika & Meutia. 2021). Liu et al. proposed a new predictive maintenance method (PDM) based on deep adversarial learning enhancement (LSTM-GAN). The decision-making model provided by them considers concepts such as maintenance and maintenance personnel. Finally, they presented a case study on predictive maintenance using LSTM-GAN in intelligent manufacturing system and stated that the error prediction accuracy of LTSM-GAN is up to 99.68% (Liu et al., 2021).
Goli et al. investigated the role of AGVs and human factors as indispensable components of automation systems in the cell formation and scheduling of parts under fuzzy processing time. The proposed objective function includes minimizing the makespan and intercellular movements of parts. Due to the NP-hardness of the problem, a hybrid genetic algorithm (GA/heuristic) and a whale optimization algorithm (WOA) are developed (Goli et al., 2021). Jauhari et al. considered a two-echelon inventory model for a closed-loop supply chain system containing a manufacturer and a retailer under a stochastic environment with carbon emission reductions. The results show that by controlling the collection rate and the production allocation, the system can minimize the cost and the emissions (Jauhari et al., 2021). Sarkar & Bhuniya developed a mathematical model of this flexible manufacturing–remanufacturing system to improve the service and to maintain sustainability always. The global optimization is established theoretically and a proposition is developed (Sarkar & Bhuniya, 2022). Utama et al. reviewed the Integrated Procurement Production (IPP) inventory model problem using a systematic review of 102 published papers from 1992 to 2021. The reviewed papers were based on complexity, type of model, data, time dynamics, optimization, solution, and paper (Utama et al., 2022). Ghahremani-Nahr & Ghaderi designed a lean supply chain under uncertainty and used Fuzzy-Robust optimization model to control the uncertainty parameters. The model’s objective functions are to minimize the total cost of designing LSC networks (economic aspect), to minimize waste in production units (environmental aspect), and to maximize the overall sustainability performance indicator (SPI) (social aspect). To achieve these objectives and to identify the Pareto front, we investigated both exact and meta-heuristic methods (Ghahremani-Nahr & Ghaderi, 2022). Yu & Khan developed a three-level supply chain composed of plants, distribution centers, and retailers, and studied the location of distribution centers in the supply chain network and the carbon emissions during processing and transportation. In a random and fuzzy environment, the research objective is to minimize the supply chain’s cost and carbon emission (Yu & Khan, 2022).
The importance of two economic and environmental aspects in production system problems has led to the modeling of a dual-objective problem of a sustainable integrated production system in which the return of products and the reproduction of products to reduce environmental effects are also considered in this paper. Be paid Also, the sustainable of the system has been discussed under the title of maximum use of returned products to reproduce new orders and apply discounts in the production of outsourced parts. In the following, in Table (1), a comparison of the published papers in the field of integrated production system and research gap has been discussed.
Table 1. A summary of the literature review
Author | Year | Economic aspect | environmental | Social aspect | multi-product | multi-period | uncertainty | solution method | Offer discounts |
Kia et al | 2014 | * | - | - | * | - | - | SA | - |
Shirazi et al | 2014 | * | - | * | - | - | - | AMOSA | - |
Bayram & Şahin | 2016 | * | - | - | - | * | - | SA GA | - |
Tavakoli et al | 2018 | - | - | * | * | - | - | GAMS | - |
Golpîra et al | 2018 | * | - | - | - | - | Robust | Cplex | - |
Rabbani et al | 2019 | - | * | * | * | - | - | NSGA II MOPSO | - |
Khezri et al | 2019 | * | * | - | - | * | - | Cplex | - |
Dehnavi-Arani et al | 2019 | * | - | - | * | - | - | GAMS | - |
Raoofpanah et al | 2019 | * | - | - | * | * | - | ICA | - |
Ghanei et al | 2020 | * | * | - | - | * | - | GA | - |
Tang et al | 2020 | * | - | - | - | * | - | Cplex | - |
Assid et al | 2020 | * | - | - | - | * | Fuzzy | SA | - |
Mohtashami et al | 2020 | * | * | - | * | - | - | NSGA II | - |
Goli et al. | 2021 | * | - | - | - | - | - | WOA | - |
Jauhari et al. | 2021 | * | * | - | * | - | Stochastic | GAMS | - |
Ghahremani-Nahr & Ghaderi | 2022 | * | * | * | * | * | Robust-Fuzzy | MOGWO | - |
Yu & Khan | 2022 | * | * |
| * |
| Fuzzy | GAMS | - |
Salehi-Amiri et al. | 2022 | * |
| * |
| * | - | GAMS | - |
Rajak et al. | 2022 | * | * |
| * |
| - | GAMS | - |
current paper | 2022 | * | * | - | * | - | robust-fuzzy-probabilistic | NSGA II MOPSO MOGWO | Discounts on production outsourcing |
After examining the research gap of the problem, in this paper, a bi-objective model for a sustainable integrated production system with the bi-objective of minimizing system costs and minimizing the amount of greenhouse gas emissions and considering the sustainability of the system under the title of maximum use of returnable products It is provided to reproduce new orders and apply discounts in the production of outsourced parts. Therefore, according to the literature on the subject, so far, the discussion of the reduction in outsourcing production costs in a sustainable integrated production system under uncertainty has not been addressed. Optimistic-pessimistic robust-fuzzy-probabilistic control method as a new method in controlling model parameters has led to its complexity. Also, the MOGWO is used to solve the problem and compare it with the NSGA II and MOPSO in this paper.
As a result, the most important innovations of the article are as follows:
· Integration of integrated production system with sustainability concepts
· Using the Optimistic-pessimistic robust-fuzzy-probabilistic
· Applying discounts in the production of outsourced products in the production system
· Development of innovative methods
3. Problem Definition
Based on Fig. 1. The main goal of this research is optimal allocation of parts to machines for processing and also optimal allocation of machines to each cell. In this paper, some parts are produced in the production center and some parts are outsourced by paying a discounted production cost. Therefore, finding the amount of parts that can be processed inside the collection or outsourcing the process is also one of the most important goals of the research. Correcting strategic and tactical decisions with the aim of optimizing the costs of the entire integrated production system and the amount of greenhouse gas emissions. Since in this paper the demand, operating costs, outsourced production cost, transportation, and processing time are considered probabilistically and under conditions of uncertainty, the Robust-fuzzy-probabilistic optimization method is used to control uncertainty parameters.
Fig. 1. Sustainable integrated production system
The assumptions of the sustainable integrated production system model are as follows:
• It is a single-period and multi-product model.
• The cost of production by foreign producers is considered by applying discounts.
• Demand, operating costs, outsourced production cost, transportation and processing time are considered uncertainty and trapezoidal fuzzy numbers and in different scenarios.
• The production capacity is certain and certain.
• Each cell has a minimum and maximum limit on the allocation of machines.
Based on the definition of the above problem, the set, parameters and decision variables of the sustainable integrated production system model are described as follows.
Sets
| Set of all kinds of parts | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Set of machines | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Collection of cells | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Set of returned products | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| A set of scenarios | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Set of discount levels |
| Demand for segment i in scenario s | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Production cost per unit of parts i | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The cost of transporting materials inside the cell for each piece i | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Processing time of each piece i on machine m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Machine maintenance cost m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The cost of buying a machine m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The cost of operation on the machine m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Machine capacity m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Lower cell size limit c | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Upper cell size limit c | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Average recycling rate of part i | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| If piece i is processed by machine m, it takes the value 1 and otherwise 0. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Outsourcing cost of part i in scenario s at discount level b | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The lower limit of the production discount interval of piece i in scenario s at the discount level b | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Number of parts i used in product j | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Unit cost to obtain return product j | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Setup cost for disassembly of returned product j | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The cost of dismantling the returned product j | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The cost of destroying the returned product j | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The average time between two consecutive failures of the machine m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The average time between two consecutive machine repairs is m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The cost of machine breakdown m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The probability of occurrence of scenario s | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The amount of carbon dioxide emissions due to the processing of a piece i on machine m in cell c | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The amount of carbon dioxide gas emitted during the disassembly of the product j | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The amount of carbon dioxide gas emission in starting machine m in cell c |
| Arrival rate of part i on machine m in cell c in scenario s | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The number of outsourced parts i in scenario s | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| If piece i is processed on machine m in cell c in scenario s, the value is 1 and otherwise it is 0. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The number of machines m used in cell c | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The number of machines m to be purchased. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| machines usage rate m | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The number of returned product j for disassembly | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| The number of return product j to be obtained | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| If the returned product j is disassembled, it takes the value 1 and otherwise 0. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| If machines m is assigned to cell c, it gets 1 value and otherwise 0. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| If the piece i is processed in cell c, it takes the value 1 and otherwise 0. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| If part i is assigned at the discount level b for outsourcing in scenario s, it will be assigned a value of 1, and otherwise it will be 0. |
(1) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(2) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(3) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(4) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(5) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(6) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(7) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(8) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(9) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(10) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(11) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(12) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(13) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(14) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(15) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(16) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(17) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(18) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(19) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(20) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(21) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(22) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(23) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(24) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(25) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(26) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(27) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(28) |
|
(29) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(30) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(31) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(32) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(33) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(34) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(35) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(36) | Constraint (4) to (28) |
Machine | Cell | Part | |||
4 | 3 | 2 | 1 | ||
10 | 0 | 5 | 0 | 1 | 1 |
0 | 20 | 0 | 15 | 2 | |
5 | 6 | 0 | 0 | 1 | 2 |
0 | 0 | 7 | 10 | 2 | |
6 | 0 | 0 | 6 | 1 | 3 |
0 | 12 | 18 | 0 | 2 |
Fig. 2. The initial solution of the sustainable integrated production system problem
In the above figure, a matrix of random numbers is created, which is defined as the rate of arrival of parts to each machine and in each cell. If the intersection of the row and column of the matrix is 0, it means that the machine is not assigned to that cell to process parts in each scenario. After assembling the parts and based on the customer's demand, the difference between the demand and the produced parts is ordered to the foreign manufacturer as outsourced parts.
4.2. Comparison indices of multi-objective meta-heuristic algorithms
The following indicators are defined in order to compare meta-heuristic algorithms in the production of efficient solutions by MOPSO, NSGA II and MOGWO.
Calculation time (CPU-Time): An algorithm that has less calculation time will be more desirable.
The number of solutions in Pareto (NPF): shows the number of non-defeated solutions in the Pareto set obtained for each problem, and the higher the number of these points, the more effective the algorithm.
Maximum expansion: This criterion shows how much of the solutions of a Pareto set in the distributed solution space is calculated from equation (37). The larger value of this criterion indicates the appropriate diversity of solutions of the Pareto set.
(37) |
|
(38) |
|
(39) |
|
(40) |
|
(41) |
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(42) |
|
Algorithm | parameter | symbol | Level 1 | Level 2 | Level 3 | Optimal level | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Number of population |
| 100 | 200 | 500 | 500 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Maximum number of iterations |
| 100 | 200 | 300 | 200 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
crossover rate |
| 1 | 2 | 4 | 4 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Mutation rate |
| 1 | 2 | 4 | 1 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Maximum number of iterations |
| 100 | 200 | 500 | 500 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Number of population |
| 100 | 200 | 300 | 200 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
crossover rate |
| 0.1 | 0.3 | 0.5 | 0.5 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Mutation rate |
| 0.1 | 0.3 | 0.5 | 0.1 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Maximum number of iterations |
| 100 | 200 | 500 | 500 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Number of ppapers |
| 100 | 200 | 300 | 200 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Individual recruitment coefficient |
| 1 | 1.5 | 2 | 2 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Coefficient of collective learning |
| 1 | 1.5 | 2 | 2 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Gravity coefficient |
| 0.6 | 0.6 | 0.7 | 0.5 |
parameter | Interval boundaries | parameter | Interval boundaries | parameter | Interval boundaries | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
Sample problem | size | Part | cell | Machine | product | scenario | Discount level |
1 | small | 2 | 5 | 6 | 2 | 2 | 3 |
2 | 3 | 5 | 7 | 2 | 2 | 3 | |
3 | 4 | 6 | 7 | 2 | 2 | 3 | |
4 | 5 | 6 | 8 | 3 | 2 | 3 | |
5 | 6 | 7 | 8 | 3 | 3 | 3 | |
6 | medium | 8 | 8 | 9 | 4 | 3 | 3 |
7 | 10 | 8 | 9 | 4 | 4 | 4 | |
8 | 12 | 10 | 10 | 6 | 4 | 4 | |
9 | 14 | 10 | 12 | 6 | 5 | 4 | |
10 | 16 | 12 | 15 | 8 | 5 | 5 | |
11 | large | 20 | 15 | 18 | 10 | 6 | 5 |
12 | 25 | 18 | 21 | 12 | 6 | 5 | |
13 | 30 | 21 | 24 | 14 | 8 | 6 | |
14 | 35 | 24 | 28 | 16 | 8 | 6 | |
15 | 40 | 28 | 30 | 20 | 10 | 6 |
After designing the sample problems, in order to compare the results, the averages of the first objective function and the second objective function of the problem as well as the average computing time obtained from 3 repetitions of the algorithm are shown in Table (5). According to the results obtained from table (5), it can be seen that the epsilon constraint method is only able to solve small sample size problems up to the 5th sample problem. Therefore, to solve other sample problems in medium and large sizes, NSGA II, MOPSO and MOGWO have been used. Also, by comparing the averages of the first and second objective functions in small sample problems between the exact solution method and meta-heuristic methods He stated that there is no significant difference between the averages of the three mentioned indicators and therefore these algorithms can be used to solve problems in other sizes. Fig. 4, shows the averages of the first objective function, the second objective function, and the computational time obtained from solving sample problems in small, medium, and large sizes by epsilon constraint methods, NSGA II, MOPSO, and MOGWO.
Table 5. Average objective functions and computational time obtained from solving sample problems
Sample problem | NSGA II | MOPSO | MOGWO | Epsilon Constraint | ||||||||||||
MOBF1 | MOBF2 | Cpu time | MOBF1 | MOBF2 | Cpu time | MOBF1 | MOBF2 | Cpu time | MOBF1 | MOBF2 | Cpu time | |||||
1 | 6948.82 | 2080.08 | 18.64 | 6840.49 | 2085.40 | 26.34 | 6789.72 | 2074.17 | 27.64 | 6809.24 | 2090.67 | 146.24 | ||||
2 | 7344.16 | 2234.89 | 26.18 | 7449.75 | 2262.20 | 34.28 | 7330.59 | 2228.85 | 40.16 | 7393.56 | 2247.03 | 233.16 | ||||
3 | 8872.83 | 2607.91 | 37.20 | 8900.06 | 2574.83 | 45.68 | 8988.29 | 2564.46 | 53.63 | 8915.31 | 2580.51 | 479.15 | ||||
4 | 9990.10 | 3549.59 | 49.63 | 9886.18 | 3604.47 | 66.47 | 9843.51 | 3503.22 | 77.81 | 9901.49 | 3656.44 | 719.20 | ||||
5 | 11254.80 | 4246.54 | 72.24 | 11042.61 | 4244.82 | 91.10 | 11205.70 | 4302.83 | 106.86 | 11136.43 | 4259.75 | 1057.66 | ||||
6 | 12759.95 | 4820.19 | 103.60 | 12590.46 | 4912.48 | 124.33 | 12914.79 | 4735.45 | 146.09 | - | - | - | ||||
7 | 14935.33 | 5532.13 | 155.44 | 15062.40 | 5532.23 | 178.67 | 14875.15 | 5538.08 | 210.26 | - | - | - | ||||
8 | 15433.58 | 7558.71 | 237.13 | 15415.73 | 7425.56 | 256.64 | 15382.22 | 7606.14 | 312.92 | - | - | - | ||||
9 | 17238.10 | 7960.45 | 327.99 | 17362.57 | 7814.75 | 368.82 | 17326.34 | 7894.21 | 434.40 | - | - | - | ||||
10 | 19326.91 | 8267.58 | 420.54 | 18995.60 | 8274.74 | 476.15 | 19274.07 | 8107.35 | 560.66 | - | - | - | ||||
11 | 20092.10 | 9382.97 | 547.17 | 19768.00 | 9502.38 | 610.07 | 20481.13 | 9258.05 | 718.77 | - | - | - | ||||
12 | 25855.32 | 11382.97 | 691.34 | 26183.73 | 11484.25 | 776.53 | 25448.06 | 11324.88 | 914.63 | - | - | - | ||||
13 | 26319.01 | 14002.01 | 826.64 | 25950.40 | 14091.40 | 964.49 | 26001.20 | 13996.23 | 1134.42 | - | - | - | ||||
14 | 29107.44 | 15316.96 | 1010.15 | 29129.09 | 15606.74 | 1144.20 | 28920.56 | 15593.66 | 1347.27 | - | - | - | ||||
15 | 29241.95 | 20348.24 | 1247.64 | 29416.22 | 20592.69 | 1386.47 | 29733.60 | 19984.15 | 1633.71 | - | - | - | ||||
Average | 16981.36 | 7952.75 | 384.77 | 16932.89 | 8000.60 | 436.68 | 16967.66 | 7914.12 | 514.62 |
|
|
|
Fig. 4. Comparison of averages of objective functions and computational time between different solution methods in small to large size problems
According to Fig. 4., it can be seen that with the increase in the size of the problem, due to the increase in the number of parts and products for production or outsourcing, the costs related to the integrated production system, as well as the amount of greenhouse gas emissions due to production, reproduction, etc., have increased. Also, according to Fig. 4, it can be seen that with the increase in the problem size, the problem solving time by the epsilon constraint method up to sample problem 5 was much higher than other meta-heuristic algorithms. This is despite the fact that the averages of the first and second objective functions between the meta-heuristic and epsilon constraint solving methods are close to each other without significant differences. Also, the exponentiality of the problem solving time in larger sizes shows that the problem of the sustainable integrated production system designed in this paper is NP-hard.
Table 6. Comparison indices of meta-heuristic algorithms in small to large sample size problems
Sample problem | NSGA II | MOPSO | MOGWO | |||||||||
NPF | MSI | SM | MID | NPF | MSI | SM | MID | NPF | MSI | SM | MID | |
1 | 47 | 22033.25 | 37528.19 | 0.51 | 54 | 31617.83 | 32249.03 | 0.68 | 73 | 35276.88 | 42055.46 | 0.80 |
2 | 57 | 20785.35 | 34250.97 | 0.49 | 62 | 30805.16 | 44184.28 | 0.61 | 68 | 36110.20 | 39476.36 | 0.54 |
3 | 74 | 38664.58 | 45863.14 | 0.53 | 63 | 34108.82 | 42770.83 | 0.48 | 46 | 22085.06 | 37154.13 | 0.48 |
4 | 52 | 39431.84 | 32908.87 | 0.58 | 59 | 20100.58 | 41883.66 | 0.68 | 65 | 29395.18 | 39511.57 | 0.67 |
5 | 73 | 27218.56 | 39722.85 | 0.69 | 62 | 35650.32 | 39722.45 | 0.42 | 70 | 24381.24 | 43420.44 | 0.79 |
6 | 85 | 32884.11 | 30256.91 | 0.60 | 80 | 38537.19 | 41357.05 | 0.47 | 48 | 38454.16 | 49192.90 | 0.65 |
7 | 45 | 21658.95 | 33732.24 | 0.55 | 66 | 20164.91 | 38530.09 | 0.42 | 52 | 26406.45 | 31781.69 | 0.43 |
8 | 73 | 24158.24 | 39704.61 | 0.76 | 79 | 36492.57 | 31527.79 | 0.75 | 74 | 37150.88 | 45954.85 | 0.55 |
9 | 78 | 20792.08 | 46764.52 | 0.79 | 62 | 35346.72 | 35711.73 | 0.74 | 96 | 25196.93 | 41815.51 | 0.47 |
10 | 62 | 29387.19 | 32820.14 | 0.65 | 60 | 39942.74 | 41226.70 | 0.45 | 76 | 37561.26 | 48243.94 | 0.49 |
11 | 75 | 23001.93 | 44644.34 | 0.45 | 72 | 34553.06 | 42666.67 | 0.56 | 78 | 23765.35 | 32032.59 | 0.42 |
12 | 49 | 39826.15 | 43821.34 | 0.65 | 71 | 38390.84 | 48615.52 | 0.45 | 45 | 35183.88 | 35865.89 | 0.76 |
13 | 72 | 28541.25 | 30689.85 | 0.55 | 60 | 32839.99 | 49555.38 | 0.63 | 58 | 20633.79 | 30321.76 | 0.72 |
14 | 78 | 39107.40 | 39777.15 | 0.80 | 46 | 22106.60 | 31871.93 | 0.78 | 51 | 32846.78 | 40082.56 | 0.55 |
15 | 74 | 34484.94 | 49427.81 | 0.51 | 48 | 25363.22 | 43234.70 | 0.50 | 64 | 31337.41 | 45367.52 | 0.73 |
Average | 66.27 | 29465.05 | 38794.20 | 0.61 | 62.93 | 31734.70 | 40340.52 | 0.57 | 64.27 | 30385.70 | 40151.81 | 0.60 |
Fig. 5. Comparison indices of meta-heuristic algorithms in small to large sample size problems
According to the results of Table (5) and (6) and the examination of the overall averages of the comparison indices of meta-heuristic algorithms, it can be concluded that the NSGA II has obtained better results than other algorithms in obtaining the indices of the number of efficient solution and the spacing index. Also, the MOPSO has performed better in obtaining the indicators of the greatest expansion, the average computing time and the distance from the ideal point. Finally, the MOGWO has performed better than other algorithms in obtaining the averages of the first and second objective function. Due to the fact that different algorithms have shown their efficiency in obtaining different indices, TOPSIS method has been used to rank the algorithms.
Table 7. Indices used to rank algorithms
Algorithm | MOBF1 | MOBF2 | NPF | MSI | SM | MID | Cpu time |
NSGA II | 16981.36 | 7952.75 | 66.27 | 29465.05 | 38794.20 | 0.61 | 384.77 |
MOPSO | 16932.89 | 8000.60 | 62.93 | 31734.70 | 40340.52 | 0.57 | 436.68 |
MOGWO | 16967.66 | 7914.12 | 64.27 | 30385.70 | 40151.81 | 0.60 | 514.62 |
Preferred weight | 0.25 | 0.25 | 0.1 | 0.1 | 0.1 | 0.1 | 0.1 |
The results of the implementation of the TOPSIS method for ranking algorithms for solving the problem of sustainable integrated production system include obtaining a desirability weight of 0.5882 for the MOPSO, obtaining a desirability weight of 0.1397 for the MOGWO, and obtaining a desirability weight of 0.7491 for the NSGA II. Therefore, the NSGA II can solve the problem of the designed integrated production system more efficiently than other proposed algorithms. In the following, the first problem of the designed sample is examined and the output variables of the problem are examined with the epsilon method of limitation. Therefore, before solving the problem, the best value of the first and second objective functions of the problem has been obtained by the individual optimization method. In this method, the optimal value of the first objective function is 5436.68 in a period of 67.15 seconds and the optimal value of the second objective function is 1080 in a period of 45.26 seconds.
Table 8. The set of efficient solutions resulting from solving the problem of example 1
Efficient solutions | NSGA II | MOPSO | MOGWO | Epsilon Constraint | ||||||||
OBFV1 | OBFV2 | Cpu time | OBFV1 | OBFV2 | Cpu time | OBFV1 | OBFV2 | Cpu time | OBFV1 | OBFV2 | Cpu time | |
1 | 5599.72 | 2213 | 18.64 | 5777.11 | 2230 | 26.34 | 5590.25 | 2212 | 27.64 | 5474.93 | 2226 | 246.24 |
2 | 6664.01 | 2190 | 5857.13 | 2214 | 5604.30 | 2200 | 5493.87 | 2212 | ||||
3 | 6085.72 | 2147 | 5984.51 | 2190 | 5642.19 | 2176 | 5512.81 | 2190 | ||||
4 | 6123.66 | 2143 | 5996.10 | 2173 | 5828.28 | 2159 | 5541.97 | 2188 | ||||
5 | 6308.02 | 2129 | 6099.04 | 2164 | 5988.93 | 2156 | 6695.95 | 2109 | ||||
6 | 6557.17 | 2110 | 6207.78 | 2145 | 6095.07 | 2140 | 7136.41 | 2085 | ||||
7 | 6949.16 | 2087 | 6310.42 | 2107 | 6195.82 | 2127 | 8155.36 | 1967 | ||||
8 | 7380.31 | 2040 | 6542.79 | 2087 | 6233.26 | 2124 | 8174.30 | 1949 | ||||
9 | 7516.28 | 2037 | 6689.48 | 2074 | 6256.07 | 2118 | 9097.55 | 1890 | ||||
10 | 7937.23 | 1983 | 6766.37 | 2060 | 6319.93 | 2110 | - | - | ||||
11 | 8408.87 | 1952 | 7231.93 | 2018 | 6458.00 | 2088 | - | - | ||||
12 | 8555.64 | 1930 | 7507.42 | 2008 | 6856.27 | 2040 | - | - | ||||
13 | - | - | 8205.40 | 1956 | 7483.74 | 1993 | - | - | ||||
14 | - | - | 8484.71 | 1940 | 7892.29 | 1973 | - | - | ||||
15 | - | - | 8950.08 | 1915 | 8058.43 | 1950 | - | - | ||||
16 | - | - | - | - | 8250.81 | 1943 | - | - | ||||
17 | - | - | - | - | 8370.35 | 1930 | - | - | ||||
18 | - | - | - | - | 8991.02 | 1896 | - | - | ||||
Average | 6948.82 | 2080.08 | 18.64 | 6840.49 | 2085.40 | 26.34 | 6789.72 | 2074.17 | 27.64 | 6809.24 | 2090.67 | 246.24 |
Fig. 6, and Table (8) also show the Pareto front obtained from solving the first sample problem and the set of efficient solutions obtained from solving this sample problem with the NSGA II, MOPSO, MOGWO and epsilon method.
Fig. 6. The Pareto front obtained from solving problem example 1
According to Fig. 6, it can be seen that with the increase in the costs of the entire production system, the amount of greenhouse gas emissions has decreased due to outsourcing. Also, based on this, the Epsilon method has 8 effective solution in 246.24 seconds, the MOGWO has 18 effective solution in 27.64 seconds, the MOPSO has 15 effective solution in 26.34 seconds, and finally the NSGA II has 12 effective solution in 18.64 seconds. Table (9) shows the total number of machines and the number of machines allocated to each cell. Table (10) also shows the level of discount applied for production outsourcing.
Table 9. The number of machines assigned to each cell
| Cell 1 | Cell 2 | Cell 3 | Cell 4 | Cell 5 | Total number of machine | Usage rate |
Machine 1 | - | - | - | 2 | - | 2 | 0.967 |
Machine 2 | - | - | 1 | - | - | 1 | 0.974 |
Machine 3 | - | - | 1 | - | 2 | 3 | 0.923 |
Machine 4 | 2 | 2 | - | - | - | 4 | 0.561 |
Table 10. The level of discount applied to the production of outsourced parts
Parts | Scenario 1 | Scenario 2 | |||||
Discount level 1 | Discount level 2 | Discount level 3 | Discount level 1 | Discount level 2 | Discount level 3 | ||
Parts 1 |
|
| * | * |
|
| |
Parts 2 |
|
| * |
| * |
|
According to the results of Table (10), it can be seen that in the first scenario for the outsourced production of the first and second parts, the discount level is 3, and in the second scenario, the discount level is 1 for the first part and the second discount level is applied for the second part. In this paper, according to the use of the robust-fuzzy-probabilistic optimization method to control the uncertainty parameters, the effect of the uncertainty rate on the values of the problem's objective functions in the fuzzy optimistic, fuzzy probable and fuzzy pessimistic states has been investigated. Table (11) shows the values of the objective functions in different rates of uncertainty. According to the results obtained from the sensitivity analysis, it can be seen that with the increase of the uncertainty rate in three optimistic, probable and pessimistic states, the amount of demand has decreased and therefore the value of the first objective function, which includes the costs of the entire production system, has decreased. . On the other hand, due to the effect of this problem on the amount of greenhouse gas emissions in the production and reproduction of products, the value of the second objective function has also decreased.
Table 11. The trend of changes of the first and second objective function in different rates of uncertainty in different states of robustness
|
|
|
|
| |||
Objective function 1 | Objective function 2 | Objective function 1 | Objective function 2 | Objective function 1 | Objective function 2 | ||
0.1 | 0.9 | 10724.26 | 3471 | 10006.82 | 3471 | 9343.27 | 3471 |
0.2 | 0.8 | 9514.17 | 3360 | 8956.65 | 3360 | 8443.43 | 3360 |
0.3 | 0.7 | 6860.94 | 2614 | 6493.30 | 2614 | 6154.39 | 2614 |
0.4 | 0.6 | 5684.56 | 2226 | 5474.93 | 2226 | 5284.82 | 2226 |
0.5 | 0.5 | 4945.12 | 1533 | 4019.57 | 1533 | 3963.77 | 1533 |
0.6 | 0.4 | 2964.92 | 1118 | 2532.92 | 1118 | 2116.92 | 1118 |
0.7 | 0.3 | 2822.92 | 1118 | 2248.92 | 1118 | 1826.41 | 1118 |
0.8 | 0.2 | 1680.92 | 1118 | 1564.92 | 1118 | 1240.36 | 1118 |
0.9 | 0.1 | 1538.92 | 1118 | 1380.92 | 1118 | 1138.14 | 1118 |