Maximal Benefit Location Problem for A Congested System
سال انتشار: 1388
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 425
فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-3-5_008
تاریخ نمایه سازی: 22 آبان 1397
چکیده مقاله:
Some servers are to be located at nodes of a network. Demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. Each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. Customers may waive receiving service with a known probability. The objective is to maximize the total benefit. In this paper, the problem is formulated, three solution algorithms are developed and applied to some numerical examples to analyze the results.
کلیدواژه ها:
نویسندگان
Reza Rabieyan
Islamic Azad University,Qazvin Branch, Department of Industrial Engineering, Qazvin, Iran
Mehdi Seifbarghy
Islamic Azad University,Qazvin Branch, Department of Industrial Engineering, Qazvin, Iran