Article ID: | iaor201525604 |
Volume: | 13 |
Issue: | 4 |
Start Page Number: | 422 |
End Page Number: | 450 |
Publication Date: | Oct 2014 |
Journal: | International Journal of Management and Decision Making |
Authors: | KhaliliDamghani Kaveh, Naderi Hossein |
Keywords: | location, combinatorial optimization, military & defence, vehicle routing & scheduling, programming: linear, programming: integer, programming: branch and bound |
One of the most crucial factors in civil wars is to properly support fighting soldiers. Since the opposition forces are usually faced with many difficulties to provide themselves with ammunition, they should use their ammunitions and equipment with extreme care. This makes them establish centres for repairing defective military equipment. This article intends to present a mathematical integer linear programming (ILP) model in order to minimise the expenses related to locations, routing, and reverse logistics of fighting forces. The presented model has been solved by numerical examples of different sizes using Branch and Bound method and its applicability has been shown in the real world problems.