A Lagrangian relaxation approach to fuzzy robust multi-objective facility location network design problem

Shishebori, Davood; Babadi, Abolghasem Yousefi; Noormohammadzadeh, Zohre

doi:10.24200/sci.2017.4447

Cited by 9 publications

(9 citation statements)

References 87 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been proven that supply chain network models are NP-hard. Hence, the literature has seen several meta-heuristics that were ordered to solve these NP-hard problems [21,55]. Besides, No Free Lunch theory says that there is no meta-heuristic to show a good performance for all optimization problems [56].…”

Section: Solution Methodsmentioning

confidence: 99%

A bi-objective production-distribution problem in a supply chain network under grey flexible conditions

et al. 2021

Self Cite

View full text Add to dashboard Cite

One of the main topics discussed in a supply chain is the production-distribution problem. Producing and distributing the products plays a key role in reducing the costs of the chain. To design a supply chain, a network of efficient management and production-distribution decisions is essential. Accordingly, providing an appropriate mathematical model for such problems can be helpful in designing and managing supply chain networks. Mathematical formulations must be drawn close to the real world due to the importance of supply chain networks. This makes those formulations more complicated. In this study, a novel multi-objective formulation is devised for the production-distribution problem of a supply chain that consists of several suppliers, manufacturers, distributors, and different customers. Also, a Mixed Integer Linear Programming (MILP) mathematical model is proposed for designing a multi-objective and multi-period supply chain network. In addition, grey flexible linear programming (GFLP) is done for a multi-objective production-distribution problem in a supply chain network. The network is designed for the first time to cope with the uncertain nature of costs, demands, and capacity parameters. In this regard, due to the NP-hardness and complexity of problems and the necessity of using meta-heuristic algorithms, NSGA-II and Fast PGA algorithm are applied and compared in terms of several criteria that emphasize the quality and diversity of the solutions.

show abstract

Section: Solution Methodsmentioning

confidence: 99%

A bi-objective production-distribution problem in a supply chain network under grey flexible conditions

et al. 2021

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since the classic solution algorithms for the capacitated location-allocation problem need a huge computational time, especially in large cases, it appears to be essential to propose an e cient solution approach to solving the model in large instances. On the other hand, the studies on location-allocation problems that utilize the Lagrangian relaxation-based solution method to solve the problem have presented the e ectiveness of this method in solving such problems [3,9,10,[18][19][20][21][22][23][24][25][26][27][28][29][30][31]. Herein, the Lagrangian Decomposition Algorithm (LDA) is proposed to solve the problem e ciently.…”

Section: Solution Methodsmentioning

confidence: 99%

Resilient Network Design in a Location-Allocation Problem with Multi-Level Facility Hardening

2018

View full text Add to dashboard Cite

Many sources of risk a ect network elements, which may lead to network failure; thus, planners need to consider them in the network design. One of the most important strategies for disruption risk management is the static resilience. In this strategy, the network functionality is maintained after the disruption event by the prevention and hardening actions. In this paper, a resilient capacitated xed-charge location-allocation model is proposed. Both facility hardening and equipping of the network with backup facilities for disrupted elements are considered together to avoid supply network failure due to random disruption. Facilities are decided to be hardened in multiple levels before disruption events. The problem is formulated as a non-linear integer programming model; then, its equivalent linear form is presented. A Lagrangian Decomposition Algorithm (LDA) is developed to solve large-scale instances. Computational results con rm the high e cacy of the proposed solution approach, compared to classical solution approaches, in dealing with large-scale problems. Moreover, the superiority of the proposed model is con rmed in comparison to the classical models.

show abstract

“…Accordingly, they suggested a protective multi-objective hub location model to protect a sustainable hub network design. Shishebori et al [41] considered an integrated, budget-constrained multiobjective location-routing problem under uncertainty. They proposed a fuzzy-based model that sought to minimize total expected costs including transshipment costs, facility location costs, and xed cost of the path.…”

Section: Reliable Facility Locationmentioning

confidence: 99%

Reliable Hierarchical Multimodal Hub Location Problem: Models and Lagrangian Relaxation Algorithm

2018

View full text Add to dashboard Cite

Hub facility location problems involve the establishment of strategic hub facilities and the allocation of demand nodes to them. Meanwhile, with the emergence of new transport and distribution networks with multi-level structures, the design of such networks has evolved. The diversity of transportation system has added multimodality to these problems. Considering the strategic nature and long-term implications of decisionmaking in this eld, the decisions shall be of high reliability. The present study is an attempt to consider the reliability of communication paths in proportion to the volume of transactions through them while covering all of the above-mentioned issues in hub location problems at the same time. Incorporating hierarchical characteristics of the problem into the model, one can obtain a signi cantly enhanced model in terms of multimodality and reliability. A Lagrangian solution method was developed considering the strategic level of the problem and the importance of the solution accuracy. The model was then validated in terms of time and quality.

show abstract

A Lagrangian relaxation approach to fuzzy robust multi-objective facility location network design problem

Cited by 9 publications

References 87 publications

A bi-objective production-distribution problem in a supply chain network under grey flexible conditions

A bi-objective production-distribution problem in a supply chain network under grey flexible conditions

Resilient Network Design in a Location-Allocation Problem with Multi-Level Facility Hardening

Reliable Hierarchical Multimodal Hub Location Problem: Models and Lagrangian Relaxation Algorithm

Contact Info

Product

Resources

About