IDEAS home Printed from https://ideas.repec.org/p/ant/wpaper/2014023.html
   My bibliography  Save this paper

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

Author

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

Abstract

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 Business and Economics.
    • Handle: RePEc:ant:wpaper:2014023
    as

    Download full text from publisher

    File URL: https://repository.uantwerpen.be/docman/irua/5bff28/128593.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    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. Reniers, G.L.L. & Sörensen, K. & Dullaert, W., 2012. "A multi-attribute Systemic Risk Index for comparing and prioritizing chemical industrial areas," Reliability Engineering and System Safety, Elsevier, vol. 98(1), pages 35-42.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Janssens, Jochen & Talarico, Luca & Sörensen, Kenneth, 2016. "A hybridised variable neighbourhood tabu search heuristic to increase security in a utility network," Reliability Engineering and System Safety, Elsevier, vol. 145(C), pages 221-230.
    2. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    3. Mohammadivojdan, Roshanak & Geunes, Joseph, 2018. "The newsvendor problem with capacitated suppliers and quantity discounts," European Journal of Operational Research, Elsevier, vol. 271(1), pages 109-119.
    4. Tom S. Clark & Aaron B. Strauss, 2010. "The Implications of High Court Docket Control for Resource Allocation and Legal Efficiency," Journal of Theoretical Politics, , vol. 22(2), pages 247-268, April.
    5. ten Eikelder, S.C.M. & van Amerongen, J.H.M., 2023. "Resource allocation problems with expensive function evaluations," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1170-1185.
    6. R. Pablo Arribillaga & G. Bergantiños, 2022. "Cooperative and axiomatic approaches to the knapsack allocation problem," Annals of Operations Research, Springer, vol. 318(2), pages 805-830, November.
    7. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.
    8. Vahideh Sadat Abedi, 2017. "Allocation of advertising budget between multiple channels to support sales in multiple markets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 134-146, February.
    9. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
    10. R Bai & E K Burke & G Kendall, 2008. "Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1387-1397, October.
    11. Hezhi Luo & Xiaodi Bai & Jiming Peng, 2019. "Enhancing Semidefinite Relaxation for Quadratically Constrained Quadratic Programming via Penalty Methods," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 964-992, March.
    12. Edwin Romeijn, H. & Zeynep Sargut, F., 2011. "The stochastic transportation problem with single sourcing," European Journal of Operational Research, Elsevier, vol. 214(2), pages 262-272, October.
    13. Kameshwaran, S. & Narahari, Y., 2009. "Nonconvex piecewise linear knapsack problems," European Journal of Operational Research, Elsevier, vol. 192(1), pages 56-68, January.
    14. SYAFITRI, Utami & SARTONO, Bagus & GOOS, Peter, 2015. "D- and I-optimal design of mixture experiments in the presence of ingredient availability constraints," Working Papers 2015003, University of Antwerp, Faculty of Business and Economics.
    15. Reniers, G.L.L. & Sörensen, K. & Khan, F. & Amyotte, P., 2014. "Resilience of chemical industrial areas through attenuation-based security," Reliability Engineering and System Safety, Elsevier, vol. 131(C), pages 94-101.
    16. Zhang, Bin & Hua, Zhongsheng, 2008. "A unified method for a class of convex separable nonlinear knapsack problems," European Journal of Operational Research, Elsevier, vol. 191(1), pages 1-6, November.
    17. Selçuk, B. & Özlük, Ö., 2013. "Optimal keyword bidding in search-based advertising with target exposure levels," European Journal of Operational Research, Elsevier, vol. 226(1), pages 163-172.
    18. Sathaye, Nakul & Madanat, Samer, 2011. "A bottom-up solution for the multi-facility optimal pavement resurfacing problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1004-1017, August.
    19. Khaled Elbassioni & Areg Karapetyan & Trung Thanh Nguyen, 2019. "Approximation schemes for r-weighted Minimization Knapsack problems," Annals of Operations Research, Springer, vol. 279(1), pages 367-386, August.
    20. Torrealba, E.M.R. & Silva, J.G. & Matioli, L.C. & Kolossoski, O. & Santos, P.S.M., 2022. "Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 46-59.

    More about this item

    Keywords

    Network security; Metaheuristics; Knapsack problem;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    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.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joeri Nys (email available below). General contact details of provider: https://edirc.repec.org/data/ftufsbe.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.