ﻣﺪل ﺑﻨﺪی و اراﯾﻪ اﻟگورﯾﺘﻢﻫﺎی ﺑﻬﯿﻨﻪ ﺑﺮای ﻣﺴﺎﺋﻞ مکانﯾﺎﺑﯽ ﭼﻨﺪ تسهیلاتی ﻣﯿﺎﻧﻪ ﻧﺎﺧﻮﺷﺎﯾﻨﺪ روی شبکه ها
General Material Designation
[پایان نامه]
First Statement of Responsibility
علی پناهی
.PUBLICATION, DISTRIBUTION, ETC
Name of Publisher, Distributor, etc.
صنعتی سهند
Date of Publication, Distribution, etc.
۱۴۰۲
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
۹۵ص.
Other Physical Details
مصور، جدول، نمودار
Accompanying Material
CD
DISSERTATION (THESIS) NOTE
Dissertation or thesis details and type of degree
کارشناسی ارشد
Discipline of degree
ریاضی کاربردی- بهینهسازی
Date of degree
۱۴۰۲/۰۶/۰۱
SUMMARY OR ABSTRACT
Text of Note
در اﯾﻦ ﭘﺎﯾﺎنﻧﺎﻣﻪ ﺑﻪ ﻣﻄﺎﻟﻌﻪ و ﺑﺮرﺳﯽ ﻣﺪلﻫﺎي ﻣﮑﺎنﯾﺎﺑﯽ ﭼﻨﺪ ﺗﺴﻬﯿﻼﺗﯽ ﻣﯿﺎﻧﻪ ﻧﺎﺧﻮﺷﺎﯾﻨﺪ ﻣﯽﭘﺮدازﯾﻢ. اﺑﺘﺪا ﻣﺴﺌﻠﻪ ﻣﮑﺎنﯾﺎﺑﯽ -pﻣﯿﺎﻧﻪ ﻧﺎﺧﻮﺷﺎﯾﻨﺪ را، از دﯾﺪﮔﺎه ﻣﺪلﺑﻨﺪي در ﻧﻈﺮ ﮔﺮﻓﺘﻪ و ﺑﺮاي آن ﻓﺮﻣﻮل ﺑﻨﺪيﻫﺎي رﯾﺎﺿﯿﺎﺗﯽ ﻣﺨﺘﻠﻒ، ﺷﺎﻣﻞ ﻣﺪل اﺻﻠﯽ، ﻣﺪل ﻓﺸﺮده، ﻣﺪل ﯾﮑﭙﺎرﭼﻪ و ﻣﺪل ﻣﺮﺗﺐ ﺷﺪه را اراﯾﻪ ﻣﯽدﻫﯿﻢ. ﺑﻮﺳﯿﻠﻪ ﻣﺜﺎلﻫﺎي ﻋﺪدي ﻣﻨﺎﺳﺐ، ﻧﺸﺎن داده ﻣﯽﺷﻮد ﮐﻪ ﺗﻤﺎﻣﯽ ﻓﺮﻣﻮل ﺑﻨﺪيﻫﺎي ﺑﺎﻻ ﻣﯽﺗﻮاﻧﻨﺪ ﺟﻮابﻫﺎي ﺑﻬﯿﻨﻪ ﻣﺴﺌﻠﻪ را ﭘﯿﺪا ﮐﻨﻨﺪ. در اداﻣﻪ، ﻣﺴﻠﻪ ﻣﮑﺎنﯾﺎﺑﯽ -Pﻣﯿﺎﻧﻪ ﻧﺎﺧﻮﺷﺎﯾﻨﺪ -P)ﻣﺎﮐﺰﯾﻦ( ﺑﺎ ﻣﺤﺪودﯾﺖ ﻓﺎﺻﻠﻪ روي ﺷﺒﮑﻪﻫﺎي درﺧﺘﯽ در ﻧﻈﺮ ﮔﺮﻓﺘﻪ ﻣﯽﺷﻮد و ﯾﮏ اﻟﮕﻮرﯾﺘﻢ ﺗﺮﮐﯿﺒﯿﺎﺗﯽ ﺑﻬﯿﻨﻪ ﺑﺎ زﻣﺎن اﺟﺮاي ﭼﻨﺪﺟﻤﻠﻪاﯾﯽ ارایه می گردد.
Text of Note
In this thesis, we study the obnoxious median multiple facility location models.Firs, the obnoxious p-median location problem is investigated based on modelingaspects. The several mathematical formulations, including original model, compactmodel, unified model and ordered model are presented. By suitable numerical examples it is shown that all of the above models can obtain the optimal solutions. Moreover, we consider the obnoxious p-median (p- maxian) location problem whit distanceconstraint on tree networks. An optimal combinatorial algorithm is prestented whichruns in polynomial time
OTHER VARIANT TITLES
Variant Title
Modelling and optimal algorithms for obnoxious median multiple facility location problems on networks