LOWER AND UPPER BOUNDS FOR MILITARY DEPLOYMENT PLANNING CONSIDERING COMBAT
DOI:
https://doi.org/10.23055/ijietap.2014.21.6.1321Keywords:
military deployment planning problem, multicommodity, multimodal transportation, fractional programming, heuristicsAbstract
In the military deployment planning problem (DPP), troops and cargoes are transported from source nodes to destination nodes by using multimodal transportation assets, while considering various constraints, such as the supply availability, demand satisfaction constraints, and availability of required transportation assets. The enemies may exist at several locations to block the transportation of troops and cargoes to the destinations. In order to arrive at the destinations, the troops need to have combats with the enemies, which cause loss of troops. Thus, to satisfy the demands, additional troops may be necessary to be transported. Various transportation modes are used and leads to the introduction of subnodes and subarcs in the graphical representation. A mixed integer programming (MIP) formulation is proposed, which is classified as a fractional programming. A solution method which calculates the lower and upper bounds is developed. Then, the gap between the lower and upper bounds is calculated. The computational results are provided and analyzedPublished
How to Cite
Issue
Section
License
The Author(s) must formally transfer each article's copyright before publication in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING. Such transfer enables the Journal to defend itself against plagiarism and other forms of copyright infringement. Your cooperation is appreciated.
You agree that the copyright of your article to be published in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE is hereby transferred, throughout the World and for the full term and all extensions and renewals thereof, to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE.
The Author(s) reserve(s): (a) the trademark rights and patent rights, if any, and (b) the right to use all or part of the information contained in this article in future, non-commercial works of the Author's own, or, if the article is a "work-for-hire" and made within the scope of the Author's employment, the employer may use all or part of the information contained in this article for intra-company use, provided the usual acknowledgments are given regarding copyright notice and reference to the original publication.
The Author(s) warrant(s) that the article is Author's original work and has not been published before. If excerpts from copyrighted works are included, the Author will obtain written permission from the copyright owners and credit the article's sources.
The author also warrants that the article contains no libelous or unlawful statements and does not infringe on the rights of others. If the article was prepared jointly with other Author(s), the Author agrees to inform the co-Author(s) of the terms of the copyright transfer and to sign on their behalf; or in the case of a "work-for-hire," the employer or an authorized representative of the employer.
The journal does not provide the author copy of the final paper when it is published. The author(s) can make(s) a subscription to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE if they want to get the final paper that has already been published.
The journal is registered with the Library of Congress (ISSN # 1943-670X). All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the journal.
The author reserves patent and trademark rights and the right to use all or part of the information contained in the article in future non-commercial works.
