A branch-and-cut algorithm for the discrete (r∣p)-centroid problem
The environment of the (r∣p)-centroid problem is composed of two noncooperative firms, a leader and a follower, competing to serve the demand of customers from a given market. The demand of each customer is totally served by a facility of the leader or follower according to a customer choice rule. The goal of both the leader and the follower is to maximize its own market share. The (r∣p)-centroid problem consists of deciding where the leader should place p facilities knowing that the follower will react by placing r facilities. The discrete version of the problem is a ∑2p-hard one, where both the applicant facilities and the customers are nodes on a graph. In spite of it, we present an integer programming formulation with polynomially many variables and exponentially many constraints. Moreover, we report several experiments with different number of customers and applicant facilities and different values of p and r. Our results show that our method requires less computational time than the two exact algorithms found in the literature, being able to optimally solve 29 previously open instances with up to 100 customers, 100 applicant facilities and p=r=15.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Campos Rodríguez, Clara M. & Moreno Pérez, José A., 2008. "Multiple voting location problems," European Journal of Operational Research, Elsevier, vol. 191(2), pages 437-453, December.
- Eiselt, H. A. & Laporte, Gilbert, 1997. "Sequential location problems," European Journal of Operational Research, Elsevier, vol. 96(2), pages 217-231, January.
- Campos Rodriguez, Clara M. & Moreno Perez, Jose A., 2003. "Relaxation of the Condorcet and Simpson conditions in voting location," European Journal of Operational Research, Elsevier, vol. 145(3), pages 673-683, March.
- Eiselt, H. A. & Laporte, G., 1989. "Competitive spatial models," European Journal of Operational Research, Elsevier, vol. 39(3), pages 231-242, April.
- Hakimi, S. Louis, 1983. "On locating new facilities in a competitive environment," European Journal of Operational Research, Elsevier, vol. 12(1), pages 29-35, January.
- Noltemeier, H. & Spoerhase, J. & Wirth, H.-C., 2007. "Multiple voting location and single voting location on trees," European Journal of Operational Research, Elsevier, vol. 181(2), pages 654-667, September.
- Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:224:y:2013:i:1:p:101-109. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.