IDEAS home Printed from https://ideas.repec.org/a/spr/jtrsec/v9y2016i1d10.1007_s12198-016-0168-z.html
   My bibliography  Save this article

Optimal routing of infiltration operations

Author

Listed:
  • Mingyu Kim

    (Republic of Korea Army
    University at Buffalo (SUNY))

  • Rajan Batta

    (University at Buffalo (SUNY))

  • Qing He

    (University at Buffalo (SUNY)
    University at Buffalo (SUNY))

Abstract

This paper suggests a method for routing military ground operations, focused on conducting infiltration based on the shortest-path method. We model the problem in four parts. First, we estimate enemy locations by using public facility location model and military data, and use these to define possible enemy scenarios. Second, for each scenario, a shortest-path problem is solved, where each link’s cost is given by both “Speed” (Travel time) and “Surprise” (Detection probability). And the detection probability is jointly determined by the distance from the enemy’s closest location, detection device’s location and concealment probability from vegetation information. Third, the preferred solution is selected by a robust optimization process. The fourth step involves the use of dissimilar paths to incorporate the impact of a deception operation. The methodology is demonstrated by a case study that uses realistic data from South Korea.

Suggested Citation

  • Mingyu Kim & Rajan Batta & Qing He, 2016. "Optimal routing of infiltration operations," Journal of Transportation Security, Springer, vol. 9(1), pages 87-104, June.
    • Handle: RePEc:spr:jtrsec:v:9:y:2016:i:1:d:10.1007_s12198-016-0168-z
    DOI: 10.1007/s12198-016-0168-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12198-016-0168-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12198-016-0168-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Batta, Rajan & Lejeune, Miguel & Prasad, Srinivas, 2014. "Public facility location using dispersion, population, and equity criteria," European Journal of Operational Research, Elsevier, vol. 234(3), pages 819-829.
    2. Akgun, Vedat & Erkut, Erhan & Batta, Rajan, 2000. "On finding dissimilar paths," European Journal of Operational Research, Elsevier, vol. 121(2), pages 232-246, March.
    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. Carlos Cotta & José E. Gallardo, 2018. "Metaheuristic approaches to the placement of suicide bomber detectors," Journal of Heuristics, Springer, vol. 24(3), pages 483-513, June.

    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. Dell'Olmo, Paolo & Gentili, Monica & Scozzari, Andrea, 2005. "On finding dissimilar Pareto-optimal paths," European Journal of Operational Research, Elsevier, vol. 162(1), pages 70-82, April.
    2. Lucio Bianco & Massimiliano Caramia & Stefano Giordani & Veronica Piccialli, 2016. "A Game-Theoretic Approach for Regulating Hazmat Transportation," Transportation Science, INFORMS, vol. 50(2), pages 424-438, May.
    3. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    4. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    5. Argyris, Nikolaos & Karsu, Özlem & Yavuz, Mirel, 2022. "Fair resource allocation: Using welfare-based dominance constraints," European Journal of Operational Research, Elsevier, vol. 297(2), pages 560-578.
    6. Hoogeboom, Maaike & Dullaert, Wout, 2019. "Vehicle routing with arrival time diversification," European Journal of Operational Research, Elsevier, vol. 275(1), pages 93-107.
    7. Meltem Peker & Bahar Y. Kara & James F. Campbell & Sibel A. Alumur, 2016. "Spatial Analysis of Single Allocation Hub Location Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1075-1101, December.
    8. Yücel, E. & Salman, F.S. & Arsik, I., 2018. "Improving post-disaster road network accessibility by strengthening links against failures," European Journal of Operational Research, Elsevier, vol. 269(2), pages 406-422.
    9. Soheil Davari & Kemal Kilic & Gurdal Ertek, 2015. "Fuzzy bi-objective preventive health care network design," Health Care Management Science, Springer, vol. 18(3), pages 303-317, September.
    10. Changxi Ma & Wei Hao & Fuquan Pan & Wang Xiang, 2018. "Road screening and distribution route multi-objective robust optimization for hazardous materials based on neural network and genetic algorithm," PLOS ONE, Public Library of Science, vol. 13(6), pages 1-22, June.
    11. Liying Yan & Manel Grifoll & Hongxiang Feng & Pengjun Zheng & Chunliang Zhou, 2022. "Optimization of Urban Distribution Centres: A Multi-Stage Dynamic Location Approach," Sustainability, MDPI, vol. 14(7), pages 1-16, March.
    12. Preethi Issac & Ann Melissa Campbell, 2017. "Shortest path problem with arc failure scenarios," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 139-163, June.
    13. Mavrommatis, G. & Panayiotopoulos, J. -C., 2004. "Risk transportation via a clique number problem formulation," European Journal of Operational Research, Elsevier, vol. 152(2), pages 500-506, January.
    14. Sandra Zajac, 2018. "On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem," Journal of Heuristics, Springer, vol. 24(3), pages 515-550, June.
    15. Pushak, Yasha & Hare, Warren & Lucet, Yves, 2016. "Multiple-path selection for new highway alignments using discrete algorithms," European Journal of Operational Research, Elsevier, vol. 248(2), pages 415-427.
    16. TALARICO, Luca & SÖRENSEN, Kenneth & SPRINGAEL, Johan, 2013. "The k-dissimilar vehicle routing problem," Working Papers 2013029, University of Antwerp, Faculty of Business and Economics.
    17. Hammad, Ahmed W A & Akbarnezhad, Ali & Rey, David, 2017. "Sustainable urban facility location: Minimising noise pollution and network congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 38-59.
    18. Wu, Shanhua & Yang, Zhongzhen, 2018. "Locating manufacturing industries by flow-capturing location model – Case of Chinese steel industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 112(C), pages 1-11.
    19. Yoon Ha Lee & Ji Soo Lee & Seung Chan Baek & Won Hwa Hong, 2020. "Spatial Equity with Census Population Data vs. Floating Population Data: The Distribution of Earthquake Evacuation Shelters in Daegu, South Korea," Sustainability, MDPI, vol. 12(19), pages 1-17, September.
    20. Rasmussen, Thomas Kjær & Watling, David Paul & Prato, Carlo Giacomo & Nielsen, Otto Anker, 2015. "Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 146-165.

    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:spr:jtrsec:v:9:y:2016:i:1:d:10.1007_s12198-016-0168-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.