Locating Service Centers to Maximize the Competitive Share in a Closed Supply Chain

Document Type : Research Paper


Department of Industrial Engineering, Yazd University, Yazd, Iran


Competitive location deals with the problem of locating facilities to provide services to the customers, where other competing facilities offer the same services. Many competitive location models are presented in the literature. However, the literature on competitive location considering reverse logistic in closed-loop supply chain is rather scarce. Also, there are two main approaches in the related literature: increasing profit, and increasing market share of the service centers. Most of the studies in the literature consider one of these issues as the objective function. This study shows that these objectives may have conflict with each other. Therefore, addressing these issues simultaneously is important for a successful design of supply chain. This paper addresses a novel biobjective competitive facility location problem in a closed-loop supply chain, so that increasing profit and market share are considered simultaneously. On the other hand, in the real world, the customer may choose facilities that are not necessarily close to them, because of the greater attractiveness of other facilities. Hence, in this study, a new relationship is introduced to establish the attractiveness of each potential center for customers based on the distance and quality of service centers. In order to solve the proposed model and tackle the computational complexity of the proposed model, two approaches are employed: LP-metric and NSGAII. Furthermore, multiple numerical instances are established and solved by employing the exact approach of LP-metric through GAMS. Results are assessed in order to validate the accuracy of the proposed model. The best value of “P” in LP-metric approach is obtained via analyzing the results. Furthermore, the performance of the NSGAII is analyzed by comparing to the exact solution of LP-metric through GAMS. Results indicate that the proposed NSGAII is more appropriate than LP-metric, and thus, solving the large size problems through GAMS in a logical time is impossible.


Main Subjects

1. Gungor, A., and Gupta, S. M. (1999). “Issues in Environmentally Conscious Manufacturing and Product Recovery: A Survey”, Computers and Industrial Engineering, Vol. 36, No. 4, PP. 811-853.
2. Ashtiani, M., Makui, A., and Ramezanian, R., (2011). “Huff-Type Competitive Facility Location Model with Foresight in a Discrete Space”, Management Science Letters, Vol. 1, No. 1, PP. 1-12.
3. Ahn, H. K. et al. (2004). “Competitive Facility Location: The Voronoi Game”, Theoretical Computer Science, Vol. 310, No. 1 and 3, PP. 457-467.
4. Ashtiani, M. (2016). “Competitive Location: A State-of-Art Review”, International Journal of Industrial Engineering Computations, Vol. 7, No. 1. PP. 1-18.
5. Govindan, K., and Soleimani, H., (2017). “A Review of Reverse Logistics and Closed-Loop Supply Chains: A Journal of Cleaner Production Focus”, Journal of Cleaner Production, Vol. 142, No. 1, PP. 371-384.
6. Hotelling, H., (1929). “Stability In Competition”, The Economic Journal, Vol. 39, No. 153, PP. 41-57.
7. Goodchild, M. F. (1984). “LACS: A Location-Allocation Mode for Retail Site Selection”, Journal of Retailing, Vol. 60, No. 1, PP. 84-100.
8. Drezner, T. (1994). “Optimal Continuous Location of a Retail Facility, Facility Attractiveness and Market Share: An Interactive Model”, Journal of Retailing, Vol. 70, No. 1, PP. 49-64.
9. Drezner, T., Drezner, Z., and Salhi, S. (2002). “Solving the Multiple Competitive Facilities Location Problem”, European Journal of Operational Research, Vol. 142, No. 1, PP. 138-151.
10. Christaller, W. (1966). “Central Places in Southern Germany: Prentice-Hall”.
11. Xiu Li, P,. and Yu-Qiang, F. (2006). “Solving Competitive Facilities Location Problem with the Clonal Selection Algorithm”, In Management Science and Engineering, ICMSE'06. 2006 International Conference On.
12. Wendell, R. E., and Mckelvey, R. D. (1981). “New Perspectives in Competitive Location Theory”, European Journal of Operational Research, Vol. 6, No. 2, PP. 174-182.
13. Zhao, Y., Chen, W., and Teng, S. H. (2009). “The Isolation Game: A Game of Distances”, Theoretical Computer Science, Vol. 410, No. 47-49, PP. 4905-4919.
14. Meng, Q., Huang, Y., and Cheu, R. L. (2009). “Competitive Facility Location on Decentralized Supply Chains”, European Journal of Operational Research, Vol. 196, No. 2, PP. 487-499.
15. Ghosh, A., and Craig, C. S. (1984). “A Location Allocation Model for Facility Planning in a Competitive Environment”, Geographical Analysis, Vol. 16, No. 1, PP. 39-51.
16. Küçükaydin, H., Aras, N., and Altınel, I. K. (2011). “Competitive Facility Location Problem with Attractiveness Adjustment of the Follower: A Bilevel Programming Model and Its Solution”, European Journal of Operational Research, Vol. 3, No. 208, PP. 206-220.
17. Konur, D., and Geunes, J. (2011). “Analysis of Traffic Congestion Costs in a Competitive Supply Chain”, Transportation Research Part E: Logistics and Transportation Review, Vol. 47, No. 1, PP. 1-17.
18. Aboolian, R., Berman, O., and Krass, D., (2007). “Competitive Facility Location and Design Problem”, European Journal of Operational Research, Vol. 1, No. 182, PP. 40-62.
19. Fernández, J. et al. (2007). “Planar Location and Design of a New Facility with Inner and Outer Competition: An Interval Lexicographical-Like Solution Procedure”, Networks and Spatial Economics, Vol. 7, No. 1, PP. 19-44.
20. Revelle, C., (1986). “The Maximum Capture or “Sphere of Influence” Location Problem: Hotelling Revisited on a Network”, Journal of Regional Science, Vol. 26, No. 2, PP. 343-358.
21. Serra, D., Marianov, V., and Revelle, C. (1992). “The Maximum-Capture Hierarchical Location Problem”, European Journal of Operational Research, Vol. 62, No. 3, PP. 363-371.
22. Santos Peñate, D., Suárez Vega, R., and Dorta González, P. (2007). “The Leader–Follower Location Model”, Networks and Spatial Economics, Vol. 7, No. 1,PP. 45-61.
23. Karkazis, J. (1989). “Facilities Location in a Competitive Environment: A Promethee Based Multiple Criteria Analysis”, European Journal of Operational Research, Vol. 42, No. 3, PP. 294-304.
24. Suárez Vega, R., Santos Peñate, D. R., and Dorta González, P. (2004). “Competitive Multifacility Location on Networks: The (R∣ Xp)‐Medianoid Problem”, Journal of Regional Science, Vol. 44, No. 3, PP. 569-588.
25. Lerner, A. P., and Singer, H. W. (1937). “Some Notes on Duopoly and Spatial Competition”, Journal of Political Economy, Vol. 45. No. 2, PP. 145-186.
26. Megiddo, N., Zemel, E., and Hakimi, S. L. (1983). “The Maximum Coverage Location Problem”, SIAM Journal on Algebraic Discrete Methods, Vol. 4, No. 2, PP. 253-261.
27. Eaton, B. C., and Lipsey, R. G. (1975). “The Principle of Minimum Differentiation Reconsidered: Some New Developments in the Theory of Spatial Competition”, The Review of Economic Studies, Vol. 42, No. 1, PP. 27-49.
28. Pelegrín, B., Suárez Vega, R., and Cano, S. (2012). “Isodistant Points in Competitive Network Facility Location”, Top, Vol. 20, No. 3, PP. 639-660.
29. Beresnev, V., and Suslov, V. (2010). “A Mathematical Model of Market Competition”, Journal of Applied and Industrial Mathematics, Vol. 4, No. 2, PP. 147-157.
30. Miller, T. C. et al. (2007). “Reaction Function Based Dynamic Location Modeling in Stackelberg–Nash–Cournot Competition”, Networks and Spatial Economics, Vol. 7, No. 1, PP. 77-97.
31. Liu, L. et al. (2017). “Collection Effort and Reverse Channel Choices in a Closed-Loop Supply Chain”, Journal of Cleaner Production, Vol. 144,  PP. 492-500.
32. Deb, K. et al. (2002). “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II”, IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2, PP. 182-197.