A Combined Benders Decomposition and Lagrangian Relaxation Algorithm for Optimizing a Multi-Product, Multi-Level Omni-Channel Distribution System

Hendalianpour, Ayad; Fakhrabadi, Mahnaz; Sangari, Mohamad Sadegh; Razmi, Jafar

doi:10.24200/sci.2020.53644.3349

Cited by 21 publications

(13 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Constraints ( 46)-( 48) indicate that the FF policy is adopted. Constraint (49) implies the limited capacity of the blood centers, and constraint (50) implies that the quantity delivered by the vehicle cannot exceed the available capacity at the blood centers. Constraint (51) gives the s value in each scenario based on constraint (32).…”

Section: Robust Optimization Modelmentioning

confidence: 99%

See 1 more Smart Citation

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Лю

Hendalianpour²,

Razmi

et al. 2021

Complex Intell. Syst.

Self Cite

View full text Add to dashboard Cite

Supply and distribution management of blood products is a challenging task due to their short lifespan. The problem is even more sophisticated considering uncertain demand for these products. This paper addresses integrated inventory-routing of blood in a supply chain network consisting of a single supplier and a group of blood centers. Transshipment among blood centers is allowed to decrease the cost of excess inventory and shortage of goods. A mathematical model is developed that decides on the optimal quantity of supplied blood, delivery plan, inventory level, and quantity of products transshipped between blood centers with the objective of minimizing total costs. In addition, a robust optimization approach is adopted to deal with uncertainty in demand. Since the proposed model is NP-hard, a heuristic solution algorithm is developed that improves solution quality by determining the most efficient change in vehicle routes in each search stage. The efficiency of the proposed algorithm is examined in a set of numerical experiments and using data from a real case of supply and distribution management of blood platelets. The results indicated that allowing transshipment reduces the need for supply capacity at the supplier, product shortage, inventory level, and the total cost.

show abstract

Section: Robust Optimization Modelmentioning

confidence: 99%

“…The proposed solution algorithm begins with an initial solution, which is improved through an iterative cycle including two local search strategies, namely inserting the best and removing the worst solutions [49,50]. Moreover, a shocking stage is incorporated to prevent falling in local optima.…”

Section: Proposed Solution Algorithmmentioning

confidence: 99%

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Лю

Hendalianpour²,

Razmi

et al. 2021

Complex Intell. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…As mentioned, the prevalent Benders decomposition approach is the first one proposed to solve the model. Regular Benders decomposition method has been widely used in the recent studies related to the supply chain network design [39], [40]. The general steps of a typical Benders algorithm to achieve the optimal solution through upper and lower bound convergence is as follows:…”

Section: Reformulation Of the Regular Benders Decomposition Methodsmentioning

confidence: 99%

Green closed-loop supply chain network design with stochastic demand: a new accelerated benders decomposition method

Abad

Pasandideh

2020

Scientia Iranica

View full text Add to dashboard Cite

Changing the structure of supply chains to move towards less polluting industries and better performance has attracted many researchers in recent studies. Design of such networks is a process associated with uncertainties and control of the uncertainties during decision-making is of particular importance. In this paper, a two-stage stochastic programming model was presented for the design of a green closed-loop supply chain network. In order to reach the environmental goals, an upper bound of emission capability that helps governments and industries to control greenhouse gas emissions was considered. During the reverse logistics of this supply chain, waste materials are returned to the forward flow by the disassembly centers. To control the uncertainty of strategic decisions, demand and the upper bound of emission capacity with three possible scenarios is considered. To solve the model, a new accelerated Benders decomposition algorithm along with Pareto-Optimal-Cut was used. The efficiency of the proposed algorithm was compared with the regular Benders algorithm. The effect of different numerical values of parameters and probabilities of scenarios on the total cost was also examined.

show abstract

“…They mainly examine the important role of the contracts to coordinate SC under competitive conditions. Hendalianpour et al [31] aim to optimize the Omni-channel distribution network and shipping flows of products within the network. Thus, they develop a multi-objective mathematical model to minimize the costs of SC and maximize customer satisfaction by considering a multiproduct, multi-retailer system with multiple distribution channels.…”

Section: Literature Reviewmentioning

confidence: 99%

Supply Chain Contract Preferences Under Two Uncertain Selling Seasons Considering Intertemporal Inventory Capability

et al. 2021

View full text Add to dashboard Cite

We propose an intertemporal inventory decision model under demand uncertainty and retail competition. Facing the fact that different firms may have different intertemporal inventory capabilities, the paper introduces two retailers and assumes only one retailer has the ability to carry intertemporal inventories. Two different contracts, i.e., the dynamic wholesale-price contract and the commitment wholesale-price contract are proposed. The optimal decisions are derived under each contract, and all members' preferences regarding the two contracts are investigated. The results show that there exist some situations in which the supply chain members prefer the same contract, and they can reach an agreement on the contract selection. We also find that the intertemporal inventory discriminately affects the supply chain members' expected profits under two different contracts. The retailer's intertemporal inventory capability may be beneficial for all members under the dynamic wholesale-price contract, but it always damages the supplier's expected profit under the commitment wholesale-price contract. INDEX TERMS Intertemporal inventory, retail competition, dynamic contract, commitment contractThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.

show abstract

A Combined Benders Decomposition and Lagrangian Relaxation Algorithm for Optimizing a Multi-Product, Multi-Level Omni-Channel Distribution System

Cited by 21 publications

References 43 publications

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Green closed-loop supply chain network design with stochastic demand: a new accelerated benders decomposition method

Supply Chain Contract Preferences Under Two Uncertain Selling Seasons Considering Intertemporal Inventory Capability

Contact Info

Product

Resources

About