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

Authors

  • Hamidreza Maleki
  • Zahra Maleki
  • Reza Akbari

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 defensive location problem where the threatening agent (t-agent) has the ability to 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 find the best locations 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, 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 artificial bee colony with differential evolution, artificial bee colony algorithms and a modified tabu search (MTS) algorithm are used to solve the problem. A test problem is randomly generated to investigate the performance of the used metaheuristic algorithms in this paper. Parameters of the metaheuristic algorithms are tuned by the Taguchi method for solving the test problem. Also, the ANOVA and Tukey tests are used to compare the performance of metaheuristic algorithms. The best results are obtained by the MTS algorithm

Downloads

Published

2021-03-30

Issue

Vol. 16

Section

Vol. 16, No. 2, (2022)

License

Upon acceptance of an article, authors will be asked to complete a 'Journal Publishing Agreement'. An e-mail will be sent to the corresponding author confirming receipt of the manuscript together with a "Journal Publishing Agreement" form or a link to the online version of this agreement.

Journal author rights

Authors have copyright but license exclusive rights in their article to the publisher. In this case authors have the right to:

  • Share their article in the same ways permitted to third parties under the relevant user license (together with Personal use rights) so long as it contains a link to the version of record on this website.
  • Retain patent, trademark and other intellectual property rights (including raw research data).
  • Proper attribution and credit for the published work.

Rights granted to this journal

The Journal of Mathematical Extension is granted the following rights:

  • This journal will apply the relevant third party user license where this journal publishes the article on its online platforms.
  • The right to provide the article in all forms and media so the article can be used on the latest technology even after publication.
  • The authority to enforce the rights in the article, on behalf of an author, against third parties, for example in the case of plagiarism or copyright infringement.

Protecting author right

Copyright aims to protect the specific way the article has been written to describe an experiment and the results. This journal is committed to its authors to protect and defend their work and their reputation and takes allegations of infringement, plagiarism, ethic disputes and fraud very seriously.

If an author becomes aware of a possible plagiarism, fraud or infringement we recommend contacting the editorial office immediately.

Personal use

Authors can use their articles, in full or in part, for a wide range of scholarly, non-commercial purposes as outlined below:

  • Use by an author in the author’s classroom teaching (including distribution of copies, paper or electronic)
  • Distribution of copies (including through e-mail) to known research colleagues for their personal use (but not for Commercial Use)
  • Inclusion in a thesis or dissertation (provided that this is not to be published commercially)
  • Use in a subsequent compilation of the author’s works
  • Extending the Article to book-length form
  • Preparation of other derivative works (but not for Commercial Use)
  • Otherwise using or re-using portions or excerpts in other works

These rights apply for all authors who publish their article in this journal. In all cases we require that all authors always include a full acknowledgement and, if appropriate, a link to the final published version hosted on this website.