A multiobjective continuous covering location model

نویسندگان

  • mohammad Jabalameli Department of Industrial engineering, Iran University of Science and Technology, Tehran, Iran
چکیده مقاله:

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 variables, namely, selecting zone variable and covering variableare introduced for extending the discrete model to the continuous one. In the model, a facility is locatedin a zone with a predetermined radius from its center and is determined by the selecting zonevariable. Allocating a customer to a facility is shown by the covering variable. Also, the paperintroduces the possibility of covering based on distance between the customers and the facilities. Two objectives are considered in the model; the first is the possibility of covering by each facility and the second is the risk cost of the uncovered customers.Then, a fuzzy programming is applied for converting the model to a single objective one. Finally, a numerical examplewith sensitivity analysis is expressed to illustrate the presented model.

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

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

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

منابع مشابه

A cross entropy algorithm for continuous covering location problem

Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...

متن کامل

General form of a cooperative gradual maximal covering location problem

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

متن کامل

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

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 ti...

متن کامل

A Continuous Model for Multistore Competitive Location

This article presents a simple model to determine the location strategies of two retail firms planning to open a number of stores in a geographical market. Firms try to maximize their profit under a leader-follower type competition in which the number of stores is made endogenous by the introduction of fixed costs. A novel methodology is developed, in which firms’ strategies are defined in term...

متن کامل

Genetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

متن کامل

Fuzzy Multi-Period Mathematical Programming Model for Maximal Covering Location Problem

In this paper, a model is presented to locate ambulances, considering backup facility (to increase reliability) and the restriction of ambulance capacity. This model is designed for emergencies. In this model the covered demand for each demand point depends on the number of coverage times and the amount of demand. The demand amount and ambulance coverage radius are considered...

متن کامل

منابع من

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

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

{@ msg_add @}


عنوان ژورنال

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

صفحات  40- 52

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

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

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

copyright © 2015-2023