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!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1055-6788
1029-4937
DOI:10.1080/10556788.2020.1771335