The random search algorithm based on ranking of the search space elements is applied to solve the competitive facility location problem with constrain for the minimal market share for a new facility. The strategy for constraint handling is proposed and experimentally evaluated by solving complex instances of competitive facility location problem using real geographical data.
REFERENCES
1.
R. Z.
Farahani
, S.
Rezapour
, T.
Drezner
, and S.
Fallah
. Competitive supply chain network design: An overview of classifications, models, solution techniques and applications
. Omega
, 45
(0
):92
–118
, 2014
.2.
T.L.
Friesz
, T.
Miller
, and R.L.
Tobin
. Competitive networks facility location models: a survey
. Papers in Regional Science
, 65
:47
–57
, 1998
.3.
P.
Frank
. Static competitive facility location: An overview of optimisation approaches
. European Journal of Operational Research
, 129
(3
):461
–470
, 2001
.4.
C. S.
ReVelle
, H.A.
Eiselt
, and M. S.
Daskin
. A bibliography for some fundamental problem categories in discrete location science
. European Journal of Operational Research
, 184
(3
):817
–848
, 2008
.5.
S. L.
Hakimi
. Location with spatial interactions, competitive locations
. In P. B.
Mirchandani
and R. L.
Francis
, editors, Discrete Location Theory
, pages 439
–478
. 1990
.6.
P.
Fernández
, B.
Pelegŕın
, A.
Lančinskas
, and J.
Žilinskas
. New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
. Computers & Operations Research
, 79
: 12
–18
, 2017
. ISSN .
This content is only available via PDF.
© 2019 Author(s).
2019
Author(s)
