Search results

Supply chain (SC) research has boomed over the past two decades. Significant contributions have been made to the field from various analytical and decision-making perspectives. This paper, a comprehensive bibliometric study, aims to identify the key research contributors, institutions and themes.

A comprehensive knowledge domain visualization of over 1,000 articles, published between 2000 and 2022, is carried out to construct a bird’s eye view of the field in terms of research production, key authors, main publication outlets, geographic disparity of the contributions and emerging research trends. Additionally, collaboration patterns among researchers and institutions are mapped to highlight the communication networks underlying research initiatives.

Results show an explosive growth in the number of articles tackling supply chain optimization (SCO) issues with a significant concentration of the contributions in a relatively small cluster of authors, journals, institutions and countries. Among the many important findings, our analysis indicates that mixed-integer linear programming is the most commonly used model, while robust optimization is the method of choice for handling uncertainty. Furthermore, most SC models are developed at only one level of the organizational hierarchy and consider only one planning horizon. The importance of developing integrated SCO systems is key for future research.

The study fills the optimization techniques gap that exists in SC management bibliometric studies and presents a thematic map for the SCO research highlighting the various research foci.

The rise of remote work increasingly requires organizations to coordinate a single large, consolidated talent pool into ad-hoc, short-term project teams on demand. This problem involves many simultaneous considerations including project revenues and rejection costs, conflicting projects and roles, worker assignment costs, worker utilization preferences and limits, worker reassignment costs, and arbitrary role start and end times. Moreover, plans must be continuously updated in response to changing circumstances. This paper addresses the problem of dynamic virtual team planning and coordination.

We show this problem is NP-hard and provide a dynamic mixed integer linear programming (MILP) formulation for both optimal initial plan generation as well as continuous plan adjustment and re-optimization. We utilized a factorial experiment design to generate benchmark problems spanning a wide range of characteristics and conducted extensive computational experimentation using a common MILP solver.

Exactly optimal solutions to large, realistically sized problems were consistently obtained in short amounts of time. All observed solution times were sufficient to support the operational decision-making requirements of real-world virtual team coordination, demonstrating the viability of this approach.

The approach developed in this research can enable organizations to optimally coordinate virtual teams on a large scale and continually adjust plans in response to changing circumstances, all in an automated manner.

This paper addresses a new and complex problem of increasing importance to organizations due to the rise in remote work. We provide a problem formulation and exact approach for optimally solving both the planning and re-planning aspects of this problem.

This paper studies the location-inventory problem (LIP) in pallet pooling systems to improve resource utilization and save logistics costs, which is a new extension of the classical LIP and also an application of the LIP in pallet pooling systems.

A mixed-integer linear programming is established, considering the location problem of pallet pooling centers (PPCs) with multi-level capacity, multi-period inventory management and bi-directional logistics. Owing to the computational complexity of the problem, a hybrid genetic algorithm (GA) is then proposed, where three local searching strategies are designed to improve the problem-solving efficiency. Lastly, numerical experiments are carried out to validate the feasibility of the established model and the efficiency of the proposed algorithm.

The results of numerical experiments show that (1) the proposed model can obtain the integrated optimal solution of the location problem and inventory management, which is better than the two-stage model and the model with single-level capacity; (2) the total cost and network structure are sensitive to the number of PPCs, the unit inventory cost, the proportion of repairable pallets and the fixed transportation cost and (3) the proposed hybrid GA shows good performance in terms of solution quality and computational time.

The established model extends the classical LIP by considering more practical factors, and the proposed algorithm provides support for solving large-scale problems. In addition, this study can also offer valuable decision support for managers in pallet pooling systems.

Disaster management and humanitarian logistics (HT) play crucial roles in large-scale events such as earthquakes, floods, hurricanes and tsunamis. Well-organized disaster response is crucial for effectively managing medical centres, staff allocation and casualty distribution during emergencies. To address this issue, this study aims to introduce a multi-objective stochastic programming model to enhance disaster preparedness and response, focusing on the critical first 72 h after earthquakes. The purpose is to optimize the allocation of resources, temporary medical centres and medical staff to save lives effectively.

This study uses stochastic programming-based dynamic modelling and a discrete-time Markov Chain to address uncertainty. The model considers potential road and hospital damage and distance limits and introduces an a-reliability level for untreated casualties. It divides the initial 72 h into four periods to capture earthquake dynamics.

Using a real case study in Istanbul’s Kartal district, the model’s effectiveness is demonstrated for earthquake scenarios. Key insights include optimal medical centre locations, required capacities, necessary medical staff and casualty allocation strategies, all vital for efficient disaster response within the critical first 72 h.

This study innovates by integrating stochastic programming and dynamic modelling to tackle post-disaster medical response. The use of a Markov Chain for uncertain health conditions and focus on the immediate aftermath of earthquakes offer practical value. By optimizing resource allocation amid uncertainties, the study contributes significantly to disaster management and HT research.

From a supply chain perspective, logistics firms collaborate with other supply chain members to extend their business scope. Investment in circular economy projects in the supply chain can not only broaden the scope of business but also increase the value of the entire supply chain. Third-party logistics companies are gradually participating in the construction and operation of many circular economy projects. How to coordinate multiple circular economy supply chain projects is at the core of its operation.

This paper first analyzes some typical supply chain projects in China and summarizes the main features of these projects. Secondly, considering the benefits of the project and the stakes of each project, a multi-stage stochastic programming model is established. Finally, Cplex, nested decomposition, LocalSolver and other methods are adopted to simulate and analyze the model.

The final experimental results find that the importance of coordinating multiple circular economy supply chain projects to increase the value of the entire supply chain. The multi-stage stochastic programming model presented in this research can provide a useful tool for logistics enterprises and third-party logistics companies to optimize their investment decisions and maximize their profits in the context of a circular economy.

There are still some limitations to this study; for example, it is limited to the analysis of circular economy supply chain projects in China. The study focused on third-party logistics companies, and other enterprises in the circular economy supply chain were not considered. The research also assumed that the benefits of each circular economy project and the stakes of each project were known, which may not always be the case in real-world scenarios.

This manuscript found that investing in other circular economy projects in the supply chain can broaden the scope of business and increase the value of the entire supply chain. Third-party logistics companies are gradually participating in the construction and operation of many circular economy projects, such as recycling and repurposing initiatives. It highlights the importance of coordinating multiple circular economy supply chain projects to increase the value of the entire supply chain. The multi-stage stochastic programming model presented in this research can provide a useful tool for logistics enterprises and third-party logistics companies to optimize their investment decisions and maximize their profits in the context of a circular economy.

This paper aims to study the establishment of cooperative supply game model considering transportation hub location, and design the profit allocation rule of the cooperative supply coalition.

Based on the economic lost-sizing (ELS) game model and considering the location of transportation hub and the topology design of basic traffic network, we build a supply game model to maximize the profit of cooperative supply coalition. Based on the principle of proportion and the method of process allocation, we suppose the procedural proportional solution of the supplier cooperative supply game.

Through numerical examples, the validity and applicability of the proposed model and the procedural proportional solution were verified by comparing the procedural proportional solution with the weighted Shapley value, the equal division solution and the proportional rule.

This paper constructs a feasible mixed integer programming model for cooperative supply game. We also provide the algorithm of the allocation rule of cooperative supply game and the property analysis of the allocation rule.

The purpose of this study is to formulate a new class of vehicle routing problem with an objective to minimise the total cost of raw material collection and derive a new approach to solve optimization problems. This study can help to select the optimum number of suppliers based on cost.

To model the raw material vehicle routing problem, a mixed integer linear programming (MILP) problem is formulated. An interesting phenomenon added to the proposed problem is that there is no compulsion to visit all suppliers. To guarantee the demand of semiconductor industry, all visited suppliers should reach a given raw material capacity requirement. To solve the proposed model, the authors developed a novel hybrid approach that is a combination of block and edge recombination approaches. To avoid bias, the authors compare the results of the proposed methodology with other known approaches, such as genetic algorithms (GAs) and ant colony optimisation (ACO).

The findings indicate that the proposed model can be useful in industries, where multiple suppliers are used. The proposed hybrid approach provides a better sequence of suppliers compared to other heuristic techniques.

The data used in the proposed model is generated based on previous literature. The problem derives from the assumption that semiconductor industries use a variety of raw materials.

This study provides a new model and approach that can help practitioners and policymakers select suppliers based on their logistics costs.

This study provides two important contributions in the context of the supply chain. First, it provides a new variant of the vehicle routing problem in consideration of raw material collection; and second, it provides a new approach to solving optimisation problems.

Throughout human history, the occurrence of disasters has been inevitable, leading to significant human, financial and emotional consequences. Therefore, it is crucial to establish a well-designed plan to efficiently manage such situations when disaster strikes. The purpose of this study is to develop a comprehensive program that encompasses multiple aspects of postdisaster relief.

A multiobjective model has been developed for postdisaster relief, with the aim of minimizing social dissatisfaction, economic costs and environmental damage. The model has been solved using exact methods for different scenarios. The objective is to achieve the most optimal outcomes in the context of postdisaster relief operations.

A real case study of an earthquake in Haiti has been conducted. The acquired results and subsequent management analysis have effectively assessed the logic of the model. As a result, the model’s performance has been validated and deemed reliable based on the findings and insights obtained.

Ultimately, the model provides the optimal quantities of each product to be shipped and determines the appropriate mode of transportation. Additionally, the application of the epsilon constraint method results in a set of Pareto optimal solutions. Through a comprehensive examination of the presented solutions, valuable insights and analyses can be obtained, contributing to a better understanding of the model’s effectiveness.

The successful completion of linear infrastructure construction projects such as railroads, roads, tunnels, and pipelines relies heavily on decision-making processes during planning phase. Professionals in the construction industry emphasize that determining the starting point of a linear infrastructure construction project is one of the most important decisions to be made in the planning phase. However, the existing literature does not specifically focus on selection of the starting point of the segments to be constructed. Therefore, it is of utmost importance to develop a multi-criteria decision-making (MCDM) model to support selection of the starting point of the segments to be constructed in linear infrastructure construction projects.

Based on the characteristics of the railroad projects and insights gathered from expert interviews, the appropriate criteria for the model were determined. Once the criteria were determined, a decision hierarchy was developed and the weights of the criteria (w_i) were calculated using DEcision MAking Trial and Evaluation Laboratory (DEMATEL) method. Then, Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS), COmplex PRoportional Assessment (COPRAS), and evaluation based on distance from average solution (EDAS) methods were used. The alternatives were ranked in terms of their priority with TOPSIS method based on relative closeness (Ci) of each alternative to the ideal solution, COPRAS method based on quantitative utility (Ui) for each alternative and EDAS method based on evaluation score (ASi) for all alternatives. The results were compared with each other.

The study reveals the effects of all criteria on the proposed model. The results of DEMATEL method indicated that quantity of aggregate (w_i = 0.075), ballast (w_i = 0.071), and sub-ballast (w_i = 0.069) are the most important criteria in starting location selection for railroads, where earthquake (w_i = 0.046), excavation cost (w_i = 0.054), and longest distance from borrow pit (w_i = 0.055) were found to be less important criteria. The starting location alternatives were ranked based on TOPSIS, COPRAS and EDAS methods. The A-1 alternative was selected as the most appropriate alternative (Ci = 0.64; Ui = 100%; ASi = 0.81), followed by A-6 alternative (Ci = 0.61; Ui = 97%; ASi = 0.73) and A-7 alternative (Ci = 0.59; Ui = 94%; ASi = 0.60). Even tough different methods were used, they provided compatible results where the same ranking was achieved except three alternatives.

This study identifies novel criteria for the starting location selection of railroad construction based on the data of a railroad project. This study uses different methods for selecting the starting location. Considering the project type and its scope, the model can be used by decision-makers in linear infrastructure projects for which efficient planning and effective location selection are critical for successful operations.

The planning of massive vaccination campaigns often falls to nongovernmental organizations that have to face the critical challenge of vaccinating the largest number of people in the shortest time. This study aims to provide an easy tool for minimizing the duration of mass vaccination campaigns in rural and remote areas of developing countries.

This paper presents a linear mathematical model that combines location, scheduling and routing decisions that allows determining where to locate the vaccination centers, as well as the schedule/route that each medical team must follow to meet the target demand in the shortest time possible. In addition, the paper proposes an heuristic approach that can be integrated in a spreadsheet.

As the numerical experiments show, the proposed heuristic provides good solutions in a short time. Due to its simplicity and flexibility, the proposed approach allows decision-makers to analyze and evaluate several possible scenarios for decision-making by simply playing with input parameters.

The integration of the heuristic approach in a spreadsheet provides a simple and efficient tool to help decision-makers while avoiding the need for large investments in information systems infrastructure by user organizations.

Motivated by a real-life problem and different from previous studies, the objective of the planning is to reduce the length of the vaccination campaigns with the available resources and ensure a target coverage instead of planning for minimizing costs or maximizing coverage. Furthermore, for helping implementation to practitioners, the heuristic can be solved in a spreadsheet.