Abstract Source code understandability is a desirable quality factor affecting long-term code maintenance. Understandability of source code can be assessed in a variety of ways, including subjective evaluation of code fragments (perceived understandability), correctness, and response time to tasks performed. It can also be assessed using various source code metrics, such as cyclomatic complexity or cognitive complexity. Programming languages are evolving, giving programmers new ways to do the same things, e.g., iterating over collections. Functional solutions (lambda expressions and streams) are added to typical imperative constructs like iterators or for-each statements. This research aims to check if there is a correlation between perceived understandability, understandability measured by task correctness, and predicted by source code metrics for typical tasks that require iteration over collections implemented in Java. The answer is based on the results of an experiment. The experiment involved 99 participants of varying ages, declared Java knowledge and seniority measured in years. Functional code was perceived as the most understandable, but only in one case, the subjective assessment was confirmed by the correctness of answers. In two examples with the highest perceived understandability, streams received the worst correctness scores. Cognitive complexity and McCabe’s complexity had the lowest values in all tasks for the functional approach, but – unfortunately – they did not correlate with answer correctness. The main finding is that the functional approach to collection manipulation is the best choice for the filter-map-reduce idiom and its alternatives (e.g., filter-only). It should not be used in more complex tasks, especially those with higher complexity metrics.
{"title":"Comparing the understandability of iteration mechanisms over Collections in Java","authors":"B. Hnatkowska, Bartosz Krych","doi":"10.2478/fcds-2023-0002","DOIUrl":"https://doi.org/10.2478/fcds-2023-0002","url":null,"abstract":"Abstract Source code understandability is a desirable quality factor affecting long-term code maintenance. Understandability of source code can be assessed in a variety of ways, including subjective evaluation of code fragments (perceived understandability), correctness, and response time to tasks performed. It can also be assessed using various source code metrics, such as cyclomatic complexity or cognitive complexity. Programming languages are evolving, giving programmers new ways to do the same things, e.g., iterating over collections. Functional solutions (lambda expressions and streams) are added to typical imperative constructs like iterators or for-each statements. This research aims to check if there is a correlation between perceived understandability, understandability measured by task correctness, and predicted by source code metrics for typical tasks that require iteration over collections implemented in Java. The answer is based on the results of an experiment. The experiment involved 99 participants of varying ages, declared Java knowledge and seniority measured in years. Functional code was perceived as the most understandable, but only in one case, the subjective assessment was confirmed by the correctness of answers. In two examples with the highest perceived understandability, streams received the worst correctness scores. Cognitive complexity and McCabe’s complexity had the lowest values in all tasks for the functional approach, but – unfortunately – they did not correlate with answer correctness. The main finding is that the functional approach to collection manipulation is the best choice for the filter-map-reduce idiom and its alternatives (e.g., filter-only). It should not be used in more complex tasks, especially those with higher complexity metrics.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"19 - 37"},"PeriodicalIF":1.1,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45614098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-14DOI: 10.48550/arXiv.2212.07475
Lukasz Kami'nski, Maciej Kozlowski, Daniel Sporysz, Katarzyna Wolska, Patryk Zaniewski, Radosław Roszczyk
Abstract With a large variety of communication methods and protocols, many software architects face the problem of choosing the best way for services to share information. For communication technology to be functional and practical, it should enable developers to define a complete set of CRUD methods for the processed data. The research team compared this paper’s most commonly used data transfer protocols and concepts: REST, WebSocket, gRPC GraphQL and SOAP. A set of web servers was implemented in Python, each using one of the examined technologies. Then, the team performed an automated benchmark measuring time and data transfer overhead for a set of defined operations: creating an entity, retrieving a list of 100 entities and fetching details of one entity. Tests were designed to avoid the results being interfered with by database connection or docker-compose environment characteristics. The research team has concluded that gRPC was the most efficient and reliable data transfer method. On the other hand, GraphQL turned out to be the slowest communication method of all. Moreover, its server and client libraries caused the most problems with proper usage in a web server. SOAP did not participate in benchmarking due to limited compatibility with Python and a lack of popularity in modern web solutions.
{"title":"Comparative Review of Selected Internet Communication Protocols","authors":"Lukasz Kami'nski, Maciej Kozlowski, Daniel Sporysz, Katarzyna Wolska, Patryk Zaniewski, Radosław Roszczyk","doi":"10.48550/arXiv.2212.07475","DOIUrl":"https://doi.org/10.48550/arXiv.2212.07475","url":null,"abstract":"Abstract With a large variety of communication methods and protocols, many software architects face the problem of choosing the best way for services to share information. For communication technology to be functional and practical, it should enable developers to define a complete set of CRUD methods for the processed data. The research team compared this paper’s most commonly used data transfer protocols and concepts: REST, WebSocket, gRPC GraphQL and SOAP. A set of web servers was implemented in Python, each using one of the examined technologies. Then, the team performed an automated benchmark measuring time and data transfer overhead for a set of defined operations: creating an entity, retrieving a list of 100 entities and fetching details of one entity. Tests were designed to avoid the results being interfered with by database connection or docker-compose environment characteristics. The research team has concluded that gRPC was the most efficient and reliable data transfer method. On the other hand, GraphQL turned out to be the slowest communication method of all. Moreover, its server and client libraries caused the most problems with proper usage in a web server. SOAP did not participate in benchmarking due to limited compatibility with Python and a lack of popularity in modern web solutions.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"39 - 56"},"PeriodicalIF":1.1,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48682611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Discussions of the resiliency, sustainability, and agility of supply chains are important in the research and management of supply chains in these difficult times, considering the ongoing pandemic of COVID-19. A viable supply chain is often characterized by resiliency, sustainability, and agility in its network design. Resiliency is essential because disruption and demand fluctuations are forced upon SCs, and the effects of these for many managerial supply chains are unknown. In addition, applying novel technology in the supply chain, such as blockchain, Internet-of-Things (IoT), and artificial intelligence (AI) as agility tools can assist and enable the transition to lean production. This special issue of the Foundations of Computing and Decision Sciences is dedicated to advancements in this fields. Besides, the special issue covers instructional information about OR techniques which are useful for addressing real-world applications on such challenges.
{"title":"An Introduction to the Special Issue “Recent advances on supply chain network design”","authors":"Reza Lotfi, G. Weber","doi":"10.2478/fcds-2022-0017","DOIUrl":"https://doi.org/10.2478/fcds-2022-0017","url":null,"abstract":"Abstract Discussions of the resiliency, sustainability, and agility of supply chains are important in the research and management of supply chains in these difficult times, considering the ongoing pandemic of COVID-19. A viable supply chain is often characterized by resiliency, sustainability, and agility in its network design. Resiliency is essential because disruption and demand fluctuations are forced upon SCs, and the effects of these for many managerial supply chains are unknown. In addition, applying novel technology in the supply chain, such as blockchain, Internet-of-Things (IoT), and artificial intelligence (AI) as agility tools can assist and enable the transition to lean production. This special issue of the Foundations of Computing and Decision Sciences is dedicated to advancements in this fields. Besides, the special issue covers instructional information about OR techniques which are useful for addressing real-world applications on such challenges.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"323 - 326"},"PeriodicalIF":1.1,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43697687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Muktadi Amri Assiddiqi, S. Anantadjaya, Israr Ahmad, Kien Le, A. H. Iswanto, N. D. Trung, A. Q. A. S. Al-Sudani, D. Huy, Dhameer A. Mutlak
Abstract Recently, utilizing appropriate inventory control policy and determining the optimal selling price for various goods has been the main topic of scientific and industrial research. Inventory management policy 1 by the seller is one solution that improves the chain’s performance by creating coordination between members of the supply chain. The current study attempts to devise an integrated model of inventory pricing and control under the inventory management policy by the seller for perishable goods with shortages is considered. The purpose of presenting the model is to determine the optimal price, the optimal repayment time, and the order size, in order to maximize the profit. To acquire those optimal values, the profit functions of the buyer and the seller are taken into account. Given the results acquired, it is demonstrated that at any cost, the repayment time is unique and optimal. It is concluded that with the optimal recovery time available, the objective function is a concave function of price, and its optimal value is available. Furthermore, utilizing the inventory management policy by the seller could be a proper means to reducing retailer costs while raising their profit.
{"title":"Integrated Pricing and Inventory Control for Perishable Products, Taking into Account the Lack of Backlog and Inventory Management Policy by the Seller","authors":"Muktadi Amri Assiddiqi, S. Anantadjaya, Israr Ahmad, Kien Le, A. H. Iswanto, N. D. Trung, A. Q. A. S. Al-Sudani, D. Huy, Dhameer A. Mutlak","doi":"10.2478/fcds-2022-0020","DOIUrl":"https://doi.org/10.2478/fcds-2022-0020","url":null,"abstract":"Abstract Recently, utilizing appropriate inventory control policy and determining the optimal selling price for various goods has been the main topic of scientific and industrial research. Inventory management policy 1 by the seller is one solution that improves the chain’s performance by creating coordination between members of the supply chain. The current study attempts to devise an integrated model of inventory pricing and control under the inventory management policy by the seller for perishable goods with shortages is considered. The purpose of presenting the model is to determine the optimal price, the optimal repayment time, and the order size, in order to maximize the profit. To acquire those optimal values, the profit functions of the buyer and the seller are taken into account. Given the results acquired, it is demonstrated that at any cost, the repayment time is unique and optimal. It is concluded that with the optimal recovery time available, the objective function is a concave function of price, and its optimal value is available. Furthermore, utilizing the inventory management policy by the seller could be a proper means to reducing retailer costs while raising their profit.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"371 - 382"},"PeriodicalIF":1.1,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46527110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Daniel Darmawan, D. Kurniady, A. Komariah, Badrud Tamam, I. Muda, Harikumar Pallathadka
Abstract Nowadays, some manufacturing organizations may well face production restrictions. For example, in case the number of products goes up, the company might not be capable of producing all products. As a consequence, the company may face backlogging. In the meanwhile, in case the demand for products rises, the given company may experience a restricted capacity to react to that kind of demand properly; thus, it will suffer backlogging. Over the course of this study, that kind of company facing the mentioned circumstances is considered. To meet those exceeded demands, companies would be forced to purchase some products from outside. Thus, the study’s primary aim is to define and calculate the optimum make and buy a number of products so that overall inventory cost is reduced and optimized. To do so, a model is proposed referred to as the make-with-buy model. This model is designed and solved by exact solution software in the based branch and bound method. The results of the study confirm the feasibility and efficiency of this method and demonstrate that this model can be applied to lessen the overall inventory costs, including maintenance, order, setup, and purchasing costs, and also the total costs of products.
{"title":"Introduce a New Mathematical Approach to Inventory Management in Production Processes Under Constrained Conditions","authors":"Daniel Darmawan, D. Kurniady, A. Komariah, Badrud Tamam, I. Muda, Harikumar Pallathadka","doi":"10.2478/fcds-2022-0023","DOIUrl":"https://doi.org/10.2478/fcds-2022-0023","url":null,"abstract":"Abstract Nowadays, some manufacturing organizations may well face production restrictions. For example, in case the number of products goes up, the company might not be capable of producing all products. As a consequence, the company may face backlogging. In the meanwhile, in case the demand for products rises, the given company may experience a restricted capacity to react to that kind of demand properly; thus, it will suffer backlogging. Over the course of this study, that kind of company facing the mentioned circumstances is considered. To meet those exceeded demands, companies would be forced to purchase some products from outside. Thus, the study’s primary aim is to define and calculate the optimum make and buy a number of products so that overall inventory cost is reduced and optimized. To do so, a model is proposed referred to as the make-with-buy model. This model is designed and solved by exact solution software in the based branch and bound method. The results of the study confirm the feasibility and efficiency of this method and demonstrate that this model can be applied to lessen the overall inventory costs, including maintenance, order, setup, and purchasing costs, and also the total costs of products.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"421 - 431"},"PeriodicalIF":1.1,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44248058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
P. Chetthamrongchai, Johnry Dayupay, Sevdie Alshiqi, T. Alghazali, A. H. Iswanto, Luigi Pio Leonardo Cavaliere, Ahmed Kateb Jumaah Al-Nussairi, Karrar Hatif Mohmmed, M. Kadhim
Abstract With the globalization of markets and increasing competition in global markets, the attempts of organizations to survive in this market has increased and has resulted in the emergence of the philosophy of Supply Chain Management. There is uncertainty in the reliability of supply chain facilities for reasons such as natural disasters, terrorist attacks, labor errors, and weather conditions. Therefore, when making strategic decisions, the system will continue to operate with minimal damage. Over the course of this study, the uncertainty of supplier layers in the supply chain has been modeled. To meet that aim, the issue of supply chain, including producers, warehouses, suppliers and consumers are considered. To calculate the cost of breakdowns due to the non-functioning of distributors, the scenario-building method has been utilized. Finally, the desired model is solved with Gomez software and the results are presented. The result of the study demonstrate the efficiency of this model in the facility location decision-making in supply chains.
{"title":"Design a Mathematical Planning Approach to Optimize the Supply Chain Taking Into Account Uncertainties In Distributors","authors":"P. Chetthamrongchai, Johnry Dayupay, Sevdie Alshiqi, T. Alghazali, A. H. Iswanto, Luigi Pio Leonardo Cavaliere, Ahmed Kateb Jumaah Al-Nussairi, Karrar Hatif Mohmmed, M. Kadhim","doi":"10.2478/fcds-2022-0022","DOIUrl":"https://doi.org/10.2478/fcds-2022-0022","url":null,"abstract":"Abstract With the globalization of markets and increasing competition in global markets, the attempts of organizations to survive in this market has increased and has resulted in the emergence of the philosophy of Supply Chain Management. There is uncertainty in the reliability of supply chain facilities for reasons such as natural disasters, terrorist attacks, labor errors, and weather conditions. Therefore, when making strategic decisions, the system will continue to operate with minimal damage. Over the course of this study, the uncertainty of supplier layers in the supply chain has been modeled. To meet that aim, the issue of supply chain, including producers, warehouses, suppliers and consumers are considered. To calculate the cost of breakdowns due to the non-functioning of distributors, the scenario-building method has been utilized. Finally, the desired model is solved with Gomez software and the results are presented. The result of the study demonstrate the efficiency of this model in the facility location decision-making in supply chains.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"409 - 420"},"PeriodicalIF":1.1,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49481226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Abbasi, H. A. Khalili, M. Daneshmand-Mehr, M. Hajiaghaei-Keshteli
Abstract This paper aims to introduce a framework to measure the sustainable performance of the supply chain (SC) during the COVID-19 pandemic. The SC stakeholders in this investigation are Suppliers, Production / Remanufacturing / Refurbishing Centers (Factories), Collection / Distribution Centers, Recycling / Landfill Centers, and Customers. The suggested sustainable supply chain (SSC) performance measurement included three pillars with 23 indicators. To evaluate the overall sustainability of the SC understudy, a composite index has been developed that combines all the indicators to reflect the sustainability performance of the SC. Four steps are involved in creating a composite index:1) measuring the value of indicators, 2) weighing indicators, 3) Using the normalization technique, and 4) Evaluating the overall SSC indicator. The real case in Iran is selected as an illustrative case. Our research contributions are: We suggested a novelty indicator of SSC to better show the economic, environmental, and social tradeoffs during the COVID-19 pandemic and lockdowns. We have found and measured the negative and positive impacts of COVID-19 on aspects of sustainability in SC. Based on the achieved data of the real case study, a numerical example is represented to explain how to calculate the composite index. The main contribution of this paper is the development of SSC indicators during the COVID-19 epidemic.
{"title":"Performance Measurement of the Sustainable Supply Chain During the COVID-19 Pandemic: A real-life case study","authors":"S. Abbasi, H. A. Khalili, M. Daneshmand-Mehr, M. Hajiaghaei-Keshteli","doi":"10.2478/fcds-2022-0018","DOIUrl":"https://doi.org/10.2478/fcds-2022-0018","url":null,"abstract":"Abstract This paper aims to introduce a framework to measure the sustainable performance of the supply chain (SC) during the COVID-19 pandemic. The SC stakeholders in this investigation are Suppliers, Production / Remanufacturing / Refurbishing Centers (Factories), Collection / Distribution Centers, Recycling / Landfill Centers, and Customers. The suggested sustainable supply chain (SSC) performance measurement included three pillars with 23 indicators. To evaluate the overall sustainability of the SC understudy, a composite index has been developed that combines all the indicators to reflect the sustainability performance of the SC. Four steps are involved in creating a composite index:1) measuring the value of indicators, 2) weighing indicators, 3) Using the normalization technique, and 4) Evaluating the overall SSC indicator. The real case in Iran is selected as an illustrative case. Our research contributions are: We suggested a novelty indicator of SSC to better show the economic, environmental, and social tradeoffs during the COVID-19 pandemic and lockdowns. We have found and measured the negative and positive impacts of COVID-19 on aspects of sustainability in SC. Based on the achieved data of the real case study, a numerical example is represented to explain how to calculate the composite index. The main contribution of this paper is the development of SSC indicators during the COVID-19 epidemic.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"327 - 358"},"PeriodicalIF":1.1,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47488162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alim Al Ayub Ahmed, S. Singhal, A. S. Prakaash, Johnry Dayupay, Irwan Rahadi, Haydar Abdulameer Marhoon, A. H. Iswanto, Saja Fadhil Abbas, S. Aravindhan
Abstract The current study examines an essential type of vehicle routing problem (VRP). This type is one where customers are served by limited-capacity vehicles from multiple depots and is known as Multi-Depot Capacitated Vehicle Routing Problem (MDCVRP). The novelty of this study is that in the present case, cars, after Leaving the Depot, can go back to any other depot. Those issues seem to occur in most real-world issues where information, messages, or news are sent electronically from somewhere. The purpose of the problem is to minimize the costs associated with routing. Regarding the literature on such issues, it has been proven in previous studies and research that these problems are among the hard-NP problems, and to solve them using the metaheuristic method, the exact methods justify it. After changing the basic model, this study developed a Tabu Search (TS) algorithm. The study results demonstrate that if the equipment can return to any depot, the cost is significantly reduced in contrast to the case where equipment is forced to return to their depot.
{"title":"A Mathematical Model for the Vehicles Routing Problem with Multiple Depots, Considering the Possibility of Return Using the Tabu Search Algorithm","authors":"Alim Al Ayub Ahmed, S. Singhal, A. S. Prakaash, Johnry Dayupay, Irwan Rahadi, Haydar Abdulameer Marhoon, A. H. Iswanto, Saja Fadhil Abbas, S. Aravindhan","doi":"10.2478/fcds-2022-0019","DOIUrl":"https://doi.org/10.2478/fcds-2022-0019","url":null,"abstract":"Abstract The current study examines an essential type of vehicle routing problem (VRP). This type is one where customers are served by limited-capacity vehicles from multiple depots and is known as Multi-Depot Capacitated Vehicle Routing Problem (MDCVRP). The novelty of this study is that in the present case, cars, after Leaving the Depot, can go back to any other depot. Those issues seem to occur in most real-world issues where information, messages, or news are sent electronically from somewhere. The purpose of the problem is to minimize the costs associated with routing. Regarding the literature on such issues, it has been proven in previous studies and research that these problems are among the hard-NP problems, and to solve them using the metaheuristic method, the exact methods justify it. After changing the basic model, this study developed a Tabu Search (TS) algorithm. The study results demonstrate that if the equipment can return to any depot, the cost is significantly reduced in contrast to the case where equipment is forced to return to their depot.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"359 - 370"},"PeriodicalIF":1.1,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48699974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
N. D. Trung, D. Huy, P. Chetthamrongchai, K. Mohsen, Ahmad Syarief Iskandar, A. Nurjaya, Denok Sunarsi, Krishanveer Singh, S. Chupradit
Abstract Over the past few years, attention to environmental problems, legal necessities, and economic advantages emerging from reproduction activities has attracted attention to reverse logistics activities in the form of a closed-loop supply chain, whether in industry or scientific research. The current study aims to model competitiveness and comparison between two closed-loop three-level supply chains, each of which includes a manufacturer, a retailer, and a third party to collect the products used by the customer, taking into account the concepts of game theory and the existence of aggregates. Moreover, a separate supplier for each chain is considered. In the forward supply chain, the manufacturer produces new products using new components or re-used products that have been collected from the consumer, then sells these products mainly to the retailer, and the retailer sells them. In the reverse chain, the collector provides the used products to the manufacturer after collection. The study utilized the definitions and concepts of game theory to model this closed loop chain as a Stackelberg game to obtain the optimal value of wholesale and retail price and the optimal value of the product return coefficient for the collector. Finally, the models based on some numerical examples are solved. Given the results, the remanufacturing costs have a significant role in making more profits for all members in such chains, and competitive chains should attempt to remanufacture the products at lower costs.
{"title":"Optimizing the Interaction Between Two Closed-Loop Supply Chains Based on Inverse Logistics Using the Game Theory Method","authors":"N. D. Trung, D. Huy, P. Chetthamrongchai, K. Mohsen, Ahmad Syarief Iskandar, A. Nurjaya, Denok Sunarsi, Krishanveer Singh, S. Chupradit","doi":"10.2478/fcds-2022-0025","DOIUrl":"https://doi.org/10.2478/fcds-2022-0025","url":null,"abstract":"Abstract Over the past few years, attention to environmental problems, legal necessities, and economic advantages emerging from reproduction activities has attracted attention to reverse logistics activities in the form of a closed-loop supply chain, whether in industry or scientific research. The current study aims to model competitiveness and comparison between two closed-loop three-level supply chains, each of which includes a manufacturer, a retailer, and a third party to collect the products used by the customer, taking into account the concepts of game theory and the existence of aggregates. Moreover, a separate supplier for each chain is considered. In the forward supply chain, the manufacturer produces new products using new components or re-used products that have been collected from the consumer, then sells these products mainly to the retailer, and the retailer sells them. In the reverse chain, the collector provides the used products to the manufacturer after collection. The study utilized the definitions and concepts of game theory to model this closed loop chain as a Stackelberg game to obtain the optimal value of wholesale and retail price and the optimal value of the product return coefficient for the collector. Finally, the models based on some numerical examples are solved. Given the results, the remanufacturing costs have a significant role in making more profits for all members in such chains, and competitive chains should attempt to remanufacture the products at lower costs.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"455 - 467"},"PeriodicalIF":1.1,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45922833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Analysis of supply chain location issues and decision-making regarding the location of facilities in the supply chain is one of the most important issues in the decision-making of governments, organizations and companies. Undoubtedly, the correct location of facilities has very important effects on economic benefits, providing appropriate services and customer satisfaction. Supply chain issue is one of the most widely used issues in today’s competitive world and location issues are among the most used issues in designing supply chain networks to improve and reduce costs and increase competitiveness. The facilities under consideration include warehouses and distribution centers, which have been solved with the aim of reducing transportation costs. And then the two methods are compared. The problem is solved in small, medium and large dimensions and finally it was concluded that the firefly algorithm had a better performance than the genetic algorithm.
{"title":"Planning the location of facilities in the supply chain using the firefly meta-innovation algorithm","authors":"Sayed Ahmad Shayannia","doi":"10.2478/fcds-2022-0024","DOIUrl":"https://doi.org/10.2478/fcds-2022-0024","url":null,"abstract":"Abstract Analysis of supply chain location issues and decision-making regarding the location of facilities in the supply chain is one of the most important issues in the decision-making of governments, organizations and companies. Undoubtedly, the correct location of facilities has very important effects on economic benefits, providing appropriate services and customer satisfaction. Supply chain issue is one of the most widely used issues in today’s competitive world and location issues are among the most used issues in designing supply chain networks to improve and reduce costs and increase competitiveness. The facilities under consideration include warehouses and distribution centers, which have been solved with the aim of reducing transportation costs. And then the two methods are compared. The problem is solved in small, medium and large dimensions and finally it was concluded that the firefly algorithm had a better performance than the genetic algorithm.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"433 - 454"},"PeriodicalIF":1.1,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42501570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：