The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem

نویسندگان
چکیده

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

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

منابع مشابه

Optimal Capacities in Discrete Facility Location Design Problem

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...

متن کامل

existence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types

بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی ‎‏بیان شد‎‎‏ه اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...

15 صفحه اول

optimal capacities in discrete facility location design problem

network location models comprise one of the main categories of location models. these models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. in a network location problem, nodes represent demand points and candidate locations to locate the facilities. if the links network is unchangeably determined, the problem will be ...

متن کامل

An improved cut-and-solve algorithm for the single-source capacitated facility location problem

In this paper we present an improved cut–and–solve algorithm for the single– source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two level local branching heuristic to find an upper bound and, if optimality has not yet been establi...

متن کامل

A Cross Entropy-based heuristic for the capacitated multi-source Weber problem with facility fixed cost

This paper investigates a capacitated planar location-allocation problem with facility fixed cost. A zonebased fixed cost which consists of production and installation costs is considered. A nonlinear and mixed integer formulation is first presented. A powerful three stage Cross Entropy meta-heuristic with novel density functions is proposed. In the first stage a covering location problem provi...

متن کامل

ذخیره در منابع من


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

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2018

ISSN: 0254-5330,1572-9338

DOI: 10.1007/s10479-018-3014-9