Solving a continuous multifacility location problem by DC algorithms

The paper presents a new approach to solve multifacility location problems, which is based on mixed integer programming and algorithms for minimizing differences of convex (DC) functions. The main challenges for solving the multifacility location problems under consideration come from their intrinsi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization methods & software Ročník 37; číslo 1; s. 338 - 360
Hlavní autoři: Bajaj, Anuj, Mordukhovich, Boris S., Nam, Nguyen Mau, Tran, Tuyen
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Taylor & Francis 02.01.2022
Taylor & Francis Ltd
Témata:
Algorithms
difference of convex functions
Integer programming
Mixed integer
Mixed integer programming
multifacility location
Nesterov's smoothing
Optimization
Site selection
the DCA
ISSN:1055-6788, 1029-4937
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The paper presents a new approach to solve multifacility location problems, which is based on mixed integer programming and algorithms for minimizing differences of convex (DC) functions. The main challenges for solving the multifacility location problems under consideration come from their intrinsic discrete, nonconvex, and nondifferentiable nature. We provide a reformulation of these problems as those of continuous optimization and then develop a new DC type algorithm for their solutions involving Nesterov's smoothing. The proposed algorithm is computationally implemented via MATLAB numerical tests on both artificial and real data sets.
AbstractList The paper presents a new approach to solve multifacility location problems, which is based on mixed integer programming and algorithms for minimizing differences of convex (DC) functions. The main challenges for solving the multifacility location problems under consideration come from their intrinsic discrete, nonconvex, and nondifferentiable nature. We provide a reformulation of these problems as those of continuous optimization and then develop a new DC type algorithm for their solutions involving Nesterov's smoothing. The proposed algorithm is computationally implemented via MATLAB numerical tests on both artificial and real data sets.
Author Tran, Tuyen
Mordukhovich, Boris S.
Nam, Nguyen Mau
Bajaj, Anuj
Author_xml – sequence: 1
  givenname: Anuj
  surname: Bajaj
  fullname: Bajaj, Anuj
  organization: Department of Mathematics, Wayne State University
– sequence: 2
  givenname: Boris S.
  surname: Mordukhovich
  fullname: Mordukhovich, Boris S.
  email: boris@math.wayne.edu
  organization: Department of Mathematics, Wayne State University
– sequence: 3
  givenname: Nguyen Mau
  surname: Nam
  fullname: Nam, Nguyen Mau
  organization: Fariborz Maseeh Department of Mathematics and Statistics, Portland State University
– sequence: 4
  givenname: Tuyen
  surname: Tran
  fullname: Tran, Tuyen
  organization: Fariborz Maseeh Department of Mathematics and Statistics, Portland State University
BookMark eNqFkMtOwzAQRS1UJNrCJyBFYp3iZ-OIDajlJVViAawtx4mLK8cutgPK35PSsmEBqxmN7r0zcyZg5LxrADhHcIYgh5cIMjYvOJ9hiIdRUSBC2BEYI4jLnJakGO16xvKd6ARMYtxACCmi8zFYPnv7Ydw6k5nyLhnX-S5mbWeT0VIZa1KfWa9kMt5l2-Ar27RZ1WfLRSbt2geT3tp4Co61tLE5O9QpeL27fVk85Kun-8fFzSpXhPCUs3ldopqVrOSUQEUp5o3GsBqe0BXTTc0LWrG6oZhAXM8hJaxClVaSa17XCpMpuNjnDoe8d01MYuO74IaVAheoQEMuhYOK7VUq-BhDo8U2mFaGXiAodsDEDzCxAyYOwAbf1S-fMun78RSksf-6r_du47QPrfz0wdYiyd76oIN0ykRB_o74AgIyhbg
CitedBy_id crossref_primary_10_3389_fams_2024_1445390
crossref_primary_10_1007_s11067_024_09645_z
Cites_doi 10.1007/978-3-031-02406-1
10.1137/130945442
10.1007/978-3-319-91578-4
10.1007/978-3-319-92775-6
10.1007/s10957-014-0692-6
10.1007/978-3-642-56468-0
10.1007/s10957-018-1345-y
10.1007/s11590-017-1183-0
10.1023/A:1020884004689
10.1137/S1052623494274313
10.1007/978-3-642-04020-7_35
10.1080/02331934.2016.1253694
10.1016/j.patcog.2013.07.012
10.1007/s10957-010-9761-7
10.1515/9781400873173
10.1007/s10957-017-1075-6
10.1007/s10107-004-0552-5
ContentType Journal Article
Copyright 2020 Informa UK Limited, trading as Taylor & Francis Group 2020
2020 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2020 Informa UK Limited, trading as Taylor & Francis Group 2020
– notice: 2020 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/10556788.2020.1771335
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-4937
EndPage 360
ExternalDocumentID 10_1080_10556788_2020_1771335
1771335
Genre Research Article
GroupedDBID .4S
.7F
.DC
.QJ
0BK
0R~
123
29N
30N
4.4
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABDBF
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACIWK
ACTIO
ACUHS
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMVHM
AQRUH
AQTUD
ARCSS
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EAP
EBS
EDO
EMK
EPL
EST
ESX
E~A
E~B
F5P
GTTXZ
H13
HF~
HZ~
H~P
I-F
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
NY~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TTHFI
TUROJ
TUS
TWF
UT5
UU3
ZGOLN
~S~
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c338t-56d91d59598430c4428ef20b108fb5fed874b5de42302d60435b1bfca8f8ddc23
IEDL.DBID TFW
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000541360700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1055-6788
IngestDate Wed Aug 13 10:46:45 EDT 2025
Sat Nov 29 02:36:07 EST 2025
Tue Nov 18 22:30:56 EST 2025
Mon Oct 20 23:46:41 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c338t-56d91d59598430c4428ef20b108fb5fed874b5de42302d60435b1bfca8f8ddc23
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2717198440
PQPubID 186278
PageCount 23
ParticipantIDs crossref_primary_10_1080_10556788_2020_1771335
crossref_citationtrail_10_1080_10556788_2020_1771335
proquest_journals_2717198440
informaworld_taylorfrancis_310_1080_10556788_2020_1771335
PublicationCentury 2000
PublicationDate 2022-01-02
PublicationDateYYYYMMDD 2022-01-02
PublicationDate_xml – month: 01
  year: 2022
  text: 2022-01-02
  day: 02
PublicationDecade 2020
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle Optimization methods & software
PublicationYear 2022
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References CIT0010
CIT0021
Mordukhovich B.S. (CIT0011) 2019; 1
Tao P.D. (CIT0020) 1997; 22
CIT0001
CIT0023
Nam N.M. (CIT0012) 2013; 20
CIT0022
Nesterov Yu. (CIT0016) 1983; 269
CIT0003
CIT0014
CIT0002
CIT0013
CIT0005
CIT0004
CIT0015
CIT0007
CIT0018
CIT0006
CIT0017
CIT0009
CIT0008
CIT0019
References_xml – ident: CIT0010
  doi: 10.1007/978-3-031-02406-1
– ident: CIT0013
  doi: 10.1137/130945442
– ident: CIT0018
  doi: 10.1007/978-3-319-91578-4
– ident: CIT0008
  doi: 10.1007/978-3-319-92775-6
– volume: 1
  start-page: 205
  year: 2019
  ident: CIT0011
  publication-title: J. Appl. Numer. Optim.
– volume: 20
  start-page: 669
  year: 2013
  ident: CIT0012
  publication-title: J. Convex Anal.
– ident: CIT0005
  doi: 10.1007/s10957-014-0692-6
– volume: 269
  start-page: 543
  year: 1983
  ident: CIT0016
  publication-title: Soviet Math. Dokl.
– ident: CIT0006
  doi: 10.1007/978-3-642-56468-0
– ident: CIT0004
  doi: 10.1007/s10957-018-1345-y
– ident: CIT0015
  doi: 10.1007/s11590-017-1183-0
– volume: 22
  start-page: 289
  year: 1997
  ident: CIT0020
  publication-title: Acta Math. Vietnam.
– ident: CIT0007
  doi: 10.1023/A:1020884004689
– ident: CIT0021
  doi: 10.1137/S1052623494274313
– ident: CIT0023
– ident: CIT0002
  doi: 10.1007/978-3-642-04020-7_35
– ident: CIT0022
– ident: CIT0001
  doi: 10.1080/02331934.2016.1253694
– ident: CIT0003
  doi: 10.1016/j.patcog.2013.07.012
– ident: CIT0009
  doi: 10.1007/s10957-010-9761-7
– ident: CIT0019
  doi: 10.1515/9781400873173
– ident: CIT0014
  doi: 10.1007/s10957-017-1075-6
– ident: CIT0017
  doi: 10.1007/s10107-004-0552-5
SSID ssj0004146
Score 2.3108594
Snippet The paper presents a new approach to solve multifacility location problems, which is based on mixed integer programming and algorithms for minimizing...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 338
SubjectTerms Algorithms
difference of convex functions
Integer programming
Mixed integer
Mixed integer programming
multifacility location
Nesterov's smoothing
Optimization
Site selection
the DCA
Title Solving a continuous multifacility location problem by DC algorithms
URI https://www.tandfonline.com/doi/abs/10.1080/10556788.2020.1771335
https://www.proquest.com/docview/2717198440
Volume 37
WOSCitedRecordID wos000541360700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor and Francis Online Journals
  customDbUrl:
  eissn: 1029-4937
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004146
  issn: 1055-6788
  databaseCode: TFW
  dateStart: 19920101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dS8MwEA8yfNAHv8XplDz4Wm3TpkseZXP4NAQn7i00XzqYnaydsP_eS5uqQ2QP-tjCHeEuyd0v_O4OoctIGQ2RyAYkpSRImGZBpuAz5lpyDYjEalUNm-gOh2w85veeTVh4WqXD0LZuFFHd1e5wZ7JoGHHX1UxHgG6A7gj86jqc5crMIbN3pL7R4OmrMtLXF4FE4ESaGp7ftKxEp5XepT_u6ioADXb_Yel7aMdnn_im3i77aMPkB2j7W0_CQ9R_mE3dIwPOsKOxT_LFbFHgindoM-WYtEvsAqBzKPbjaLBc4n4PZ9Pn2XxSvrwWR-hxcDvq3QV-1EKgAKOWAU01jzTllLMkDlUCoMRYEkpYtJXUGs26iaTaQPIVEp2GkGTJSFqVMcu0ViQ-Rq18lpsThBOQ0YYqmjIJaixnMbNxFEud8Rhc1EZJY2KhfB9yNw5jKiLfrrQxknBGEt5IbXT1KfZWN-JYJ8C_-0-U1QuIrceViHiNbKdxtvBnuhAEkG8E9knC0z-oPkNbxFVQuFcc0kGtcr4w52hTvZeTYn5R7d4PZ8fpKQ
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT8MwDI1gIAEHvhGDATlwLbRp0yVHtDENMXZhiN2iJmlg0mjR1iHt3-N0LWxCaAc4tpKjyE5iP8v2Q-jSU7EGT2QcElLiBEwzJ1Lw6XMtuQZEYrTKySbq3S7r9_l8L4wtq7QY2swGReRvtb3cNhldlsRd56SOgN0A3hH4VbdAi66itZydDs50r_X83RtZdBiBiGNlyi6e35ZZ8E8L00t_vNa5C2rt_Mfmd9F2EYDim9mJ2UMrcbKPtubGEh6g5mM6tHkGHGFbyT5IJulkjPPSQxMpW0w7xdYHWpvigpEGyyluNnA0fElHg-z1bXyInlq3vUbbKdgWHAUwNXNoqLmnKaecBb6rAsAlsSGuhE0bSU2sWT2QVMcQf7lEhy7EWdKTRkXMMK0V8Y9QJUmT-BjhAGR0TBUNmYRlDGc-M77nSx1xH_BXFQWljoUqRpFbRoyh8IqJpaWShFWSKJRURVdfYu-zWRzLBPi8AUWWJ0HMjLFE-Etka6W1RXGtx4IA-PVAP4F78oelL9BGu_fQEZ277v0p2iS2ocImdUgNVbLRJD5D6-ojG4xH5_lR_gQz2u1O
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dS8MwEA86RfTBb3F-5sHXaps2XfIozqEoQ1Bxb6FJGh3MdaydsP_eS5v6gcge9LGFO8JdLne_4z4QOglUqsETGY_ElHgR08xLFHyGXEuuAZEYrcplE61ul_V6_M5VE-aurNJiaFMNiijfamvcI23qirizcqcjQDdAdwR-tSzOovNoAULn2NrmQ-fpszXSNRgBiWdp6iae39h8c0_fhpf-eKxLD9RZ-4ezr6NVF37i8-q-bKC5dLiJVr4MJdxC7ftsYLMMOMG2jr0_nGSTHJeFhyZRtpR2iq0HtBrFbh8NllPcvsDJ4Dkb94uX13wbPXYuHy6uPLdrwVMAUguPxpoHmnLKWRT6KgJUkhriSzi0kdSkmrUiSXUK0ZdPdOxDlCUDaVTCDNNakXAHNYbZMN1FOAIanVJFYyaBjeEsZCYMQqkTHgL6aqKoFrFQbhC53YcxEIGbV1oLSVghCSekJjr9IBtVkzhmEfCv-hNFmQIx1b4SEc6gPaiVLZxR54IA9A1APpG_9wfWx2jprt0Rt9fdm320TGw3hc3okAPUKMaT9BAtqrein4-Pyov8DlHe6_c
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Solving+a+continuous+multifacility+location+problem+by+DC+algorithms&rft.jtitle=Optimization+methods+%26+software&rft.au=Bajaj%2C+Anuj&rft.au=Mordukhovich%2C+Boris+S&rft.au=Nguyen+Mau+Nam&rft.au=Tran%2C+Tuyen&rft.date=2022-01-02&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=1055-6788&rft.eissn=1029-4937&rft.volume=37&rft.issue=1&rft.spage=338&rft.epage=360&rft_id=info:doi/10.1080%2F10556788.2020.1771335&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1055-6788&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1055-6788&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1055-6788&client=summon