Search results

Pre-positioning and distributing relief items are important parts of disaster management as it simultaneously considers activities from both pre- and post-disaster stages. This study aims to address this problem with a novel mathematical model.

In this research, a bi-objective mixed-integer linear programming model is developed to tackle pre-positioning and distributing relief items, and it is formulated as an integrated location-allocation-routing problem with uncertain parameters. The humanitarian supply chain consists of relief facilities (RFs) and demand points (DPs). Perishable and imperishable relief commodities (RCs), different types of vehicles, different transportation modes, a time window for delivering perishable commodities and the occurrence of unmet demand are considered. A scenario-based game theory is applied for purchasing RCs from different suppliers and an integrated best-worst method-technique for order of preference by similarity to ideal solution technique is implemented to determine the importance of DPs. The proposed model is used to solve several random test problems for verification, and to validate the model, Iran’s flood in 2019 is investigated as a case study for which useful managerial insights are provided.

Managers can effectively adjust their preferences towards response time and total cost of the network and use sensitivity analysis results in their decisions.

The model locates RFs, allocates DPs to RFs in the pre-disaster stage, and determines the routing of RCs from RFs to DPs in the post-disaster stage with respect to minimizing total costs and response time of the humanitarian logistics network.

The study aims to optimize truck routes by minimizing social and economic costs. It introduces a strategy involving diverse drones and their potential for reusing at DNs based on flight range. In HTDRP-DC, trucks can select and transport various drones to LDs to reduce deprivation time. This study estimates the nonlinear deprivation cost function using a linear two-piece-wise function, leading to MILP formulations. A heuristic-based Benders Decomposition approach is implemented to address medium and large instances. Valid inequalities and a heuristic method enhance convergence boundaries, ensuring an efficient solution methodology.

Research has yet to address critical factors in disaster logistics: minimizing the social and economic costs simultaneously and using drones in relief distribution; deprivation as a social cost measures the human suffering from a shortage of relief supplies. The proposed hybrid truck-drone routing problem minimizing deprivation cost (HTDRP-DC) involves distributing relief supplies to dispersed demand nodes with undamaged (LDs) or damaged (DNs) access roads, utilizing multiple trucks and diverse drones. A Benders Decomposition approach is enhanced by accelerating techniques.

Incorporating deprivation and economic costs results in selecting optimal routes, effectively reducing the time required to assist affected areas. Additionally, employing various drone types and their reuse in damaged nodes reduces deprivation time and associated deprivation costs. The study employs valid inequalities and the heuristic method to solve the master problem, substantially reducing computational time and iterations compared to GAMS and classical Benders Decomposition Algorithm. The proposed heuristic-based Benders Decomposition approach is applied to a disaster in Tehran, demonstrating efficient solutions for the HTDRP-DC regarding computational time and convergence rate.

Current research introduces an HTDRP-DC problem that addresses minimizing deprivation costs considering the vehicle’s arrival time as the deprivation time, offering a unique solution to optimize route selection in relief distribution. Furthermore, integrating heuristic methods and valid inequalities into the Benders Decomposition approach enhances its effectiveness in solving complex routing challenges in disaster scenarios.

The supply chain (SC) of the fast-moving consumer goods (FMCG) sector in India witnessed a significant change soon after introducing the Goods and Services Tax (GST). With the initiation of this tax, companies started moving from individual state-wise warehouses to consolidation warehouses model to save costs. This paper proposes a model that frames a mathematical formulation to optimize the distribution network in the downstream SC by considering the complexities of multi-product lines, multi-transport modes and consolidated warehouses.

The model is designed as mixed-integer linear programming (MILP), and an algorithm is developed that works on the feedback loop mechanism. It optimizes the transportation and warehouses rental costs simultaneously with impact analysis.

Total cost is primarily influenced by the critical factor transportation price rather than the warehouse rent. The choice of warehouses at prime locations was a trade-off between a lower distribution cost and higher rent tariffs.

The study enables FMCG firms to plan their downstream SC efficiently and to be in line with the recent trend of consolidation of warehouses. The study will help SC managers solve complexities such as multi-product categories, truck selection and consolidation warehouse selection problems and find the optimum value for each.

The issues addressed in the proposed work are transporting products with different sizes and weights, selecting consolidated warehouses, selecting suitable vehicles for transportation and optimizing distance in the distribution network by considering consolidated warehouses.

Recently, electric vehicles have been widely used in the cold chain logistics sector to reduce the effects of excessive energy consumption and to support environmental friendliness. Considering the limited battery capacity of electric vehicles, it is vital to optimize battery charging during the distribution process.

This study establishes an electric vehicle routing model for cold chain logistics with charging stations, which will integrate multiple distribution centers to achieve sustainable logistics. The suggested optimization model aimed at minimizing the overall cost of cold chain logistics, which incorporates fixed, damage, refrigeration, penalty, queuing, energy and carbon emission costs. In addition, the proposed model takes into accounts factors such as time-varying speed, time-varying electricity price, energy consumption and queuing at the charging station. In the proposed model, a hybrid crow search algorithm (CSA), which combines opposition-based learning (OBL) and taboo search (TS), is developed for optimization purposes. To evaluate the model, algorithms and model experiments are conducted based on a real case in Chongqing, China.

The result of algorithm experiments illustrate that hybrid CSA is effective in terms of both solution quality and speed compared to genetic algorithm (GA) and particle swarm optimization (PSO). In addition, the model experiments highlight the benefits of joint distribution over individual distribution in reducing costs and carbon emissions.

The optimization model of cold chain logistics routes based on electric vehicles provides a reference for managers to develop distribution plans, which contributes to the development of sustainable logistics.

In prior studies, many scholars have conducted related research on the subject of cold chain logistics vehicle routing problems and electric vehicle routing problems separately, but few have merged the above two subjects. In response, this study innovatively designs an electric vehicle routing model for cold chain logistics with consideration of time-varying speeds, time-varying electricity prices, energy consumption and queues at charging stations to make it consistent with the real world.

This paper aims to focus on a medical goods distribution problem and pharmacological waste collection by plug-in hybrid vehicles with some real-world restrictions. In this research, considering alternative energy sources and simultaneous pickup and delivery led to a decrease in greenhouse gas emissions and distribution costs, respectively.

Here, this problem has been modeled as mixed-integer linear programming with the traveling and energy consumption costs objective function. The GAMS was used for model-solving in small-size instances. Because the problem in this research is an NP-hard problem and solving real-size problems in a reasonable time is impossible, in this study, the artificial bee colony algorithm is used.

Then, the algorithm results are compared with a simulated annealing algorithm that recently was proposed in the literature. Finally, the results obtained from the exact solution and metaheuristic algorithms are compared, analyzed and reported. The results showed that the artificial bee colony algorithm has a good performance.

In this paper, medical goods distribution with pharmacological waste collection is studied. The paper was focused on plug-in hybrid vehicles with simultaneous pickup and delivery. The problem was modeled with environmental criteria. The traveling and energy consumption costs are considered as an objective function.

This study presents a systematic literature review (SLR) of the interdisciplinary literature on drones in last-mile delivery (LMD) to extrapolate pertinent insights from and into the logistics management field.

Rooting their analytical categories in the LMD literature, the authors performed a deductive, theory refinement SLR on 307 interdisciplinary journal articles published during 2015–2022 to integrate this emergent phenomenon into the field.

The authors derived the potentials, challenges and solutions of drone deliveries in relation to 12 LMD criteria dispersed across four stakeholder groups: senders, receivers, regulators and societies. Relationships between these criteria were also identified.

This review contributes to logistics management by offering a current, nuanced and multifaceted discussion of drones' potential to improve the LMD process together with the challenges and solutions involved.

The authors provide logistics managers with a holistic roadmap to help them make informed decisions about adopting drones in their delivery systems. Regulators and society members also gain insights into the prospects, requirements and repercussions of drone deliveries.

This is one of the first SLRs on drone applications in LMD from a logistics management perspective.

Disruptions at ports may destroy the planned ship schedules profoundly, which is an imperative operation problem that shipping companies need to overcome. This paper attempts to help shipping companies cope with port disruptions through recovery scheduling.

This paper studies the ship coping strategies for the port disruptions caused by severe weather. A novel mixed-integer nonlinear programming model is proposed to solve the ship schedule recovery problem (SSRP). A distributionally robust mean conditional value-at-risk (CVaR) optimization model was constructed to handle the SSRP with port disruption uncertainties, for which we derive tractable counterparts under the polyhedral ambiguity sets.

The results show that the size of ambiguity set, confidence level and risk-aversion parameter can significantly affect the optimal values, decision-makers should choose a reasonable parameter combination. Besides, sailing speed adjustment and handling rate adjustment are effective strategies in SSRP but may not be sufficient to recover the schedule; therefore, port skipping and swapping are necessary when multiple or longer disruptions occur at ports.

Since the port disruption is difficult to forecast, we attempt to take the uncertainties into account to achieve more meaningful results. To the best of our knowledge, there is barely a research study focusing on the uncertain port disruptions in the SSRP. Moreover, this is the first paper that applies distributionally robust optimization (DRO) to deal with uncertain port disruptions through the equivalent counterpart of DRO with polyhedral ambiguity set, in which a robust mean-CVaR optimization formulation is adopted as the objective function for a trade-off between the expected total costs and the risk.

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.

Supply chain risk management can effectively reduce the loss of retailers. In this regard, retailers need to consider the competition risks of competitors in addition to the disruption risks. This paper designs a resilient retail supply chain network for perishable foods under the dynamic competition to maximize retailer's profits.

A two-stage mixed-integer non-linear model is presented for designing the supply chain network. In the first stage, an equilibrium model that considers the characteristics of perishable foods is developed. In the second stage, a mixed integer non-linear programming model is presented to deal with the strategic decisions. Finally, an efficient memetic algorithm is designed to deal with large-scale problems.

The optimal the selection of suppliers, distribution centers and the order allocation are found among the supply chain entities. Considering the perishability of agri-food products, the equilibrium retail price and selling quantity are determined. Through a numerical example, the optimal inventory period under different maximum shelf life and the impact of three resilient strategies on retailer's profit, selling price and selling quantity are analyzed.

As for future research, the research can be extended in a number of directions. First, this paper studies the retail supply chain network design problem under competition among retailers. It can be an interesting direction to consider retailers competing with suppliers. Second, the authors can try to linearize the non-linear model and solve the large-scale integer programming problem by exact algorithm. Finally, the freshness of perishable foods gradually declines linearly to zero as the maximum shelf life approaches, and it would be a meaningful attempt to consider the freshness of perishable foods declines exponentially.

This paper innovatively designs the resilient supply chain network for perishable foods under dynamic competition. The retailer's dynamic competition and resilient strategies are considered simultaneously when designing supply chain network for perishable foods. In addition, this paper gives insights into how to obtain the optimal inventory period and compare the retailer's resilient strategies.

Every day, small and big incidents happen all over the world, and given the human, financial and spiritual damage they cause, proper planning should be sought to deal with them so they can be appropriately managed in times of crisis. This study aims to examine humanitarian supply chain models.

A new model is developed to pursue the necessary relations in an optimal way that will minimize human, financial and moral losses. In this developed model, in order to optimize the problem and minimize the amount of human and financial losses, the following subjects have been applied: magnitude of the areas in which an accident may occur as obtained by multiple attribute decision-making methods, the distances between relief centers, the number of available rescuers, the number of rescuers required and the risk level of each patient which is determined using previous data and machine learning (ML) algorithms.

For this purpose, a case study in the east of Tehran has been conducted. According to the results obtained from the algorithms, problem modeling and case study, the accuracy of the proposed model is evaluated very well.

Obtaining each injured person's priority using ML techniques and each area's importance or risk level, besides developing a bi-objective mathematical model and using multiple attribute decision-making methods, make this study unique among very few studies that concern ML in the humanitarian supply chain. Moreover, the findings validate the results and the model's functionality very well.