Optimization of transportation requirements in the deployment of military units


Creative Commons License

Akgun I. , Tansel B. C.

COMPUTERS & OPERATIONS RESEARCH, cilt.34, ss.1158-1176, 2007 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 34 Konu: 4
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1016/j.cor.2005.06.016
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Sayfa Sayısı: ss.1158-1176

Özet

We study the deployment planning problem (DPP) that may roughly be defined as the problem of the planning of the physical movement of military units, stationed at geographically dispersed locations, from their home bases to their designated destinations while obeying constraints on scheduling and routing issues as well as on the availability and use of various types of transportation assets that operate on a multimodal transportation network. The DPP is a large-scale real-world problem for which analytical models do not exist. We propose a model for solving the problem and develop a solution methodology which involves an effective use of relaxation and restriction that significantly speeds up a CPLEX-based branch-and-bound. The solution times for intermediate-sized problems are around 1 h at maximum, whereas it takes about a week in the Turkish Armed Forces to produce a suboptimal feasible solution based on trial-and-error methods. The proposed model can be used to evaluate and assess investment decisions in transportation infrastructure and transportation assets as well as to plan and execute cost-effective deployment operations at different levels of planning. (c) 2005 Elsevier Ltd. All rights reserved.