Search published articles


Showing 7 results for Subject: Facilities Planning and Management

Jafar Bagherinejad, Maryam Omidbakhsh,
Volume 24, Issue 3 (9-2013)
Abstract

Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of them allocated demand customer to the closest facility. While, using probability rules to predict customer behavior when they select the desired facility is more appropriate. In this research, equitable facility location problem based on the gravity rule was investigated. The objective function has been defined as a combination of balancing and cost minimization, keeping in mind some system constraints. To estimate demand volume among facilities, utility function(attraction function) added to model as one constraint. The research problem is modeled as one mixed integer linear programming. Due to the model complexity, two heuristic and genetic algorithms have been developed and compared by exact solutions of small dimension problems. The results of numerical examples show the heuristic approach effectiveness with good-quality solutions in reasonable run time.
Mr. Mohammad Rohaninejad, Dr. Amirhossein Amiri, Dr. Mahdi Bashiri,
Volume 26, Issue 3 (9-2015)
Abstract

This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location decisions and this problem is an attempt to reducing the impact of these disruptions. In order to formulate the problem, a new mixed-integer nonlinear programming (MINLP) model with the objective of minimizing total investment and operational costs is presented. Due to complexity of MINLP model, two different heuristic procedures based on mathematical model are developed. Finally, the performance of the proposed heuristic methods is evaluated through executive numerical example. The numerical results show that the proposed heuristic methods are efficient and provide suitable solutions.

\"AWT


Parviz Fattahi, Bahman Ismailnezhad,
Volume 27, Issue 2 (6-2016)
Abstract

In this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. Since cell formation problem is NP-Hard, two algorithms based on genetic and modified particle swarm optimization (MPSO) algorithms are developed to solve the problem. For generating initial solutions in these algorithms, a new heuristic method is developed, which always creates feasible solutions. Moreover, full factorial and Taguchi methods are implemented to set crucial parameters in the solutions procedures. Deterministic method of branch and bound (B&B) algorithm is used to evaluate the results of modified particle swarm optimization algorithm and the genetic algorithm. The results indicate that proposed algorithms have better performance in quality of the metaheurstic algorithms final answer and solving time compared with the method of Lingo software’s B&B algorithm. The solution of two metaheurstic algorithms is compared by t test. Ultimately, the results of numerical examples indicate that considering reliability has significant effect on block structures of machine-part matrixes.


Mohammad Mahdi Nasiri, Nafiseh Shamsi Gamchi, Seyed Ali Torabi,
Volume 27, Issue 4 (12-2016)
Abstract

Hubs are critical elements of transportation networks. Location of hubs and allocation of demands to them are of high importance in the network design. The most important purpose of these models is to minimize the cost, but path reliability is also another important factor which can influence the location of hubs. In this paper, we propose a P-center hub location model with full interconnection among hubs while there are different paths between origins and destinations. The purpose of the model is to determine the reliable path with lower cost. Unlike the prior studies, the number of hubs in the path is not limited to two hubs. The presented model in this paper is bi-objective and includes cost and reliability to determine the best locations for hubs, allocation of the demands to hubs and the best path. In order to illustrate our model, a numerical example is presented and solved using the Cuckoo Optimization Algorithm.


Armaghn Shadman, Ali Bozorgi-Amiri, Donya Rahmani,
Volume 28, Issue 2 (6-2017)
Abstract

Today, many companies after achieving improvements in manufacturing operations are focused on the improvement of distribution systems and have long been a strong tendency to optimize the distribution network in order to reduce logistics costs that the debate has become challenging. Improve the flow of materials, an activity considered essential to increase customer satisfaction. In this study, we benefit cross docking method for effective control of cargo flow to reduce inventory and improve customer satisfaction. Also every supply chain is faced with risks that threaten its ability to work effectively. Many of these risks are not in control but can cause great disruption and costs for the supply chain process. In this study we are looking for a model to collect and deliver the demands for the limited capacity vehicle in terms of disruption risk finally presented a compromised planning process. In fact, we propose a framework which can consider all the problems on the crisis situation for decision-making in these conditions, by preparing a mathematical model and software gams for the following situation in a case study. In the first step, the results presented in mode of a two-level planning then the problem expressed in form of a multi-objective optimization model and the results was explained.


Fatemeh Bayatloo, Ali Bozorgi-Amiri,
Volume 29, Issue 4 (12-2018)
Abstract

Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design of electricity supply chain networks. The proposed network consists of power stations, transmission lines, substations, and demand points. While minimizing costs and maximizing effectiveness of the grid, this paper seeks to determine time and location of establishing new facilities as well as capacity planning for facilities. We use chance constraint method to satisfy the uncertain demand with high probability. The proposed model is validated by a case study on Southern Khorasan Province’s power grid network, the computational results show that the reliability rate is a crucial factor which greatly effects costs and demand coverage. 
Dr. Zahra Esfandiari, Prof. Mahdi Bashiri, Prof. Reza Tavakkoli-Moghaddam,
Volume 31, Issue 1 (3-2020)
Abstract

One of the major risks that can affect supply chain design and management is the risk of facility disruption due to natural hazards, economic crises, terrorist attacks, etc. Static resiliency of the network is one of the features that is considered when designing networks to manage disruptions, which increases the network reliability. This feature refers to the ability of the network to maintain its operation and connection in the lack of some members of the chain. Facility hardening is one of the strategies used for this purpose. In this paper, different reliable capacitated fixed-charge location allocation models are developed for hedging network from failure. In these proposed models, hardening, resilience, and hardening and resilience abilities are considered respectively. These problems are formulated as a nonlinear programming models and their equivalent linear form are presented. The sensitivity analysis confirms that the proposed models construct more effective and reliable network comparing to the previous networks. A Lagrangian decomposition algorithm (LDA) is developed to solve the linear models. Computational results show that the LDA is efficient in computational time and quality of generated solutions for instances with different sizes. Moreover, the superiority of the proposed model is confirmed comparing to the classical model.

Page 1 from 1     

© 2020 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb