大规模作战物流配送VRP模型及求解  

Logistics Distribution VRP Model and Its Solution in Large-scale Combat

作　　者：张锦[1] 聂伟[1] 沈军[1] 谢小平[1] 

机构地区：[1]镇江船艇学院动力指挥系,江苏镇江212003

出　　处：《军事交通学院学报》2015年第11期59-63,共5页Journal of Military Transportation University

基　　金：总后军事交通运输科研项目(BJJ14C006)

摘　　要：针对大规模作战物流配送问题中的车辆路径问题(vehicle routing problem,VRP),通过虚设配送中心,将车辆路径问题转化为约束性推销员回路问题(traveling salesman problem,TSP),以大幅减少优化模型决策变量和约束条件数量,提高求解效率。通过典型案例开展仿真分析,验证了该模型的正确性和求解实现的可行性及高效性。According to vehicle routing problem （VRP） in large-scale combat logistics distribution, the paper transforms the vehicle routing problem into restricting traveling salesman problem （TSP） by conceptual virtual distribution center, which can largely decrease decision variable of optimization model and number of constrains and improve solving efficiency. The accuracy of the model and the feasibility and high effectiveness of its solving are verified through typical case simula- tion.

关 键 词：车辆路径问题 物流配送 军交运输 0-1规划 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]