•  Persian
    • Persian
    • English
  •   ورود
  • دانشگاه فردوسی مشهد
  • |
  • مرکز اطلاع‌رسانی و کتابخانه مرکزی
    • Persian
    • English
  • خانه
  • انواع منابع
    • مقاله مجله
    • کتاب الکترونیکی
    • مقاله همایش
    • استاندارد
    • پروتکل
    • پایان‌نامه
  • راهنمای استفاده
View Item 
  •   کتابخانه دیجیتال دانشگاه فردوسی مشهد
  • Fum
  • Articles
  • ProfDoc
  • View Item
  •   کتابخانه دیجیتال دانشگاه فردوسی مشهد
  • Fum
  • Articles
  • ProfDoc
  • View Item
  • همه
  • عنوان
  • نویسنده
  • سال
  • ناشر
  • موضوع
  • عنوان ناشر
  • ISSN
  • شناسه الکترونیک
  • شابک
جستجوی پیشرفته
JavaScript is disabled for your browser. Some features of this site may not work without it.

A BSSS algorithm for the single facility location problem in two regions with different norms

نویسنده:
حسین تقی زاده کاخکی
,
j. Brimberg
,
G.O. Wesolowsky
,
Hossein Taghizadeh Kakhki
سال
: 2008
چکیده: Suppose the plane is divided by a straight line into two regions with different norms. We want to find the location of a

single new facility such that the sum of the distances from the existing facilities to this point is minimized. This is in fact a

non-convex optimization problem. The main difficulty is caused by finding the distances between points on different sides

of the boundary line. In this paper we present a closed form solution for finding these distances. We also show that the

optimal solution lies in the rectangular hull of the existing points. Based on these findings then, an efficient big square small

square (BSSS) procedure is proposed.
یو آر آی: http://libsearch.um.ac.ir:80/fum/handle/fum/3363486
کلیدواژه(گان): Continuous location

Single facility

branch and bound

global optimization
کالکشن :
  • ProfDoc
  • نمایش متادیتا پنهان کردن متادیتا
  • آمار بازدید

    A BSSS algorithm for the single facility location problem in two regions with different norms

Show full item record

contributor authorحسین تقی زاده کاخکیen
contributor authorj. Brimbergen
contributor authorG.O. Wesolowskyen
contributor authorHossein Taghizadeh Kakhkifa
date accessioned2020-06-06T13:38:59Z
date available2020-06-06T13:38:59Z
date issued2008
identifier urihttp://libsearch.um.ac.ir:80/fum/handle/fum/3363486
description abstractSuppose the plane is divided by a straight line into two regions with different norms. We want to find the location of a

single new facility such that the sum of the distances from the existing facilities to this point is minimized. This is in fact a

non-convex optimization problem. The main difficulty is caused by finding the distances between points on different sides

of the boundary line. In this paper we present a closed form solution for finding these distances. We also show that the

optimal solution lies in the rectangular hull of the existing points. Based on these findings then, an efficient big square small

square (BSSS) procedure is proposed.
en
languageEnglish
titleA BSSS algorithm for the single facility location problem in two regions with different normsen
typeJournal Paper
contenttypeExternal Fulltext
subject keywordsContinuous location

Single facility

branch and bound

global optimization
en
journal titleEuropean Journal of Operational Researchen
journal titleEuropean Journal of Operational Researchfa
pages79-89
journal volume190
journal issue0
identifier linkhttps://profdoc.um.ac.ir/paper-abstract-1006774.html
identifier articleid1006774
  • درباره ما
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace