J. KIMS Technol Search

CLOSE


J. KIMS Technol > Volume 14(3); 2011 > Article
Journal of the Korea Institute of Military Science and Technology 2011;14(3):458-466.
DOI: https://doi.org/10.9766/KIMST.2011.14.3.458   
The Multiple Traveling Purchaser Problem for Minimizing the Maximal Acquisition Completion Time in Wartime
Myung-Jin Choi, Woo-Bum Moon, Jin-Ho Choi
Air Force Logistics Command
전시 최장 획득완료시간 최소화를 위한 복수 순회구매자 문제
최명진, 문우범, 최진호
공군 군수사령부
Abstract
In war time, minimizing the logistics response time for supporting military operations is strongly needed. In this paper, i propose the mathematical formulation for minimizing the maximal acquisition completion time in wartime or during a state of emergency. The main structure of this formulation is based on the traveling purchaser problem (TPP), which is a generalized form of the well-known traveling salesman problem (TSP). In the case of the general TPP, an objective function is to minimize the sum of the traveling cost and the purchase cost. However, in this study, the objective function is to minimize the traveling cost only. That's why it's more important to minimize the traveling cost (time or distance) than the purchase cost in wartime or in a state of emergency. I generate a specific instance and find out the optimal solution of this instance by using ILOG OPL STUDIO (CPLEX version 11.1).
Key Words: Military Logistics, Traveling Purchase Problem, Supply Chain Management


ABOUT
ARTICLE CATEGORY

Browse all articles >

BROWSE ARTICLES
FOR CONTRIBUTORS
Editorial Office
160 Bugyuseong-daero 488beon-gil, Yuseong-gu, Daejeon 34060, Korea
Tel: +82-42-823-4603    Fax: +82-42-823-4605    E-mail: kimst@kimst.or.kr                

Copyright © 2024 by The Korea Institute of Military Science and Technology.

Developed in M2PI

Close layer
prev next