IDEAS home Printed from
   My bibliography  Save this paper

A hybridised taboo search heuristic to increase security in a utility network


  • JANSSENS, Jochen
  • TALARICO, Luca
  • SÖRENSEN, Kenneth


In this paper we propose a decision model aimed at increasing security in a utility network (e.g., smart grid, water network). The network consists of edges that might be a viable target for terrorists depending on several factors such as geographical location, accessibility of the network, the political stability of a region. Based on this we assume that all edges (e.g., pipes, cables) have a certain, not necessary equal, probability of failure, which can be reduced by selecting appropriate edge-specific security strategies. The decision model proposed in this paper is based on a metaheuristic approach, that uses taboo search hybridised with iterated local search and a large scale neighbourhood decent heuristic. The main goal is to reduce the risk of service failure between a couple of network nodes by selecting the right combination of security measures for each network edge given a limited security budget. A generator for realistic instances is proposed and used to create a set of test instances. Experiments on these instances are conducted to tune the parameters and evaluate the proposed metaheuristic algorithm.

Suggested Citation

  • JANSSENS, Jochen & TALARICO, Luca & SÖRENSEN, Kenneth, 2014. "A hybridised taboo search heuristic to increase security in a utility network," Working Papers 2014023, University of Antwerp, Faculty of Applied Economics.
  • Handle: RePEc:ant:wpaper:2014023

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    2. repec:eee:reensy:v:98:y:2012:i:1:p:35-42 is not listed on IDEAS
    Full references (including those not matched with items on IDEAS)

    More about this item


    Network security; Metaheuristics; Knapsack problem;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2014023. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.