Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution

2011 ◽  
Vol 208 (3) ◽  
pp. 206-220 ◽  
Author(s):  
Hande Küçükaydin ◽  
Necati Aras ◽  
I. Kuban Altınel
Keyword(s):  
Facility Location ◽  
Bilevel Programming ◽  
Location Problem ◽  
Programming Model ◽  
Facility Location Problem ◽  
Competitive Facility Location ◽  
Bilevel Programming Model

scholarly journals A Multi-Objective Approach to the Competitive Facility Location Problem

2017 ◽  
Vol 108 ◽  
pp. 1434-1442 ◽  
Author(s):  
Abdullah Konak ◽  
Sadan Kulturel-Konak ◽  
Lawrence Snyder
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Competitive Facility Location ◽  
Multi Objective

Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees

2018 ◽  
Vol 66 (4) ◽  
pp. 1058-1067 ◽  
Author(s):  
Yonatan Gur ◽  
Daniela Saban ◽  
Nicolas E. Stier-Moses
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem ◽  
Technical Note ◽  
Competitive Facility Location

scholarly journals PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION

2015 ◽  
Vol 20 (5) ◽  
pp. 619-640 ◽  
Author(s):  
Algirdas Lančinskas ◽  
Pilar Martinez Ortigosa ◽  
Julius Žilinskas
Keyword(s):  
Facility Location ◽  
Optimization Algorithm ◽  
Location Problem ◽  
Facility Location Problem ◽  
Parallel Optimization ◽  
Computing Systems ◽  
Practical Applications ◽  
Competitive Facility Location ◽  
Search Optimization ◽  
Speed Up

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