Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem

Author(s):  
Algirdas Lančinskas ◽  
Pascual Fernández ◽  
Blas Pelegrín ◽  
Julius Žilinskas
2017 ◽  
Vol 108 ◽  
pp. 1434-1442 ◽  
Author(s):  
Abdullah Konak ◽  
Sadan Kulturel-Konak ◽  
Lawrence Snyder

2018 ◽  
Vol 66 (4) ◽  
pp. 1058-1067 ◽  
Author(s):  
Yonatan Gur ◽  
Daniela Saban ◽  
Nicolas E. Stier-Moses

2015 ◽  
Vol 20 (5) ◽  
pp. 619-640 ◽  
Author(s):  
Algirdas Lančinskas ◽  
Pilar Martinez Ortigosa ◽  
Julius Žilinskas

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.


Sign in / Sign up

Export Citation Format

Share Document