IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v58y2011i7p655-669.html
   My bibliography  Save this article

A branch and bound algorithm for sector allocation of a naval task group

Author

Listed:
  • Orhan Karasakal
  • Levent Kandiller
  • Nur Evin Özdemirel

Abstract

A naval task group (TG) is a collection of naval combatants and auxiliaries that are grouped together for the accomplishment of one or more missions. Ships forming a TG are located in predefined sectors. We define determination of ship sector locations to provide a robust air defense formation as the sector allocation problem (SAP). A robust formation is one that is very effective against a variety of attack scenarios but not necessarily the most effective against any scenario. We propose a 0‐1 integer linear programming formulation for SAP. The model takes the size and the direction of threat into account as well as the defensive weapons of the naval TG. We develop tight lower and upper bounds by incorporating some valid inequalities and use a branch and bound algorithm to exactly solve SAP. We report computational results that demonstrate the effectiveness of the proposed solution approach. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011

Suggested Citation

  • Orhan Karasakal & Levent Kandiller & Nur Evin Özdemirel, 2011. "A branch and bound algorithm for sector allocation of a naval task group," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 655-669, October.
    • Handle: RePEc:wly:navres:v:58:y:2011:i:7:p:655-669
    DOI: 10.1002/nav.20474
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20474
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20474?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Zvi Drezner, 1988. "Location strategies for satellites' orbits," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(5), pages 503-512, October.
    2. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    3. William J. Wolfe & Stephen E. Sorensen, 2000. "Three Scheduling Algorithms Applied to the Earth Observing Systems Domain," Management Science, INFORMS, vol. 46(1), pages 148-166, January.
    4. ReVelle, C.S. & Eiselt, H.A. & Daskin, M.S., 2008. "A bibliography for some fundamental problem categories in discrete location science," European Journal of Operational Research, Elsevier, vol. 184(3), pages 817-848, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ahmet Silav & Orhan Karasakal & Esra Karasakal, 2019. "Bi‐objective missile rescheduling for a naval task group with dynamic disruptions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 596-615, October.

    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. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    2. Derya Celik Turkoglu & Mujde Erol Genevois, 2020. "A comparative survey of service facility location problems," Annals of Operations Research, Springer, vol. 292(1), pages 399-468, September.
    3. Buchheim, Christoph & Crama, Yves & Rodríguez-Heck, Elisabeth, 2019. "Berge-acyclic multilinear 0–1 optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 102-107.
    4. Abareshi, Maryam & Zaferanieh, Mehdi, 2019. "A bi-level capacitated P-median facility location problem with the most likely allocation solution," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 1-20.
    5. M. Fattahi & M. Mahootchi & S. M. Moattar Husseini, 2016. "Integrated strategic and tactical supply chain planning with price-sensitive demands," Annals of Operations Research, Springer, vol. 242(2), pages 423-456, July.
    6. Fredriksson, Anders, 2017. "Location-allocation of public services – Citizen access, transparency and measurement. A method and evidence from Brazil and Sweden," Socio-Economic Planning Sciences, Elsevier, vol. 59(C), pages 1-12.
    7. Mahalec, Vladimir & Chen, Yingwu & Liu, Xiaolu & He, Renjie & Sun, Kai, 2015. "Reconfiguration of satellite orbit for cooperative observation using variable-size multi-objective differential evolutionAuthor-Name: Chen, Yingguo," European Journal of Operational Research, Elsevier, vol. 242(1), pages 10-20.
    8. Rodolfo Mendoza-Gómez & Roger Z. Ríos-Mercado & Karla B. Valenzuela-Ocaña, 2019. "An Efficient Decision-Making Approach for the Planning of Diagnostic Services in a Segmented Healthcare System," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(05), pages 1631-1665, September.
    9. Yunpeng Sun & Ruoya Jia & Asif Razzaq & Qun Bao, 2023. "RETRACTED ARTICLE: Drivers of China’s geographical renewable energy development: evidence from spatial association network structure approaches," Economic Change and Restructuring, Springer, vol. 56(6), pages 4115-4163, December.
    10. Rentizelas, Athanasios A. & Tatsiopoulos, Ilias P., 2010. "Locating a bioenergy facility using a hybrid optimization method," International Journal of Production Economics, Elsevier, vol. 123(1), pages 196-209, January.
    11. Herrán, Alberto & Manuel Colmenar, J. & Duarte, Abraham, 2021. "An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 893-907.
    12. Shai Krigman & Tal Grinshpoun & Lihi Dery, 2024. "Scheduling of Earth observing satellites using distributed constraint optimization," Journal of Scheduling, Springer, vol. 27(5), pages 507-524, October.
    13. Tomaz Dentinho & Vasco Silva, 2012. "Optimization of Location Services in the city of Huambo. Confirmation of the Theory of Central Places," ERSA conference papers ersa12p254, European Regional Science Association.
    14. Spencer Leitch & Zhiyuan Wei, 2024. "Improving spatial access to healthcare facilities: an integrated approach with spatial analysis and optimization modeling," Annals of Operations Research, Springer, vol. 341(2), pages 1057-1074, October.
    15. Jabbarzadeh, Armin & Fahimnia, Behnam & Sheu, Jiuh-Biing & Moghadam, Hani Shahmoradi, 2016. "Designing a supply chain resilient to major disruptions and supply/demand interruptions," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 121-149.
    16. Ricardo M. Lima & Ignacio E. Grossmann, 2017. "On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study," Computational Optimization and Applications, Springer, vol. 66(1), pages 1-37, January.
    17. Abdolsalam Ghaderi, 2015. "Heuristic Algorithms for Solving an Integrated Dynamic Center Facility Location - Network Design Model," Networks and Spatial Economics, Springer, vol. 15(1), pages 43-69, March.
    18. Shulin Wang & Shanhua Wu, 2023. "Optimizing the Location of Virtual-Shopping-Experience Stores Based on the Minimum Impact on Urban Traffic," Sustainability, MDPI, vol. 15(13), pages 1-25, June.
    19. Varsei, Mohsen & Polyakovskiy, Sergey, 2017. "Sustainable supply chain network design: A case of the wine industry in Australia," Omega, Elsevier, vol. 66(PB), pages 236-247.
    20. Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013. "Stability and fairness in models with a multiple membership," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.

    More about this item

    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:wly:navres:v:58:y:2011:i:7:p:655-669. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.