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

Efficient strategies for transporting mobile forces

Author

Listed:
  • M Kress

    (Center for Military Analyses
    Naval Postgraduate School)

Abstract

During a military operation, it may be necessary to move military units quickly and efficiently from one zone at the theatre of operations to another one. This need is prevalent in particular at the earlier stages of an operation when combat units are accumulating at the theatre of operations. Such mobility missions are carried out by specially designed semi-trailers, called transporters, that carry the armoured fighting vehicles (AFVs) of the military unit. In many cases the number of available transporters is smaller than the number of AFVs that are to be carried, thus several tours of the transporters may be needed to transport the entire unit to its destination. In this paper we examine three generic transportation strategies that may apply to such mobility missions: fixed unloading point, variable unloading point and a flexible strategy in which both loading and unloading points may vary from one tour to another. The efficiency of each specific transportation plan, within a given generic strategy, is evaluated with respect to the criterion of minimum accumulation time.

Suggested Citation

  • M Kress, 2001. "Efficient strategies for transporting mobile forces," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(3), pages 310-317, March.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:3:d:10.1057_palgrave.jors.2601088
    DOI: 10.1057/palgrave.jors.2601088
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601088
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601088?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.

    Citations

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


    Cited by:

    1. R Gopalan & N S Narayanaswamy, 2009. "Analysis of algorithms for an online version of the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1230-1236, September.
    2. Ram Gopalan, 2015. "Computational complexity of convoy movement planning problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 31-60, August.

    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:52:y:2001:i:3:d:10.1057_palgrave.jors.2601088. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.