A Bi-Level Programming Model for Protecting an Important Node in a Network

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Maleki H. R.; MALEKI Z.; AKBARI R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF MATHEMATICAL EXTENSION Year:2022 | Volume:16 | Issue:2 Page(s): 00-00

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A Bi-Level Programming Model for Protecting an Important Node in a Network

Author(s)

Maleki H. R. | MALEKI Z. | AKBARI R. | Issue Writer Certificate

Keywords

Competitive facility location problem

Bi-level programming

Meta-heuristic algorithms

Abstract

Protecting important nodes in a network against natural disasters, security threats, attacks, and so on is one of the main goals of network planners. In this paper, a new model is presented for protecting an important node (NMPN) in a typical network based on a defensive location problem where the threatening agent (t-agent) can reinforce its power at some nodes. The NMPN is a Bi-level programming problem. At the upper level, the planner agent (p-agent) try to , nd the best lo-cations for protecting resources in order to protect the important node. The lower level problem is represented as the shortest path problem in the network in which the edges are weighted with positive values and sometimes negative values. Thus, the Bellman-Ford algorithm is applied to solve the lower level problem. The NMPN is an NP-hard problem. In this work, the genetic, ant colony optimization, binary arti, cial bee colony with di, erential evolution, arti, cial bee colony algorithms, and a modi, ed tabu search (MTS) algorithm are used to solve it. A test problem is randomly generated to investigate the performance of the metaheuristic algorithms in this paper. Parameters of the metaheuris-tic algorithms are tuned by the Taguchi method for solving the test problem. Also, the ANOVA test and Tukey's test are used to compare the performance of the metaheuristic algorithms. The best results are obtained by the MTS algorithm.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Maleki, H. R., MALEKI, Z., & AKBARI, R.. (2022). A Bi-Level Programming Model for Protecting an Important Node in a Network. JOURNAL OF MATHEMATICAL EXTENSION, 16(2), 00-00. SID. https://sid.ir/paper/1065619/en

Vancouver: Copy

Maleki H. R., MALEKI Z., AKBARI R.. A Bi-Level Programming Model for Protecting an Important Node in a Network. JOURNAL OF MATHEMATICAL EXTENSION[Internet]. 2022;16(2):00-00. Available from: https://sid.ir/paper/1065619/en

IEEE: Copy

H. R. Maleki, Z. MALEKI, and R. AKBARI, “A Bi-Level Programming Model for Protecting an Important Node in a Network,” JOURNAL OF MATHEMATICAL EXTENSION, vol. 16, no. 2, pp. 00–00, 2022, [Online]. Available: https://sid.ir/paper/1065619/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops