首页> 外文期刊>Journal of the Korea Institute of Military Science and Technology >The Multiple Traveling Purchaser Problem for Minimizing Logistics Response Time in Wartime
【24h】

The Multiple Traveling Purchaser Problem for Minimizing Logistics Response Time in Wartime

机译:The Multiple Traveling Purchaser Problem for Minimizing Logistics Response Time in Wartime

获取原文
获取原文并翻译 | 示例
           

摘要

It's strongly needed to minimize the logistics response time for supporting military operations in wartime. In this paper, we suggest the ILP formulation for minimizing logistics response time in wartime. 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 general TPP, objective function is to minimize the sum of traveling cost and purchase cost. But, in this study, objective function is to minimize traveling cost only. That's why it's more important to minimize traveling cost(time or distance) than purchase cost in wartime. We find out optimal solution of this problem by using ILOG OPL STUDIO(CPLEX v.11.1) and do the sensitive analysis about computing time according to number of operated vehicles.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号