Presenting a three-objective model in location-allocation problems using combinational interval full-ranking and maximal covering with backup model

نویسندگان

  • Abolfazl Kazemi Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
  • Majedeh Kordjazi Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
چکیده مقاله:

Covering models have found many applications in a wide variety of real-world problems; nevertheless, some assumptions of covering models are not realistic enough. Accordingly, a general approach would not be able to answer the needs of encountering varied aspects of real-world considerations. Assumptions like the unavailability of servers, uncertainty, and evaluating more factors at the same time, are a sort of assumptions, with which covering models are always faced; however, these models are not able to find any answers for them. Therefore, how to deal with these sorts of assumptions has been always a big question. In this research, for facing unavailability and uncertainty in input data, backup covering and interval full-ranking model were addressed, respectively. Furthermore, by combining backup covering and interval full-ranking models (also conceptions), not only time was saved and more factors like efficiency and cost were simultaneously evaluated, but also covering considerations were reachable in real aspects.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A location-allocation model in the multi-level supply chain with multi-objective evolutionary approach

In the current competitive conditions, all the manufacturers’ efforts are focused on increasing the customer satisfaction as well as reducing the production and delivery costs; thus, there is an increasing concentration on the structure and principles of supply chain (SC). Accordingly, the present research investigated simultaneous optimization of the total costs of a chain and customer satisfa...

متن کامل

A multiobjective continuous covering location model

This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...

متن کامل

A Multi Objective Optimization Model for Redundancy Allocation Problems in Series-Parallel Systems with Repairable Components

The main goal in this paper is to propose an optimization model for determining the structure of a series-parallel system. Regarding the previous studies in series-parallel systems, the main contribution of this study is to expand the redundancy allocation parallel to systems that have repairable components. The considered optimization model has two objectives: maximizing the system mean time t...

متن کامل

Designing a multi-objective nonlinear cross-docking location allocation model using genetic algorithm

In this study, a cross-docking system is designed at strategic and tactical levels. For making the strategic decisions, a multi-objective nonlinear location allocation model for cross-docks is presented based on a distri-bution location allocation model by Andreas Klose and Andreas Drexl. The model is further developed to in-clude the whole supply chain members and the objective functions are w...

متن کامل

Mathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters

The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...

متن کامل

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 9  شماره special issue on location allocation and hub modeling

صفحات  53- 70

تاریخ انتشار 2016-05-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023