TY - JOUR ID - 11740 TI - A Multi-Objective Model for Location-Routing Problem Considering Minimal Risk and Maximal Demand Covering JO - Industrial Management Studies JA - JIMS LA - en SN - 2251-8029 AU - alinezhad, alireza AU - kazemi, Abolfazl AU - Karimi, Marzieh AD - Associate Professor, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran AD - Ph.D. Candidate in Industrial Engineering, Department of Industrial Engineering, Faculty of Engineering, University of Yazd, Yazd, Iran Y1 - 2020 PY - 2020 VL - 18 IS - 58 SP - 105 EP - 138 KW - Location KW - Routing KW - Mathematical programming model KW - Multi-Objective Meta-Heuristic Algorithms KW - Taguchi method DO - 10.22054/jims.2020.36793.2184 N2 - Location, routing and allocation decisions in supply chain management philosophy is undoubtedly one of the most important issues have very effect on the supply chain cost reduction and customer satisfaction. This paper presents an integrated approach to the distribution network. The objective functions of the proposed mathematical model consist of minimizing the total costs associated with transportation and warehouse rental costs and also minimize the risk of the system. The model has high computational complexity and the exact method of solving it is not possible in a reasonable time. To solve the proposed model a multi-objective meta-heuristic algorithm which, known as the objective harmony search algorithm is presented. To demonstrate the effectiveness and efficiency of the proposed algorithm in solving the model, algorithm parameters are adjusted in the best possible rates using the Taguchi method. Then a random sample of the issues generated and the performance of the proposed algorithm comparing with NSGA-ǁ and NRGA are evaluated UR - https://jims.atu.ac.ir/article_11740.html L1 - https://jims.atu.ac.ir/article_11740_224972026004de4a79068a38561b772b.pdf ER -