abc

a

b

c

Ehsan.mirzaei@shahed.ac.ir

Bi-Level

LeaderFollower

P

nm

( , )

( )/i j

iij ijP fr

ifig

ijpjiijrij

ixizi

ijxijzji

1i i ij ij ij

i I j J i I i I

f x p x z,maxi ijx x

,i I j J

:

1j

i ij

k i k

x x

,i I j Jij i

x x

,

( , )

max { }i ijz z i i ij ij

i I i j

g z p z

,i I j J

:

1j

i

k i kijx z

,i I j Jij iz z

, , , {0,1}i ij i ijx x z z

ixijxizijz.

i

j

i

i

i

i

ji

i

i

i

( , )i i ij ij

i I i j

f x p x,maxi ijx x

,i I j J

:

1j

i ijk i k

x x

,i I j Jij ix x

,( , )

max { }i ijz z i i ij ij

i I i j

g z p z

,i I j J

:

1j

ik i k

ijx z

,i I j J

:

1j

ik i k

ijz z

,i I j J

:

1j

ik i k

ijz x

j J1ij iji I

x z

,i I j Jij i

z z

, , , {0,1}i ij i ijx x z z

NP-Hard

izijzX,Z

qi

x q

q

izijzX,Z

iP

p

ijr

iif

PP

.

[1] Laporte, G., S. Nickel, and F.S. da Gama, Location science. 2015: Springer.

[2] Karakitsiou, A., Modeling Discrete Competitive Facility Location. 2015: Springer.

[3] Ostresh, L.M., AN EFFICIENT ALGORITHM FOR SOLVING THE TWO CENTER LOCATION

ALLOCATION PROBLEM. Journal of Regional Science, 1975. 15(2): p. 209-216.

[4] Moore, J.T. and J.F. Bard, The mixed integer linear bilevel programming problem. Operations research,

1990. 38(5): p. 911-921.

[5] Bard, J.F. and J.T. Moore, An algorithm for the discrete bilevel programming problem. Naval Research

Logistics, 1992. 39(3): p. 419-435.

[6] Karlof, J. and P. Hocking, A Branch and Bound Algorithm for Solving the Binary Bi-level Linear

Programming Problem.

[7] Losch, A., Economics of location. 1954.

[8] Drezner, T., Optimal continuous location of a retail facility, facility attractiveness, and market share: an

interactive model. Journal of retailing, 1994. 70(1): p. 49-64.

[9] Huff, D.L., Defining and estimating a trading area. The Journal of Marketing, 1964: p. 34-38.

[10] Alekseeva, E., et al., A hybrid memetic algorithm for the competitive p-median problem. IFAC Proceedings

Volumes, 2009. 42(4): p. 1533-1537.

[11] Fernández, P., et al., New heuristic algorithms for discrete competitive location problems with binary and

partially binary customer behavior. Computers & Operations Research, 2017. 79: p. 12-18.

[12] Beresnev, V., Branch-and-bound algorithm for a competitive facility location problem. Computers &

Operations Research, 2013. 40(8): p. 2062-2070.

[13] Qi, M., et al., Competitive facility location problem with foresight considering service distance limitations.

Computers & Industrial Engineering, 2017.

[14] Ben-Ayed, O. and C.E. Blair, Computational difficulties of bilevel linear programming. Operations

Research,1990 38(3): p. 556-560.

[15] http://www.math.nsc.ru/AP/benchmarks/.

xy xy xy xy xy