Parallel Optimization Algorithm for Competitive Facility Location

A stochastic search optimization algorithm is developed and applied to solve a bi-objective competitive facility location problem for firm expansion. Parallel versions of the developed algorithm for shared- and distributed-memory parallel computing systems are proposed and experimentally investigate...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical modelling and analysis Ročník 20; číslo 5; s. 619 - 640
Hlavní autoři: Lančinskas, Algirdas, Ortigosa, Pilar Martínez, Žilinskas, Julius
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis 03.09.2015
Vilnius Gediminas Technical University
Témata:
Algorithms
Approximation
Facilities
facility location
Location
Mathematical analysis
Mathematical research
Operations research
Optimization
Optimization theory
parallel computing
Precursors
Site selection
optimization
parallel computing
facility location
ISSN:1392-6292, 1648-3510
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í:A stochastic search optimization algorithm is developed and applied to solve a bi-objective competitive facility location problem for firm expansion. Parallel versions of the developed algorithm for shared- and distributed-memory parallel computing systems are proposed and experimentally investigated by approximating the Pareto front of the competitive facility location problem of different scope. It is shown that the developed algorithm has advantages against its precursor in the sense of the precision of approximation. It is also shown that the proposed parallel versions of the algorithm have almost linear speed-up when solving competitive facility location problems of different scope reasonable for practical applications.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1392-6292
1648-3510
DOI:10.3846/13926292.2015.1088903