How to cite this paper
Mohammadipour, F., Amiri, M., Vanani, I & Soofi, J. (2022). A model for location-assortment problem in a competitive environment.International Journal of Industrial Engineering Computations , 13(4), 641-660.
Refrences
Arbib, C., Pınar, M. Ç., & Tonelli, M. (2020). Competitive location and pricing on a line with metric transportation costs. European journal of operational research, 282(1), 188-200.
Aouad, A., Farias, V., Levi, R., & Segev, D. (2018). The approximability of assortment optimization under ranking preferences. Operations Research, 66(6), 1661-1669.
Arrondo, A. G., Redondo, J. L., Fernández, J., & Ortigosa, P. M. (2015). Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem. Applied Mathematics and Computation, 255, 114-124.
Ashtiani, M. (2016). Competitive location: a state-of-art review. International Journal of Industrial Engineering Computations, 7(1), 1-18.
Bagherinejad, J., & Niknam, A. (2018). Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method. Journal of Industrial Engineering International, 14(1), 171-183.
Benati, S., & Hansen, P. (2002). The maximum capture problem with random utilities: Problem formulation and algorithms. European Journal of Operational Research, 143(3), 518-530.
Beresnev, V. L., & Suslov, V. I. (2010). A mathematical model of market competition. Journal of Applied and Industrial Mathematics, 4(2), 147-157.
Besbes, O., & Sauré, D. (2016). Product assortment and price competition under multinomial logit demand. Production and Operations Management, 25(1), 114-127.
Bernstein, F., Kök, A. G., & Xie, L. (2015). Dynamic assortment customization with limited inventories. Manufacturing & Service Operations Management, 17(4), 538-553.
Blanchet, J., Gallego, G., & Goyal, V. (2016). A markov chain approximation to choice modeling. Operations Research, 64(4), 886-905.
Boglárka, G., Anton-Sanchez, L., Fernández, J., Redondo, J. L., & Ortigosa, P. M. (2019, July). A Continuous Competitive Facility Location and Design Problem for Firm Expansion. In World Congress on Global Optimization (pp. 1013-1022). Springer, Cham.
Chung, H., Ahn, H. S., & Jasin, S. (2019). (Rescaled) Multi‐Attempt Approximation of Choice Model and Its Application to Assortment Optimization. Production and Operations Management, 28(2), 341-353.
Çömez-Dolgan, N., Fescioglu-Unver, N., Cephe, E., & Şen, A. (2021). Capacitated strategic assortment planning under explicit demand substitution. European Journal of Operational Research.
Désir, A., Goyal, V., Segev, D., & Ye, C. (2020). Constrained assortment optimization under the markov chain–based choice model. Management Science, 66(2), 698-721.
Díaz, J. A., Luna, D. E., Camacho-Vallejo, J. F., & Casas-Ramírez, M. S. (2017). GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. Expert Systems with Applications, 82, 67-76.
Drezner, T. (1994a). Locating a single new facility among existing, unequally attractive facilities. Journal of Regional Science, 34(2), 237-252.
Drezner, T. (1994b). Optimal continuous location of a retail facility, facility attractiveness, and market share: an interactive model. Journal of retailing, 70(1), 49-64.
Drezner, T. (2014). A review of competitive facility location in the plane. Logistics Research, 7(1), 114.
Drezner, T., Drezner, Z., & Kalczynski, P. (2015). A leader–follower model for discrete competitive facility location. Computers & Operations Research, 64, 51-59.
Drezner, T., Drezner, Z., & Zerom, D. (2018). Competitive facility location with random attractiveness. Operations Research Letters, 46(3), 312-317.
Economides, N. (1986). Minimal and maximal product differentiation in Hotelling's duopoly. Economics letters, 21(1), 67-71.
Feldman, J., Paul, A., & Topaloglu, H. (2019). Assortment optimization with small consideration sets. Operations Research, 67(5), 1283-1299.
Feldman, J. B., & Topaloglu, H. (2015a). Capacity constraints across nests in assortment optimization under the nested logit model. Operations Research, 63(4), 812-822.
Feldman, J., & Topaloglu, H. (2015). Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits. Production and Operations Management, 24(10), 1598-1620.
Feldman, J. B., & Topaloglu, H. (2017). Revenue management under the markov chain choice model. Operations Research, 65(5), 1322-1342.
Fernández, J., Boglárka, G., Redondo, J. L., & Ortigosa, P. M. (2019). The probabilistic customer’s choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane. Computers & Operations Research, 101, 234-249.
Fernández, J., Boglárka, G., Redondo, J. L., Ortigosa, P. M., & Arrondo, A. G. (2017a). A planar single-facility competitive location and design problem under the multi-deterministic choice rule. Computers & Operations Research, 78, 305-315.
Fernández, P., Pelegrín, B., Lančinskas, A., & Žilinskas, J. (2017b). New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. Computers & Operations Research, 79, 12-18.
Fernández, J., Pelegrı, B., Plastria, F., & Tóth, B. (2007). Solving a Huff-like competitive location and design model for profit maximization in the plane. European Journal of operational research, 179(3), 1274-1287.
Gallego, G., & Topaloglu, H. (2019). Revenue management and pricing analytics (Vol. 209). New York, NY: Springer.
Gentile, J., Pessoa, A. A., Poss, M., & Roboredo, M. C. (2018). Integer programming formulations for three sequential discrete competitive location problems with foresight. European Journal of Operational Research, 265(3), 872-881.
Ghaffarinasab, N., Motallebzadeh, A., Jabarzadeh, Y., & Kara, B. Y. (2018). Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. Computers & Operations Research, 90, 173-192.
Goyal, V., Levi, R., & Segev, D. (2016). Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand. Operations Research, 64(1), 219-235.
Hakimi, S. L. (1990). Locations with spatial interactions: competitive locations and games. Discrete location theory.
He, Z., Cheng, T. C. E., Dong, J., & Wang, S. (2016). Evolutionary location and pricing strategies for service merchants in competitive O2O markets. European Journal of Operational Research, 254(2), 595-609.
Hendrix, E. M. (2016). On competition in a Stackelberg location-design model with deterministic supplier choice. Annals of Operations Research, 246(1), 19-30.
Hense, J., & Hübner, A. (2022). Assortment optimization in omni-channel retailing. European Journal of Operational Research, 301(1), 124-140.
Hosseini-Nasab, H., & Tavana-Chehartaghi, M. (2021). Investigating the location-routing problem in the competitive environment. International Journal of Logistics Economics and Globalisation, 9(2), 81-104.
Iellamo, S., Alekseeva, E., Chen, L., Coupechoux, M., & Kochetov, Y. (2015). Competitive location in cognitive radio networks. 4OR, 13(1), 81-110.
Jagabathula, S., & Rusmevichientong, P. (2017). A nonparametric joint assortment and price choice model. Management Science, 63(9), 3128-3145.
Khodaee, S., Roghanian, E., & Ghaffarinasab, N. (2022). Competitive multiple allocation hub location problem considering primary and backup routes. Computational and Applied Mathematics, 41(4), 1-62.
Kress, D., & Pesch, E. (2016). Competitive location and pricing on networks with random utilities. Networks and Spatial Economics, 16(3), 837-863.
Kök, A. G., & Fisher, M. L. (2007). Demand estimation and assortment optimization under substitution: Methodology and application. Operations Research, 55(6), 1001-1021.
Legault, R., & Frejinger, E. (2022). A Simulation Approach for Competitive Facility Location with Random Utility Maximizing Customers. arXiv preprint arXiv:2203.11329.
Levanova, T. V., & Gnusarev, A. Y. (2020). Variable neighborhood search algorithms for a competitive location problem with elastic demand. Journal of Applied and Industrial Mathematics, 14(4), 693-705.
Li, Y., & Li, X. (2021). Quantity decisions of two-stage competitive location model based on different location modes. Complex & Intelligent Systems, 1-12.
Ma, H., Guan, X., & Wang, L. (2020). A single-facility competitive location problem in the plane based on customer choice rules. Journal of Data, Information and Management, 2(4), 323-336.
Mahmoodjanloo, M., Tavakkoli-Moghaddam, R., Baboli, A., & Jamiri, A. (2020). A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand. Computers & Operations Research, 123, 105048.
Meagher, K. J., & Zauner, K. G. (2004). Product differentiation and location decisions under demand uncertainty. Journal of Economic Theory, 117(2), 201-216.
Nip, K., Wang, C., & Wang, Z. (2022). Competitive and Cooperative Assortment Games under Markov Chain Choice Model. Production and Operations Management, 31(3), 1033-1051.
Plastria, F. (2001). Static competitive facility location: an overview of optimisation approaches. European Journal of Operational Research, 129(3), 461-470.
Qi, M., Xia, M., Zhang, Y., & Miao, L. (2017). Competitive facility location problem with foresight considering service distance limitations. Computers & Industrial Engineering, 112, 483-491.
Rahmani, A., & Hosseini, M. (2021). A competitive stochastic bi-level inventory location problem. International Journal of Management Science and Engineering Management, 16(3), 209-220.
Redondo, J. L., Fernández, J., Hervás, J. D. Á., Arrondo, A. G., & Ortigosa, P. M. (2015). Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem. Computers & Operations Research, 62, 337-349.
Rohaninejad, M., Navidi, H., Nouri, B. V., & Kamranrad, R. (2017). A new approach to cooperative competition in facility location problems: Mathematical formulations and an approximation algorithm. Computers & Operations Research, 83, 45-53.
Sadjadi, S. J., Gorji Ashtiani, M., Makui, A., & Ramezanian, R. (2020). A mathematical model for competitive location problem with product selection. Scientia Iranica, 27(4), 2157-2176.
Sadowski, W. (1959). A few remarks on the assortment problem. Management Science, 6(1), 13-24.
Sen, A., Atamtürk, A., & Kaminsky, P. (2018). A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Operations Research, 66(4), 994-1003.
Shankar, B. L., Basavarajappa, S., Chen, J. C., & Kadadevaramath, R. S. (2013). Location and allocation decisions for multi-echelon supply chain network–A multi-objective evolutionary approach. Expert Systems with Applications, 40(2), 551-562.
Smith, S. A., & Agrawal, N. (2000). Management of multi-item retail inventory systems with demand substitution. Operations Research, 48(1), 50-64.
Tilahun, S. L., & Ngnotchouye, J. M. T. (2017). Firefly algorithm for discrete optimization problems: A survey. KSCE Journal of civil Engineering, 21(2), 535-545.
Train, K. E. (2009). Discrete choice methods with simulation. Cambridge university press.
Transchel, S., Buisman, M. E., & Haijema, R. (2022). Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution. European Journal of Operational Research, 301(1), 163-179.
Wang, S. C., Lin, C. C., Chen, T. C., & Hsiao, H. C. (2018). Multi-objective competitive location problem with distance-based attractiveness for two facilities. Computers & Electrical Engineering, 71, 237-250.
Yang, X. S. (2009, October). Firefly algorithms for multimodal optimization. In International symposium on stochastic algorithms (pp. 169-178). Springer, Berlin, Heidelberg.
Yücel, E., Karaesmen, F., Salman, F. S., & Türkay, M. (2009). Optimizing product assortment under customer-driven demand substitution. European Journal of Operational Research, 199(3), 759-768.
Zambrano-Rey, G., López-Ospina, H., & Pérez, J. (2019). Retail store location and pricing within a competitive environment using constrained multinomial logit. Applied Mathematical Modelling, 75, 521-534.
Zhang, L., & Rushton, G. (2008). Optimizing the size and locations of facilities in competitive multi-site service systems. Computers & Operations Research, 35(2), 327-338.
Aouad, A., Farias, V., Levi, R., & Segev, D. (2018). The approximability of assortment optimization under ranking preferences. Operations Research, 66(6), 1661-1669.
Arrondo, A. G., Redondo, J. L., Fernández, J., & Ortigosa, P. M. (2015). Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem. Applied Mathematics and Computation, 255, 114-124.
Ashtiani, M. (2016). Competitive location: a state-of-art review. International Journal of Industrial Engineering Computations, 7(1), 1-18.
Bagherinejad, J., & Niknam, A. (2018). Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method. Journal of Industrial Engineering International, 14(1), 171-183.
Benati, S., & Hansen, P. (2002). The maximum capture problem with random utilities: Problem formulation and algorithms. European Journal of Operational Research, 143(3), 518-530.
Beresnev, V. L., & Suslov, V. I. (2010). A mathematical model of market competition. Journal of Applied and Industrial Mathematics, 4(2), 147-157.
Besbes, O., & Sauré, D. (2016). Product assortment and price competition under multinomial logit demand. Production and Operations Management, 25(1), 114-127.
Bernstein, F., Kök, A. G., & Xie, L. (2015). Dynamic assortment customization with limited inventories. Manufacturing & Service Operations Management, 17(4), 538-553.
Blanchet, J., Gallego, G., & Goyal, V. (2016). A markov chain approximation to choice modeling. Operations Research, 64(4), 886-905.
Boglárka, G., Anton-Sanchez, L., Fernández, J., Redondo, J. L., & Ortigosa, P. M. (2019, July). A Continuous Competitive Facility Location and Design Problem for Firm Expansion. In World Congress on Global Optimization (pp. 1013-1022). Springer, Cham.
Chung, H., Ahn, H. S., & Jasin, S. (2019). (Rescaled) Multi‐Attempt Approximation of Choice Model and Its Application to Assortment Optimization. Production and Operations Management, 28(2), 341-353.
Çömez-Dolgan, N., Fescioglu-Unver, N., Cephe, E., & Şen, A. (2021). Capacitated strategic assortment planning under explicit demand substitution. European Journal of Operational Research.
Désir, A., Goyal, V., Segev, D., & Ye, C. (2020). Constrained assortment optimization under the markov chain–based choice model. Management Science, 66(2), 698-721.
Díaz, J. A., Luna, D. E., Camacho-Vallejo, J. F., & Casas-Ramírez, M. S. (2017). GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. Expert Systems with Applications, 82, 67-76.
Drezner, T. (1994a). Locating a single new facility among existing, unequally attractive facilities. Journal of Regional Science, 34(2), 237-252.
Drezner, T. (1994b). Optimal continuous location of a retail facility, facility attractiveness, and market share: an interactive model. Journal of retailing, 70(1), 49-64.
Drezner, T. (2014). A review of competitive facility location in the plane. Logistics Research, 7(1), 114.
Drezner, T., Drezner, Z., & Kalczynski, P. (2015). A leader–follower model for discrete competitive facility location. Computers & Operations Research, 64, 51-59.
Drezner, T., Drezner, Z., & Zerom, D. (2018). Competitive facility location with random attractiveness. Operations Research Letters, 46(3), 312-317.
Economides, N. (1986). Minimal and maximal product differentiation in Hotelling's duopoly. Economics letters, 21(1), 67-71.
Feldman, J., Paul, A., & Topaloglu, H. (2019). Assortment optimization with small consideration sets. Operations Research, 67(5), 1283-1299.
Feldman, J. B., & Topaloglu, H. (2015a). Capacity constraints across nests in assortment optimization under the nested logit model. Operations Research, 63(4), 812-822.
Feldman, J., & Topaloglu, H. (2015). Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits. Production and Operations Management, 24(10), 1598-1620.
Feldman, J. B., & Topaloglu, H. (2017). Revenue management under the markov chain choice model. Operations Research, 65(5), 1322-1342.
Fernández, J., Boglárka, G., Redondo, J. L., & Ortigosa, P. M. (2019). The probabilistic customer’s choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane. Computers & Operations Research, 101, 234-249.
Fernández, J., Boglárka, G., Redondo, J. L., Ortigosa, P. M., & Arrondo, A. G. (2017a). A planar single-facility competitive location and design problem under the multi-deterministic choice rule. Computers & Operations Research, 78, 305-315.
Fernández, P., Pelegrín, B., Lančinskas, A., & Žilinskas, J. (2017b). New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. Computers & Operations Research, 79, 12-18.
Fernández, J., Pelegrı, B., Plastria, F., & Tóth, B. (2007). Solving a Huff-like competitive location and design model for profit maximization in the plane. European Journal of operational research, 179(3), 1274-1287.
Gallego, G., & Topaloglu, H. (2019). Revenue management and pricing analytics (Vol. 209). New York, NY: Springer.
Gentile, J., Pessoa, A. A., Poss, M., & Roboredo, M. C. (2018). Integer programming formulations for three sequential discrete competitive location problems with foresight. European Journal of Operational Research, 265(3), 872-881.
Ghaffarinasab, N., Motallebzadeh, A., Jabarzadeh, Y., & Kara, B. Y. (2018). Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. Computers & Operations Research, 90, 173-192.
Goyal, V., Levi, R., & Segev, D. (2016). Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand. Operations Research, 64(1), 219-235.
Hakimi, S. L. (1990). Locations with spatial interactions: competitive locations and games. Discrete location theory.
He, Z., Cheng, T. C. E., Dong, J., & Wang, S. (2016). Evolutionary location and pricing strategies for service merchants in competitive O2O markets. European Journal of Operational Research, 254(2), 595-609.
Hendrix, E. M. (2016). On competition in a Stackelberg location-design model with deterministic supplier choice. Annals of Operations Research, 246(1), 19-30.
Hense, J., & Hübner, A. (2022). Assortment optimization in omni-channel retailing. European Journal of Operational Research, 301(1), 124-140.
Hosseini-Nasab, H., & Tavana-Chehartaghi, M. (2021). Investigating the location-routing problem in the competitive environment. International Journal of Logistics Economics and Globalisation, 9(2), 81-104.
Iellamo, S., Alekseeva, E., Chen, L., Coupechoux, M., & Kochetov, Y. (2015). Competitive location in cognitive radio networks. 4OR, 13(1), 81-110.
Jagabathula, S., & Rusmevichientong, P. (2017). A nonparametric joint assortment and price choice model. Management Science, 63(9), 3128-3145.
Khodaee, S., Roghanian, E., & Ghaffarinasab, N. (2022). Competitive multiple allocation hub location problem considering primary and backup routes. Computational and Applied Mathematics, 41(4), 1-62.
Kress, D., & Pesch, E. (2016). Competitive location and pricing on networks with random utilities. Networks and Spatial Economics, 16(3), 837-863.
Kök, A. G., & Fisher, M. L. (2007). Demand estimation and assortment optimization under substitution: Methodology and application. Operations Research, 55(6), 1001-1021.
Legault, R., & Frejinger, E. (2022). A Simulation Approach for Competitive Facility Location with Random Utility Maximizing Customers. arXiv preprint arXiv:2203.11329.
Levanova, T. V., & Gnusarev, A. Y. (2020). Variable neighborhood search algorithms for a competitive location problem with elastic demand. Journal of Applied and Industrial Mathematics, 14(4), 693-705.
Li, Y., & Li, X. (2021). Quantity decisions of two-stage competitive location model based on different location modes. Complex & Intelligent Systems, 1-12.
Ma, H., Guan, X., & Wang, L. (2020). A single-facility competitive location problem in the plane based on customer choice rules. Journal of Data, Information and Management, 2(4), 323-336.
Mahmoodjanloo, M., Tavakkoli-Moghaddam, R., Baboli, A., & Jamiri, A. (2020). A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand. Computers & Operations Research, 123, 105048.
Meagher, K. J., & Zauner, K. G. (2004). Product differentiation and location decisions under demand uncertainty. Journal of Economic Theory, 117(2), 201-216.
Nip, K., Wang, C., & Wang, Z. (2022). Competitive and Cooperative Assortment Games under Markov Chain Choice Model. Production and Operations Management, 31(3), 1033-1051.
Plastria, F. (2001). Static competitive facility location: an overview of optimisation approaches. European Journal of Operational Research, 129(3), 461-470.
Qi, M., Xia, M., Zhang, Y., & Miao, L. (2017). Competitive facility location problem with foresight considering service distance limitations. Computers & Industrial Engineering, 112, 483-491.
Rahmani, A., & Hosseini, M. (2021). A competitive stochastic bi-level inventory location problem. International Journal of Management Science and Engineering Management, 16(3), 209-220.
Redondo, J. L., Fernández, J., Hervás, J. D. Á., Arrondo, A. G., & Ortigosa, P. M. (2015). Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem. Computers & Operations Research, 62, 337-349.
Rohaninejad, M., Navidi, H., Nouri, B. V., & Kamranrad, R. (2017). A new approach to cooperative competition in facility location problems: Mathematical formulations and an approximation algorithm. Computers & Operations Research, 83, 45-53.
Sadjadi, S. J., Gorji Ashtiani, M., Makui, A., & Ramezanian, R. (2020). A mathematical model for competitive location problem with product selection. Scientia Iranica, 27(4), 2157-2176.
Sadowski, W. (1959). A few remarks on the assortment problem. Management Science, 6(1), 13-24.
Sen, A., Atamtürk, A., & Kaminsky, P. (2018). A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Operations Research, 66(4), 994-1003.
Shankar, B. L., Basavarajappa, S., Chen, J. C., & Kadadevaramath, R. S. (2013). Location and allocation decisions for multi-echelon supply chain network–A multi-objective evolutionary approach. Expert Systems with Applications, 40(2), 551-562.
Smith, S. A., & Agrawal, N. (2000). Management of multi-item retail inventory systems with demand substitution. Operations Research, 48(1), 50-64.
Tilahun, S. L., & Ngnotchouye, J. M. T. (2017). Firefly algorithm for discrete optimization problems: A survey. KSCE Journal of civil Engineering, 21(2), 535-545.
Train, K. E. (2009). Discrete choice methods with simulation. Cambridge university press.
Transchel, S., Buisman, M. E., & Haijema, R. (2022). Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution. European Journal of Operational Research, 301(1), 163-179.
Wang, S. C., Lin, C. C., Chen, T. C., & Hsiao, H. C. (2018). Multi-objective competitive location problem with distance-based attractiveness for two facilities. Computers & Electrical Engineering, 71, 237-250.
Yang, X. S. (2009, October). Firefly algorithms for multimodal optimization. In International symposium on stochastic algorithms (pp. 169-178). Springer, Berlin, Heidelberg.
Yücel, E., Karaesmen, F., Salman, F. S., & Türkay, M. (2009). Optimizing product assortment under customer-driven demand substitution. European Journal of Operational Research, 199(3), 759-768.
Zambrano-Rey, G., López-Ospina, H., & Pérez, J. (2019). Retail store location and pricing within a competitive environment using constrained multinomial logit. Applied Mathematical Modelling, 75, 521-534.
Zhang, L., & Rushton, G. (2008). Optimizing the size and locations of facilities in competitive multi-site service systems. Computers & Operations Research, 35(2), 327-338.