کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6892721 | 1445458 | 2018 | 42 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
ترجمه فارسی عنوان
راه حل مبتنی بر حلال شبیه سازی شده کارآمد به یک مسئله موقعیت مکانی توزیع رقابتی تک و چند رقمی است
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
محل توپی، رقابت بازار، فرمول ریاضی، شبیه سازی شده،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
Hub location problems (HLPs) constitute an important class of problems in logistics with numerous applications in passenger/cargo transportation, postal services, telecommunications, etc. This paper addresses the competitive single and multiple allocation HLPs where the market is assumed to be a duopoly. Two firms (decision makers) sequentially decide on the configuration of their hub networks trying to maximize their own market shares. The customers choose one firm based on the cost of service provided by these firms. Mathematical formulations are presented for the problems of the first and second firms (the leader and the follower, respectively) and Simulated Annealing (SA) based solution algorithms are proposed for solving these problems both in single and multiple allocation settings. Extensive computational experiments show the capability of the proposed solution algorithms to obtain the optimal solutions in short computational times. Some managerial insights are also derived based on the obtained results.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 90, February 2018, Pages 173-192
Journal: Computers & Operations Research - Volume 90, February 2018, Pages 173-192
نویسندگان
Nader Ghaffarinasab, Alireza Motallebzadeh, Younis Jabarzadeh, Bahar Y. Kara,