IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i12d10.1057_palgrave.jors.2602526.html
   My bibliography  Save this article

Modelling and analysis of Canadian Forces strategic lift and pre-positioning options

Author

Listed:
  • A Ghanmi

    (Defence Research and Development Canada—Centre for Operational Research and Analysis, National Defence Headquarters)

  • R H A D Shaw

    (Defence Research and Development Canada—Centre for Operational Research and Analysis, National Defence Headquarters)

Abstract

This paper presents analysis of some of the strategic lift and pre-positioning issues within the context of rapid deployability to failed and failing states conducted for the Canadian Forces (CF). A simulation framework was developed to study the effectiveness of a variety of pre-positioning options. An aircraft loading optimization model based on a genetic annealing algorithm with a novel convex hull-based measure of effectiveness was also developed to analyse different strategic lift options. The model was used both to provide insights into the optimal mix of airlift capabilities and to conduct sensitivity analysis. Historical CF deployments provided a baseline performance measure against which several movement solutions were compared and contrasted. Analysis indicates that pre-positioning of equipment and supplies at various strategic locations and use of efficient mix of transport aircraft could be potential strategies for improvement of the CF's strategic lift capability.

Suggested Citation

  • A Ghanmi & R H A D Shaw, 2008. "Modelling and analysis of Canadian Forces strategic lift and pre-positioning options," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1591-1602, December.
  • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:12:d:10.1057_palgrave.jors.2602526
    DOI: 10.1057/palgrave.jors.2602526
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602526
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2602526?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. Dowsland, Kathryn A., 1993. "Some experiments with simulated annealing techniques for packing problems," European Journal of Operational Research, Elsevier, vol. 68(3), pages 389-399, August.
    2. Andrea Lodi & Silvano Martello & Daniele Vigo, 1999. "Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 345-357, November.
    3. Harold K. Rappoport & Laurence S. Levy & Bruce L. Golden & Katherine J. Toussaint, 1992. "A Planning Heuristic for Military Airlift," Interfaces, INFORMS, vol. 22(3), pages 73-87, June.
    4. Jakobs, Stefan, 1996. "On genetic algorithms for the packing of polygons," European Journal of Operational Research, Elsevier, vol. 88(1), pages 165-181, January.
    5. Andrea Lodi & Silvano Martello & Daniele Vigo, 2004. "TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems," Annals of Operations Research, Springer, vol. 131(1), pages 203-213, October.
    6. Steven F. Baker & David P. Morton & Richard E. Rosenthal & Laura Melody Williams, 2002. "Optimizing Military Airlift," Operations Research, INFORMS, vol. 50(4), pages 582-602, August.
    7. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    8. C Guéret & N Jussien & O Lhomme & C Pavageau & C Prins, 2003. "Loading aircraft for military operations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 458-465, May.
    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. Mark Horner & Michael Widener, 2011. "The effects of transportation network failure on people’s accessibility to hurricane disaster relief goods: a modeling approach and application to a Florida case study," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 59(3), pages 1619-1634, December.
    2. A Ghanmi, 2011. "Canadian forces global reach support hubs: facility location and aircraft routing models," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 638-650, April.

    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. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    2. Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
    3. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    4. Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2020. "Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-22, April.
    5. Polyakovsky, Sergey & M'Hallah, Rym, 2009. "An agent-based approach to the two-dimensional guillotine bin packing problem," European Journal of Operational Research, Elsevier, vol. 192(3), pages 767-781, February.
    6. Kaizhi Chen & Jiahao Zhuang & Shangping Zhong & Song Zheng, 2020. "Optimization Method for Guillotine Packing of Rectangular Items within an Irregular and Defective Slate," Mathematics, MDPI, vol. 8(11), pages 1-16, November.
    7. Bennell, Julia A. & Soon Lee, Lai & Potts, Chris N., 2013. "A genetic algorithm for two-dimensional bin packing with due dates," International Journal of Production Economics, Elsevier, vol. 145(2), pages 547-560.
    8. Ortmann, Frank G. & Ntene, Nthabiseng & van Vuuren, Jan H., 2010. "New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 306-315, June.
    9. Leung, Stephen C.H. & Zhang, Defu & Sim, Kwang Mong, 2011. "A two-stage intelligent search algorithm for the two-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 57-69, November.
    10. Önder Aşık & Ender Özcan, 2009. "Bidirectional best-fit heuristic for orthogonal rectangular strip packing," Annals of Operations Research, Springer, vol. 172(1), pages 405-427, November.
    11. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    12. Crainic, Teodor Gabriel & Perboli, Guido & Tadei, Roberto, 2009. "TS2PACK: A two-level tabu search for the three-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 744-760, June.
    13. Defu Zhang & Lijun Wei & Stephen C. H. Leung & Qingshan Chen, 2013. "A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 332-345, May.
    14. Goncalves, Jose Fernando, 2007. "A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1212-1229, December.
    15. Kenmochi, Mitsutoshi & Imamichi, Takashi & Nonobe, Koji & Yagiura, Mutsunori & Nagamochi, Hiroshi, 2009. "Exact algorithms for the two-dimensional strip packing problem with and without rotations," European Journal of Operational Research, Elsevier, vol. 198(1), pages 73-83, October.
    16. Francisco Trespalacios & Ignacio E. Grossmann, 2017. "Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem," Annals of Operations Research, Springer, vol. 258(2), pages 747-759, November.
    17. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    18. Teodor Gabriel Crainic & Guido Perboli & Roberto Tadei, 2008. "Extreme Point-Based Heuristics for Three-Dimensional Bin Packing," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 368-384, August.
    19. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    20. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.

    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:pal:jorsoc:v:59:y:2008:i:12:d:10.1057_palgrave.jors.2602526. 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.palgrave-journals.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.