Abstract
This paper deals with the integer inverse obnoxious p-median location problem on tree networks in which the aim is to modify the edge lengths by integer amounts at the minimum overall cost within certain modification bounds so that a given set of p vertices, defining the predetermined facility locations, becomes an obnoxious p-median location of the perturbed network. We develop exact combinatorial approaches for obtaining the optimal solutions of the problem under the weighted Chebyshev and the weighted bottleneck-type combining cost norms. Moreover, the optimal solution algorithms with linear time complexities are proposed for the problem under the weighted bottleneck-type Hamming and the weighted extended bottleneck-type Hamming cost norms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Afrashteh E, Alizadeh B, Baroughi F, Nguyen KT (2018) Linear time optimal approaches for max-profit inverse 1-median location problems. Asia-Pac J Oper Res 35:1850030
Afrashteh E, Alizadeh B, Baroughi F (2019) Optimal algorithms for selective variants of the classical and inverse median location problems on trees. Optim Methods Softw 34:1213–1230
Afrashteh E, Alizadeh B, Baroughi F (2021) Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks. J Oper Res Soc China 5:99–117
Alizadeh B, Bakhteh S (2017) A modified firefly algorithm for general inverse \(p\)-median location problems under different distance norms. Opsearch 54:618–636
Alizadeh B, Afrashteh E, Baroughi F (2018) Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks. J Optim Theory Appl 178:914–934
Alizadeh B, Afrashteh E, Baroughi F (2019) Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms. Theor Comput Sci 772:73–87
Baroughi Bonab F, Burkard RE, Alizadeh B (2010) Inverse median location problems with variable coordinates. CEJOR 18:365–381
Baroughi Bonab F, Burkard RE, Gassner E (2011) Inverse \( p \)-median problems with variable edge lengths. Math Methods Oper Res 73:263–280
Burkard RE, Pleschiutsching C, Zhang J (2004) Inverse median problems. Discrete Optim 1:23–39
Burkard RE, Fathali J, Kakhki HT (2007) The \( p \)-maxian problem on a tree. Oper Res Lett 35:331–335
Burkard RE, Pleschiutsching C, Zhang J (2008) The inverse 1-median problem on a cycle. Discrete Optim 5:242–253
Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge
Eiselt HA, Marianov V (eds) (2011) Foundation of location analysis. Springer, New York
Farahani RZ, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies. Physica Verlag, Berlin
Fathali J (2022) A row generation method for the inverse continuous facility location problems. Comput Ind Eng 171:108482
Fathali J, Gholami M (2022) The inverse minsum circle location problem. Yugosl J Oper Res 32:153–165
Gassner E (2008) The inverse 1-maxian problem with edge length modification. J Comb Optim 16:50–67
Guan XC, Zhang BW (2012) Inverse 1-median problem on trees under weighted Hamming distance. J Global Optim 54:75–82
Hatzl J (2012) 2-Balanced flows and the inverse 1-median problem in the Chebyshev space. Discrete Optim 9:137–148
Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New York
Mohammadi S, Alizadeh B, Baroughi F, Afrashteh E (2022) A modified directional bat algorithm for extensive inverse p-facility maxian location problems on networks. Soft Comput 26:1941–1959
Nguyen KT (2016) Inverse 1-median problem on block graphs with variable vertex weights. J Optim Theory Appl 168:944–957
Nguyen KT, Chi NTL (2016) A model for the inverse 1-median problem on trees under uncertain costs. Opusc Math 36:513–523
Nguyen KT, Vui PT (2016) The inverse \(p\)-maxian problem on trees with variable edge lengths. Taiwan J Math 20:1437–1449
Pham VH, Nguyen KT (2019) Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms. Theor Comput Sci 795:119–127
Sepasian AR, Rahbarnia F (2015) An \( \cal{O} (n \log n) \) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization 64:595–602
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Margherita Porcelli.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Mohammadi, S., Alizadeh, B. & Afrashteh, E. Optimal algorithms for integer inverse obnoxious p-median location problems on tree networks. Comp. Appl. Math. 42, 312 (2023). https://doi.org/10.1007/s40314-023-02451-2
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-023-02451-2