Developing a New Algorithm for a Utility-based Network Design Problem with Elastic Demand

نویسندگان

چکیده مقاله:

Developing the infrastructures for preventing non-communicable diseases is one of the most important goals of healthcare context in recent years. In this regard, the number and capacity of preventive healthcare facilities as well as assignment of customers to facilities should be determined for each region. Besides the accessibility, the utility of customers is a determinative factor in participation of people in the offered programs. In this paper, a service network design problem is studied such that the utility function is incorporated in the objective function, and the constraints set. The travel distance is deterministic and demand elasticity results in congestion delays. After simplifying the nonlinear model, a bi-level optimization algorithm is proposed to obtain the optimal solution. Computational results assure the efficiency of the developed algorithm. Finally, the capability of the model is represented by discussing a case study of locating preventive healthcare facilities in Yazd, Iran.

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

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

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

منابع مشابه

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...

15 صفحه اول

A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets

A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...

متن کامل

A New Algorithm for High Average-utility Itemset Mining

High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items...

متن کامل

Developing a hybrid algorithm for distribution network design problem

Distribution network design is one of the important issues in supply chain management. Two important sub-problems of distribution network design are inventory and location decisions. Traditional approaches considered inventory and location decisions separately which might result in suboptimal solutions. This paper considers the design of a distribution network and simultaneously determines the ...

متن کامل

A swift neural network-based algorithm for demand estimation in concrete moment-resisting buildings

Rapid evaluation of demand parameters of different types of  buildings is crucial for social restoration after damaging earthquakes. Previous studies proposed numerous methodologies to measure the performance of buildings for assessing the potential risk under the seismic hazard. However, time-consuming Nonlinear Response History Analysis (NRHA) barricaded implementing a prompt loss estimation ...

متن کامل

Design of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand

This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...

متن کامل

منابع من

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

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

{@ msg_add @}


عنوان ژورنال

دوره 30  شماره 5

صفحات  758- 767

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

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

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

copyright © 2015-2023