The Euclidean distance Capacitated LocationAllocation Problem in the Presence of k Connections

  • سال انتشار: 1391
  • محل انتشار: هشتمین کنفرانس بین المللی مهندسی صنایع
  • کد COI اختصاصی: IIEC08_049
  • زبان مقاله: انگلیسی
  • تعداد مشاهده: 1572
دانلود فایل این مقاله

نویسندگان

Mehdi Amiri-Aref

Mazandaran University

Iraj Mahdavi

Mazandaran University

Saber Shiripour

چکیده

In the wide range of facility location theory, the capacitated facility location-allocation problems are recently paid attention by many researchers who are working in the field ofoperations research. This paper considers a capacitated locationallocation problem in the presence of k connections on thehorizontal line barrier. The main aim of this paper is to locate a set of new facilities in the plane among a set of existing facilities and to allocate an optimal number of existing facilities to each new facility in order to satisfy their demands such that the summation of the weighted Euclidean barrier distances from newfacilities to existing facilities is minimized. The proposed problem is designed as a mixed-integer nonlinear programming model. Inaddition a lower bound problem based on the forbidden region is also presented. To show the efficiency of the model, a numerical example is provided and the results are graphically compared two cases of with and without passages on the line barrier. It is worth noting that the global optimal solution is obtained

کلیدواژه ها

Location-aUocation problem, connection, mixed integer nonlinear programming

مقالات مرتبط جدید

اطلاعات بیشتر در مورد COI

COI مخفف عبارت CIVILICA Object Identifier به معنی شناسه سیویلیکا برای اسناد است. COI کدی است که مطابق محل انتشار، به مقالات کنفرانسها و ژورنالهای داخل کشور به هنگام نمایه سازی بر روی پایگاه استنادی سیویلیکا اختصاص می یابد.

کد COI به مفهوم کد ملی اسناد نمایه شده در سیویلیکا است و کدی یکتا و ثابت است و به همین دلیل همواره قابلیت استناد و پیگیری دارد.