-
Open Access Article
1 - Designing a mathematical model for determining the optimal location of insurance company branches by using a hybrid Fuzzy Multi-Criteria Decision-Making methods (F-MCDM)
MANSOUR SOOFI Fatemeh DinaraSelecting location of an insurance branche often has been considered as a main problem of parent company. This research aims to deal with location problem of a new branch of Alborz insurance Co. in Guilan province based on the combination of several multi-criteria decis MoreSelecting location of an insurance branche often has been considered as a main problem of parent company. This research aims to deal with location problem of a new branch of Alborz insurance Co. in Guilan province based on the combination of several multi-criteria decision making models with fuzzy data. In the proposed model, there are five criteria and six alternatives (locations). To solve a location prioritization problem four steps are defined in this research: 1) Determination of proposed locations and selection of experts by branches managers, definition of linguistic variables and their corresponding fuzzy numbers, 2) Selection of some effective criteria among different criteria using fuzzy delphi method, 3) Pairwise comparison of the criteria and alternatives using fuzzy analytical hierarchy process method, 4) computation of mean wight of criteria for each of experts and using fuzzy logarithmic least square method, 5) Definition of a comprehensive decision matrix, 6) Definition of a fuzzy preference function, total preference matrix, calculation of positive and negative flow, calculation of net flow and defuzzification of fuzzy numbers using Chen method, 7) Determination of possibility degree and weight of each alternative. Finally, regarding to the score of each alternative, place 3 selected as the first priority and places 4, 5, 6, 1 and 2 determined as the next priorities, respectively. In this research Excel and LINGO softwares are used to run models. Manuscript profile -
Open Access Article
2 - Solving Redundancy Allocation Problem with Repairable Components Using Genetic Algorithm and Simulation Method
M. ShahriariReliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. T MoreReliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal components number of each subsystem, including the optimal number of repairmen allocated to each subsystem. Because this model belongs to Np. Hard problem, we used genetic algorithm (GA) for solving the presented model and response surface methodology (RSM) was used for tuning of algorithm parameters. Also for calculating the reliability of each subsystem (and system reliability) we used a simulation method. Finally, a numerical example was solved to test the algorithm performance. Manuscript profile -
Open Access Article
3 - Using a Hybrid NSGA-II to Solve the Redundancy Allocation Mmodel of Series-Parallel Systems
Mohammadreza Shahriari -
Open Access Article
4 - Solving a Joint Availability-Redundancy Optimization Model with Multistate Components and Metaheuristic Approach
A. H. Borhani Alamdari‎‎‎ M. Sharifiمشکل تخصیص افزونگی (RAP) یکی از مهمترین و کاربردی ترین مسائل در زمینه قابلیت اطمینان است. هدف از این مشکل یافتن پیکربندی مطلوب اجزای سیستم به منظور بهینه سازی قابلیت اطمینان سیستم تحت برخی محدودیت­ها است. در مدل کلاسیک، اجزای مولفه سیستم باینری است، به عنوان مثال، ه Moreمشکل تخصیص افزونگی (RAP) یکی از مهمترین و کاربردی ترین مسائل در زمینه قابلیت اطمینان است. هدف از این مشکل یافتن پیکربندی مطلوب اجزای سیستم به منظور بهینه سازی قابلیت اطمینان سیستم تحت برخی محدودیت­ها است. در مدل کلاسیک، اجزای مولفه سیستم باینری است، به عنوان مثال، هر مولفه آن است که آیا جزء در حال کار است یا هراب شده است. در مطالعات جدید تحقیقاتی، اجزاء به عنوان اجزاء چند حالته در نظر گرفته می شوند، به عنوان مثال، هر جزء می­تواند برخی از حالت­های عملکردی بینابینی از سالم تا خراب را دارا باشد. در این مقاله، ما بر روی مسئله RAP با اجزاء چند حالته کار کرده و نرخ عملکرد اجزاء در هر یک از حالت­های عملکردی با صرف هزینه و انجام فعالیت­های فنی و سازمانی قابل افزایش می­باشد. به دلیل آنکه مسئله تخصیص افزونگی از جمله مسائل سخت می­باشد، ما برای حل مدل ارائه شده از دو الگوریتم فراابتکاری ژنتیک و شبیه سازی تبرید استفاده کرده و همچنین از تابع مولد عمومی برای محاسبه قابلیت اطمینان سیستم استفاده کرده­ایم. Manuscript profile -
Open Access Article
5 - The Effects of Technical and Organizational Activities on Redundancy Allocation Problem with Choice of Selecting Redundancy Strategies Using the memetic algorithm
M. Sharifi MR. Shahriari A. Zaretalab -
Open Access Article
6 - مساله مکان یابی هاب تک تخصیصی ظرفیت دار دو هدفه با فرض ایمنی مسیرها
فروغ معین مقدس فرزانه فولادیمسائل مکان یابی هاب به دلیل کاربردهای بسیارشان در سیستم های حمل ونقل و توزیع از اهمیت بالایی برخوردار هستند. پیچیدگی های مسائل واقعی امروزی اغلب کاربرد مسائل تک هدفه را به چالش می کشاند. به منظور واقعی تر شدن مدل، در این مقاله مسئله دو هدفه مکان یابی پوشش هاب ظرفیت دار Moreمسائل مکان یابی هاب به دلیل کاربردهای بسیارشان در سیستم های حمل ونقل و توزیع از اهمیت بالایی برخوردار هستند. پیچیدگی های مسائل واقعی امروزی اغلب کاربرد مسائل تک هدفه را به چالش می کشاند. به منظور واقعی تر شدن مدل، در این مقاله مسئله دو هدفه مکان یابی پوشش هاب ظرفیت دار تک تخصیصی با در نظر گرفتن قابلیت اطمینان مسیرها مورد بررسی قرار می گیرد. در این مقاله علاوه بر ظرفیت برای هاب ها، هزینه های ثابتی نیز برای احداث آنها در نظرگرفته می شود. تلاش می شود همزمان با می نیمم سازی هزینه ها، امنیت ضعیف ترین مسیر شبکه نیز ماکسیمم شود. برای مسئله مفروض، سه مدل ریاضی پیشنهاد شده است. ابتدا عملکرد مدل های تک هدفه ارزیابی و پس از تعیین مدل مناسب تر، مدل دو هدفه پیشنهادی با استفاده از روش ε-محدودیت حل می شود. در این مقاله هزینه های ثابت احداث با دو روش متفاوت یکی براساس فاصله از مرکز جرم سیستم و دیگری بر اساس ظرفیت هاب ها محاسبه می شود. نتایج محاسباتی نشان می دهد که از میان سه مدل، سومین مدل ارائه شده و با هزینه های ثابت بر مبنای فاصله از مرکز جرم، دارای عملکرد بهتری است. Manuscript profile -
Open Access Article
7 - Redundancy Allocation Optimization Based on the Fuzzy Universal Generating Function approach in the Series-Parallel Systems
Mohammadreza Shahriari -
Open Access Article
8 - Set a bi-objective redundancy allocation model to optimize the reliability and cost of the Series-parallel systems using NSGA II problem
M. R. Shahriari‎ -
Open Access Article
9 - Classical Center Location Problem Under Uncertain Environment
A. Soltanpour‎‎ F. Baroughi‎‎ B. Alizadeh -
Open Access Article
10 - Stochastic Facilities location Model by Using Stochastic Programming
Ali Gholinezhad Devin Saeed Fayyaz Reza Sadeghi -
Open Access Article
11 - Dynamic Facility Location with Stochastic Demand
Ali Gholinejad Devin Katayun Abedzade Ghuchani Reza Sadeghi Hamidreza Koosha -
Open Access Article
12 - A GIS-Based Sites Selection with Maximal Covering Location Problem for bank branch Development
Fatemeh Dekamini Mohammad Ehsanifar seyed Mohsen LotfiSelecting a location is a very important decision for firms because they are costly and difficult to reverse. A poor choice of location might result in excessive transportation costs, loss of qualified labor, competitive advantage or some similar condition that would be MoreSelecting a location is a very important decision for firms because they are costly and difficult to reverse. A poor choice of location might result in excessive transportation costs, loss of qualified labor, competitive advantage or some similar condition that would be detrimental to operations.This paper proposed integration between MCDM model represented by ANP with GIS to propose the best location for construction of a new bank branch and then using maximal covering location problem to select branches that the maximum demand might be reached within a pre-specified target travel time. Bank branch location is one of the most significant strategic issues in the competitive market. In this paper, a Geographic Information System (GIS) based model for locating suitable sites is presented to make new branches, and then maximal covering location problem (MCLP) is used to select branches such that the maximum demand might be reached within a pre-specified target travel time. The model was implemented for Mehr Eqtesad bank in Arak city, Iran. In the future research, it is recommended to study reconstruction of bank branches. Moreover, applying this model on more complex problems is a challenging area for future studies. Manuscript profile -
Open Access Article
13 - the use of the tabu search metaheuristic to solve location problems: a review
Alireza BitarafIn this paper, a detailed review of the application of the Tabu search method on location problems is reviewed. For this purpose, first the concept of locationing and different types of location problems are introduced and then the components of the Tabu search method a MoreIn this paper, a detailed review of the application of the Tabu search method on location problems is reviewed. For this purpose, first the concept of locationing and different types of location problems are introduced and then the components of the Tabu search method are described in detail. The purpose of locationing is to find new suitable locations for setting up facility location. Today, increasing competition between companies has made it very important to study location problems. There are various methods for solving location problems. In recent decades, various metaheuristic methods have been introduced to solve such problems. Ultra-innovative methods use innovative ideas to solve problems with large data and dimensions. One of the metaheuristic methods is the tabu search algorithm, which is based on local search and gives desirable results in solving location problems. This algorithm has various components which are introduced in detail in this paper. The components that some researchers have added to this method to improve its performance are also introduced. In this paper, a detailed review of the application of the Tabu search method on location problems is reviewed. For this purpose, first the concept of locationing and different types of location problems are introduced and then the components of the Tabu search method are described in detail. The purpose of locationing is to find new suitable locations for setting up facility location. Today, increasing competition between companies has made it very important to study location problems. There are various methods for solving location problems. In recent decades, various metaheuristic methods have been introduced to solve such problems. Ultra-innovative methods use innovative ideas to solve problems with large data and dimensions. One of the metaheuristic methods is the tabu search algorithm, which is based on local search and gives desirable results in solving location problems. This algorithm has various components which are introduced in detail in this paper. The components that some researchers have added to this method to improve its performance are also introduced. Manuscript profile -
Open Access Article
14 - Joint Inspecting Interval Optimization and Redundancy Allocation Problem Optimization for Cold-Standby Systems with Non-Identical Components
Mani Sharifi -
Open Access Article
15 - Developing a Decision Model as Budget Assignment Method for Locating Industrial Facilities: Real Case Study
Parsa Fallah Sheikhlari Seyed Habib A Rahmati -
Open Access Article
16 - Using NSGA II Algorithm for a Three Objectives Redundancy Allocation Problem with k-out-of-n Sub-Systems
mani sharifi Pedram Pourkarim Guilani mohammadreza shahriari -
Open Access Article
17 - Optimization of Multi-period Three-echelon Citrus Supply Chain Problem
Navid Sahebjamnia Fariba Goodarzian Mostafa Hajiaghaei-Keshteli -
Open Access Article
18 - Developing a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming
Parham Azimi Abulfazl Asadollahi -
Open Access Article
19 - Developing a Transfer Point Location Problem Considering Normal Demands Distribution
Ammar Mollaie Soroush Avakh Darestani Deneise Dadd -
Open Access Article
20 - Genetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy
Aida Karimi Mani Sharifi Amirhossain Chambari -
Open Access Article
21 - Reliability Modelling of the Redundancy Allocation Problem in the Series-parallel Systems and Determining the System Optimal Parameters
Mani Sharifi Mohsen Yaghoubizadeh -
Open Access Article
22 - A New Hybrid Algorithm to Optimize Stochastic-fuzzy Capacitated Multi-Facility Location-allocation Problem
Esmaeil Mehdizadeh Mohammad Reza Tavarroth Vahid Hajipour -
Open Access Article
23 - Facility Location and Inventory Balancing in a Multi-period Multi-echelon Multi-objective Supply Chain: An MOEA Approach
Seyed Habib A. Rahmati Abbas Ahmadi Behrooz Karimi -
Open Access Article
24 - A New Approach for Solving Fuzzy Single Facility Location Problem Under L1 Norm
Nemat Allah Taghi-Nezhad Fatemeh Taleshian -
Open Access Article
25 - Uncertain Location of Network Structured Production Units
Azam Azodi Jafar Fathali Mojtaba Ghiyasi Tahere SayarFacility location problems are one of the most important issues for healthcare organizations and centers to achieve social welfare and respond to customer needs. Proper distribution of health and treatment facilities in cities is vital to minimize costs and improve the MoreFacility location problems are one of the most important issues for healthcare organizations and centers to achieve social welfare and respond to customer needs. Proper distribution of health and treatment facilities in cities is vital to minimize costs and improve the efficiency of health centers. The main contribution of the current article is dealing with the uncertainty issue in the p-median location-efficient problem. In this article, the p-median location problem along with network data envelopment analysis (Network DEA) is used in parallel mode to calculate the efficiency of health and treatment centers. In this issue, health centers are considered as parallel networks with two departments that operate independently. Due to the precision of the input and output values, triangular fuzzy numbers and the α-level fuzzy method have been used. The primary results that consider the uncertainty provide efficient solution and suggestions for the potential location of health centers in our case study. Manuscript profile -
Open Access Article
26 - استفاده از الگوریتم وال و جستجوی محلی با مقادیر فازی برای حل مسئله مکانیابی
مهدی فضلی فرزین مدرس خیابانی بهروز دانشیان -
Open Access Article
27 - A Multi-Objective Decision-Based Solution for Facility Location-Allocation Problem Using Cuckoo Search And Genetic Algorithms
Amir Shimi Mohammad Reza Ebrahimi Dishabi Mohammad Abdollahi Azgomi -
Open Access Article
28 - A Multi-Period Berth Allocation-Scheduling Model with Different Terminals and Irregular Layouts Under Uncertainty
S. Farid Mousavi Zahra Mahdavi Kaveh Khalili-Damghani Arezoo Gazori-Nishabori -
Open Access Article
29 - Reliability optimization problems with multiple constraints under fuzziness
Neha Gupta Sanam Haseen Abdul Bari -
Open Access Article
30 - Exact algorithms for solving a bi-level location–allocation problem considering customer preferences
Ehsan Mirzaei Mahdi Bashiri Hossein Shams Shemirani -
Open Access Article
31 - A hybrid DEA-based K-means and invasive weed optimization for facility location problem
Farshad Faezy Razi -
Open Access Article
32 - Redundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies
Mahsa Aghaei Ali Zeinal Hamadani Mostafa Abouei Ardakan -
Open Access Article
33 - A robust optimization model for distribution and evacuation in the disaster response phase
Meysam Fereiduni Kamran Shahanaghi -
Open Access Article
34 - Developing a new stochastic competitive model regarding inventory and price
Reza Rashid Ali Bozorgi-Amiri S. M . Seyedhoseini -
Open Access Article
35 - Models, solution, methods and their applicability of dynamic location problems (DLPs) (a gap analysis for further research)
Seyed Mohammad Seyedhosseini Ahmad Makui Kamran Shahanaghi Sara Sadat Torkestani -
Open Access Article
36 - Scenario-based modeling for multiple allocation hub location problem under disruption risk: multiple cuts Benders decomposition approach
Mohsen Yahyaei Mahdi Bashiri -
Open Access Article
37 - A redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
J Safari R Tavakkoli-Moghaddam -
Open Access Article
38 - Robust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations
Aleksejs Lozkins Mikhail Krasilnikov Vladimir Bure
Sanad
Sanad is a platform for managing Azad University publications
Links
Related Centers
Technical Support
Official pages
The rights to this website are owned by the Raimag Press Management System.
Copyright © 2021-2024