Search results

In this paper, multi-period location–inventory–routing problem (LIRP) considering different vehicles with various capacities has been investigated for the supply chain of red meat. The purpose of this paper is to reduce variable and fixed costs of transportation and production, holding costs of red meat, costs of meeting livestock needs and refrigerator rents.

The considered supply chain network includes five echelons. Demand considered for each customer is approximated as deterministic using historical data. The modeling is performed on a real case. The presented model is a linear mixed-integer programming model. The considered model is solved using general algebraic modeling system (GAMS) software for data set of the real case.

A real-world case is solved using the proposed method. The obtained results have shown a reduction of 4.20 per cent in final price of red meat. Also, it was observed that if the time periods changed from month to week, the final cost of meat per kilogram would increase by 43.26 per cent.

This paper presents a five-echelon LIRP for the meat supply chain in which vehicles are considered heterogeneous. To evaluate the capability of the presented model, a real case is solved in Iran and its results are compared with the real conditions of a firm, and the rate of improvement is presented. Finally, the impact of the changed time period on the results of the solution is examined.

This study focuses on a specific method of meat production that involves carcass purchase and meat production by packing facilities with a novel two-stage model that simultaneously considers location-routing and inventory-production operating decisions. The considered problem aims to reduce variable and fixed transportation and production costs, inventory holding cost and the cost of opening cold storage facilities.

The proposed model encompasses a two-stage model consisting of a single-echelon and a three-echelon many-to-many network with deterministic demand. The proposed model is a mixed-integer linear programming (MILP) model which was tested with the general algebraic modelling system (GAMS) software for a real-world case study in Iran. A sensitivity analysis was performed to examine the effect of retailers' holding capacity and supply capacity at carcass suppliers.

In this research, the number of products transferred at each level, the number of products held, the quantity of red meat produced, the required cold storage facilities and the required vehicles were optimally specified. The outcomes indicated a two percent (2%) decrease in cost per kg of red meat. Eventually, the outcomes of the first and second sensitivity analysis indicated that reduced retailers' holding capacity and supply capacity at carcass suppliers leads to higher total costs.

This research proposes a novel multi-period location-inventory-routing problem for the red meat supply chain in an emerging economy with a heterogeneous vehicle fleet and logistics decisions. The proposed model is presented in two stages and four-echelon including carcass suppliers, packing facilities, cold storage facilities and retailers.

This study aims to design a reliable multi-level, multi-product and multi-period location-inventory-routing three-echelon supply chain network, which considers disruption risks and uncertainty in the inventory system.

A robust optimization approach is used to deal with the effects of uncertainty, and a mixed-integer nonlinear programming multi-objective model is proposed. The first objective function seeks to minimize inventory costs, such as ordering costs, holding costs and carrying costs. It also helps to choose one of the two modes of bearing the expenses of shortage or using the excess capacity to produce at the expense of each. The second objective function seeks to minimize the risk of disruption in distribution centers and suppliers, thereby increasing supply chain reliability. As the proposed model is an non-deterministic polynomial-time-hard model, the Lagrangian relaxation algorithm is used to solve it.

The proposed model is applied to a real supply chain in the aftermarket automotive service industry. The results of the model and the current status of the company under study are compared, and suggestions are made to improve the supply chain performance. Using the proposed model, companies are expected to manage the risk of supply chain disruptions and pay the lowest possible costs in the event of a shortage. They can also use reverse logistics to minimize environmental damage and use recycled goods.

In this paper, the problem definition is based on a real case; it is about the deficiencies in the after-sale services in the automobile industry. It considers the disruption risk at the first level of the supply chain, selects the supplier considering the parameters of price and disruption risk and examines surplus capacity over distributors’ nominal capacity.

This study aims to investigate a locating-routing-allocating problems and the supply chain, including factories distributor candidate locations and retailers. The purpose of this paper is to minimize system costs and delivery time to retailers so that routing is done and the location of the distributors is located.

The problem gets closer to reality by adding some special conditions and constraints. Retail service start times have hard and soft time windows, and each customer has a demand for simultaneous delivery and pickups. System costs include the cost of transportation, non-compliance with the soft time window, construction of a distributor, purchase or rental of a vehicle and production costs. The conceptual model of the problem is first defined and modeled and then solved in small dimensions by general algebraic modeling system (GAMS) software and non-dominated sorting genetic algorithm II (NSGAII) and multiple objective particle swarm optimization (MOPSO) algorithms.

According to the solution of the mathematical model, the average error of the two proposed algorithms in comparison with the exact solution is less than 0.7%. Also, the algorithms’ performance in terms of deviation from the GAMS exact solution, is quite acceptable and for the largest problem (N = 100) is 0.4%. Accordingly, it is concluded that NSGAII is superior to MOSPSO.

In this study, since the model is bi-objective, the priorities of decision makers in choosing the optimal solution have not been considered and each of the objective functions has been given equal importance according to the weighting methods. Also, the model has not been compared and analyzed in deterministic and robust modes. This is because all variables, except the one that represents the uncertainty of traffic modes, are deterministic and the random nature of the demand in each graph is not considered.

The results of the proposed model are valuable for any group of decision makers who care optimizing the production pattern at any level. The use of a heterogeneous fleet of delivery vehicles and application of stochastic optimization methods in defining the time windows, show how effective the distribution networks are in reducing operating costs.

This study fills the gaps in the relationship between location and routing decisions in a practical way, considering the real constraints of a distribution network, based on a multi-objective model in a three-echelon supply chain. The model is able to optimize the uncertainty in the performance of vehicles to select the refueling strategy or different traffic situations and bring it closer to the state of certainty. Moreover, two modified algorithms of NSGA-II and multiple objective particle swarm optimization (MOPSO) are provided to solve the model while the results are compared with the exact general algebraic modeling system (GAMS) method for the small- and medium-sized problems.

The literature that is presently available on sustainable supply chain management (SSCM) combining optimization and industry 4.0 techniques falls short in its depictions of the recent developments, budding pertinent areas and the importance of SSCM in the growth of industrial economies around the world. This article's main objective is to analyze current trends, highlight the latest initiatives and perform a meta-analysis of the literature that is currently accessible in the SSCM area with a special focus on optimization and industry 4.0 techniques. The paper also proposes a conceptual framework that will assist in illuminating how the ideas of optimization and industry 4.0 may contribute to realizing sustainability in supply chains.

The proposed study systematically reviews 85 research publications published between 2010 and 2022 in referenced peer-reviewed journals in diverse fields, including engineering, business and management, services and healthcare. Numerous categories are considered throughout the examination of the literature, including year-wise publications, prominent journals, type of research design, concerned industry and research technique used.

The study demonstrates a deeper comprehension of the literature in the field and its evolution throughout numerous industry sectors, which is helpful for both practitioners and academics. The results from the content analysis highlight various future research opportunities in the domain.

This is one of the first research articles that have attempted to establish, analyze and highlight the current trends and initiatives in the SSCM domain from an optimization and industry 4.0 techniques viewpoint. The cluster-based future research propositions also enhance the novelty of the study.

The Russia–Ukraine war has disrupted the wheat supply worldwide. Given that wheat is one of the most important agri-food products in the world, it is necessary to pay attention to the wheat supply chain during the global crises. The use of resilience strategies is one of the solutions to face the supply chain disruptions. In addition, there is a possibility of multiple crises occurring in global societies simultaneously.

In this research, the resilience strategies of backup suppliers (BS) and inventory pre-prepositioning (IP) were discussed in order to cope with the wheat supply chain disruptions. Furthermore, the p-Robust Scenario-based Stochastic Programming (PRSSP) approach was used to optimize the wheat supply chain under conditions of disruptions from two perspectives, feasibility and optimality.

After implementing the problem of a real case in Iran, the results showed that the use of resilience strategy reduced costs by 9.33%. It was also found that if resilience strategies were used, system's flexibility and decision-making power increased. Besides, the results indicated that if resilience strategies were used and another crisis like the COVID-19 pandemic occurred, supply chain costs would increase less than when resilience strategies were not used.

In this study, the design of the wheat supply chain was discussed according to the wheat supply disruptions due to the Russia–Ukraine war and its implementation on a real case. In the following, various resilience strategies were used to cope with the wheat supply chain disruptions. Finally, the effect of the COVID-19 pandemic on the wheat supply chain in the conditions of disruptions caused by the Russia–Ukraine war was investigated.

In the present research, location and routing problems, as well as the supply chain, which includes manufacturers, distributor candidate sites and retailers, are explored. The goal of addressing the issue is to reduce delivery times and system costs for retailers so that routing and distributor location may be determined.

By adding certain unique criteria and limits, the issue becomes more realistic. Customers expect simultaneous deliveries and pickups, and retail service start times have soft and hard time windows. Transportation expenses, noncompliance with the soft time window, distributor construction, vehicle purchase or leasing, and manufacturing costs are all part of the system costs. The problem's conceptual model is developed and modeled first, and then General Algebraic Modeling System software (GAMS) and Multiple Objective Particle Swarm Optimization (MOPSO) and non-dominated sorting genetic algorithm II (NSGAII) algorithms are used to solve it in small dimensions.

According to the mathematical model's solution, the average error of the two suggested methods, in contrast to the exact answer, is less than 0.7%. In addition, the performance of algorithms in terms of deviation from the GAMS exact solution is pretty satisfactory, with a divergence of 0.4% for the biggest problem (N = 100). As a result, NSGAII is shown to be superior to MOSPSO.

Since this paper deals with two bi-objective models, the priorities of decision-makers in selecting the best solution were not taken into account, and each of the objective functions was given an equal weight based on the weighting procedures. The model has not been compared or studied in both robust and deterministic modes. This is because, with the exception of the variable that indicates traffic mode uncertainty, all variables are deterministic, and the uncertainty character of demand in each level of the supply chain is ignored.

The suggested model's conclusions are useful for any group of decision-makers concerned with optimizing production patterns at any level. The employment of a diverse fleet of delivery vehicles, as well as the use of stochastic optimization techniques to define the time windows, demonstrates how successful distribution networks are in lowering operational costs.

According to a multi-objective model in a three-echelon supply chain, this research fills in the gaps in the link between routing and location choices in a realistic manner, taking into account the actual restrictions of a distribution network. The model may reduce the uncertainty in vehicle performance while choosing a refueling strategy or dealing with diverse traffic scenarios, bringing it closer to certainty. In addition, two modified MOPSO and NSGA-II algorithms are presented for solving the model, with the results compared to the exact GAMS approach for medium- and small-sized problems.

Given the importance of estimating the demand for relief items in earthquake disaster, this research studies the complex nature of demand uncertainty in a vehicle routing problem in order to distribute first aid relief items in the post disaster phase, where routes are subject to disruption.

To cope with such kind of uncertainty, the demand rate of relief items is considered as a random fuzzy variable and a robust scenario-based possibilistic-stochastic programming model is elaborated. The results are presented and reported on a real case study of earthquake, along with sensitivity analysis through some important parameters.

The results show that the demand satisfaction level in the proposed model is significantly higher than the traditional scenario-based stochastic programming model.

In reality, in the occurrence of a disaster, demand rate has a mixture nature of objective and subjective and should be represented through possibility and probability theories simultaneously. But so far, in studies related to this domain, demand parameter is not considered in hybrid uncertainty. The worth of considering hybrid uncertainty in this study is clarified by supplementing the contribution with presenting a robust possibilistic programming approach and disruption assumption on roads.

This paper addresses a location-routing problem (LRP) under uncertainty for providing emergency medical services (EMS) during disasters, which is formulated using a robust optimization (RO) approach. The objectives consist of minimizing relief time and the total cost including location costs and the cost of route coverage by the vehicles (ambulances and helicopters).

A shuffled frog leaping algorithm (SFLA) is developed to solve the problem and the performance is assessed using both the ε-constraint method and NSGA-II algorithm. For a more accurate validation of the proposed algorithm, the four indicators of dispersion measure (DM), mean ideal distance (MID), space measure (SM), and the number of Pareto solutions (NPS) are used.

The results obtained indicate the efficiency of the proposed algorithm within a proper computation time compared to the CPLEX solver as an exact method.

In this study, the planning horizon is not considered in the model which can affect the value of parameters such as demand. Moreover, the uncertain nature of the other parameters such as traveling time is not incorporated into the model.

The outcomes of this research are helpful for decision-makers for the planning and management of casualty transportation under uncertain environment. The proposed algorithm can obtain acceptable solutions for real-world cases.

A novel robust mixed-integer linear programming (MILP) model is proposed to formulate the problem as a LRP. To solve the problem, two efficient metaheuristic algorithms were developed to determine the optimal values of objectives and decision variables.

This study aims to explore the gap between research and practice on supply chain risks due to COVID-19 by exploring the changes in global emphasis on supply chain risk research.

This work designed a research framework to compare the research of supply chain risks before and during the COVID-19 pandemic based on machining learning and text clustering and using the relevant publications of the web of science database.

The results show that scholars' attention to supply chain crisis has increased in the wake of the COVID-19 outbreak, but there are differences among countries. The United Kingdom, India, Australia, the USA and Italy have greatly increased their emphasis on risk research, while the supply chain risk research growth rate in other countries, including China, has been lower than the global level. Compared with the pre-pandemic period, the research of business finance, telecommunications, agricultural economics policy, business and public environmental occupational health increased significantly during the pandemic. The hotspots of supply chain risk research have changed significantly during the pandemic, focusing on routing problem, organizational performance, food supply chain, dual-channel supply chain, resilient supplier selection, medical service and machine learning.

This study has limitations in using a single database.

This work compared the changes in global and various countries' supply chain risk research before and during the pandemic. On the one hand, it helps to judge the degree of response of scholars to the global supply chain risk brought about by COVID-19. On the other hand, it is beneficial for supply chain practitioners and policymakers to gain an in-depth understanding of the relationship between the COVID-19 pandemic and supply chain risk, which might provide insights into not only addressing the supply chain risk but also the recovery of the supply chain.

The initial exploration of the changing extent of supply chain risk research in the context of COVID-19 provided in this paper is a unique and earlier attempt that extends the findings of the existing literature. Secondly, this research provides a feasible analysis strategy for supply chain risk research, which provides a direction and paradigm for exploring more effective supply chain research to meet the challenges of COVID-19.