A new alternating heuristic for the (r | p)–centroid problem on the plane

Emilio Carrizosa (), Ivan Davydov () and Yury Kochetov ()
Additional contact information
Emilio Carrizosa: Facultad de Matemáticas, Universidad de Sevilla
Ivan Davydov: Sobolev Institute of Mathematics
Yury Kochetov: Sobolev Institute of Mathematics

A chapter in Operations Research Proceedings 2011, 2012, pp 275-280 from Springer

Abstract: Abstract In the (r | p)-centroid problem, two players, called leader and follower, open facilities to service clients. We assume that clients are identified with their location on the Euclidian plane, and facilities can be opened anywhere in the plane. The leader opens p facilities. Later on, the follower opens r facilities. Each client patronizes the closest facility. Our goal is to find p facilities for the leader to maximize his market share. For this Stackelberg game we develop a new alternating heuristic, based on the exact approach for the follower problem. At each iteration of the heuristic, we consider the solution of one player and calculate the best answer for the other player. At the final stage, the clients are clustered, and an exact polynomial-time algorithm for the (1 | 1)-centroid problem is applied. Computational experiments show that this heuristic dominates the previous alternating heuristic of Bhadury, Eiselt, and Jaramillo.

Keywords: Market Share; Stackelberg Game; Exact Approach; Competitive Location; Close Facility (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_44

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_44

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().