Skip to main content
SpringerLink
Log in

A modified directional bat algorithm for extensive inverse p-facility maxian location problems on networks

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper deals with an extensive variant of the inverse p-facility maxian location problem on networks in which the set of vertices is considered as the existing client points and the aim is to modify (augment or reduce) the underlying vertex weights and the arc lengths at the minimum overall cost with respect to the modification bounds so that a given set of p vertices, denoting the predetermined facility sites, becomes a p-facility maxian location of the perturbed network. A novel modified directional bat algorithm, as a meta-heuristic approach, is developed to solve the problem under the bottleneck-type Hamming, sum-type Hamming, rectilinear and Chebyshev cost norms. Through computational tests, the effectiveness of the proposed algorithm is shown.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

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 (22 pages)

  • 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

    Article  MathSciNet  Google Scholar 

  • Afrashteh E, Alizadeh B, Baroughi F (2021) Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks. Oper Res Soc China 9:99–117

    Article  MathSciNet  Google Scholar 

  • Alizadeh B, Afrashteh E (2020) Budget-constrained inverse median facility location problem on tree networks. Appl Math Comput 375:125078

    MathSciNet  Google Scholar 

  • Alizadeh B, Bakhteh S (2017) A modified firefly algorithm for general inverse \(p\)-median location problems under different distance norms. Opsearch 54:618–636

    Article  MathSciNet  Google Scholar 

  • 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

    Article  MathSciNet  Google Scholar 

  • 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

    Article  MathSciNet  Google Scholar 

  • Bonab FB, Burkard RE, Alizadeh B (2010) Inverse median location problems with variable coordinates. Cent Eur J Oper Res 18:365–381

    Article  MathSciNet  Google Scholar 

  • Bonab FB, Burkard RE, Gassner E (2011) Inverse \(p\)-median problems with variable edge lengths. Math Methods Oper Res 73:263–280

    Article  MathSciNet  Google Scholar 

  • Burkard RE, Pleschiutsching C, Zhang J (2004) Inverse median problems. Discrete Optim 1:23–39

    Article  MathSciNet  Google Scholar 

  • Burkard RE, Pleschiutsching C, Zhang J (2008) The inverse 1-median problem on a cycle. Discrete Optim 5:242–253

    Article  MathSciNet  Google Scholar 

  • Burkard RE, Galavii M, Gassner E (2010) The inverse Fermat–Weber problem. Eur J Oper Res 206:11–17

    Article  MathSciNet  Google Scholar 

  • Chakri A, Khelif R, Benouaret M, Yang X-S (2017) New directional bat algorithm for continuous optimization problems. Expert Syst Appl 69:159–175

    Article  Google Scholar 

  • Chen MR, Huang YY, Zeng GQ, Lu KD, Yang LQ (2021) An improved bat algorithm hybridized with extremal optimization and Boltzmann selection. Expert Syst Appl 175:114812

    Article  Google Scholar 

  • Eiselt HA, Marianov V (2011) Foundation of location analysis. Springer, New York

    Book  Google Scholar 

  • Farahani RZ, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies. Physica Verlag, Berlin

    Book  Google Scholar 

  • Gassner E (2008) The inverse 1-maxian problem with edge length modification. J Comb Optim 16:50–67

    Article  MathSciNet  Google Scholar 

  • Gholami M, Fathali J (2021) Mathematical models for the variable weights version of the inverse minimax circle location problem. J Math Model 9:137–144

    MathSciNet  MATH  Google Scholar 

  • Guan XC, Zhang BW (2012) Inverse 1-median problem on trees under weighted Hamming distance. J Glob Optim 54:75–82

    Article  MathSciNet  Google Scholar 

  • Hatzl J (2012) 2-Balanced flows and the inverse 1-median problem in the Chebyshev space. Discrete Optim 9:137–148

    Article  MathSciNet  Google Scholar 

  • Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New York

    MATH  Google Scholar 

  • Mirzapolis I, Baroughi F, Alizadeh B (2017) A modified firefly algorithm for general inverse p-median location problems under different distance norms. Fact Univ Ser Math Inform 32:447–468

    MATH  Google Scholar 

  • Nazari M, Fathali J (2018) Reverse backup 2-median problem with variable coordinate of vertices. J Oper Res Appl 15:63–88 (in Persian)

    Google Scholar 

  • Nguyen KT (2016) Inverse 1-median problem on block graphs with variable vertex weights. J Optim Theory Appl 168:944–957

    Article  MathSciNet  Google Scholar 

  • Nguyen KT, Chi NTL (2016) A model for the inverse 1-median problem on trees under uncertain costs. Opusc Math 36:513–523

    Article  MathSciNet  Google Scholar 

  • Nguyen T, Hung NT (2020) The inverse connected \(p\)-median problem on block graphs under various cost functions. Ann Oper Res 292:97-112

    Article  MathSciNet  Google Scholar 

  • Nguyen KT, Vui PT (2016) The inverse \(p\)-maxian problem on trees with variable edge lengths. Taiwan J Math 20:1437–1449

    Article  MathSciNet  Google Scholar 

  • Nguyen T, Hieu VNM, Pham VH (2021) Inverse group 1-median problem on trees. J Ind Manag Optim 17:221–232

    MathSciNet  MATH  Google Scholar 

  • Phama VH, Nguyen KT (2019) Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms. Theor Comput Sci 795:119–127

    Article  MathSciNet  Google Scholar 

  • Sepasian AR (2019) Reverse 1-maxian problem keeping existing 1-median. Opsearch 56:1–13

    Article  MathSciNet  Google Scholar 

  • 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

    MathSciNet  MATH  Google Scholar 

  • Soltanpour A, Baroughi F, Alizadeh B (2019) Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective. Soft Comput 23:7843–7852

    Article  Google Scholar 

  • Wimer U, Wimer S (2019) Resource allocation in rooted trees for VLSI applications. Optimization 68:1187–1201

    MathSciNet  MATH  Google Scholar 

  • Yang XS (2010) A new metaheuristic bat-inspired algorithm. Nat Inspired Coop Strateg Optim 284:65–74

    MATH  Google Scholar 

  • Yildizdan G, Baykan ÖK (2020) A novel modified bat algorithm hybridizing by differential evolution algorithm. Expert Syst Appl 141:112949

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran

    Sepideh Mohammadi, Behrooz Alizadeh, Fahimeh Baroughi & Esmaeil Afrashteh

Authors
  1. Sepideh Mohammadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Behrooz Alizadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fahimeh Baroughi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Esmaeil Afrashteh
    View author publications

    You can also search for this author in PubMed Google Scholar

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mohammadi, S., Alizadeh, B., Baroughi, F. et al. A modified directional bat algorithm for extensive inverse p-facility maxian location problems on networks. Soft Comput 26, 1941–1959 (2022). https://doi.org/10.1007/s00500-021-06463-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-021-06463-0

Keywords

Search

Navigation