基于两次禁忌搜索的军事物资装运方案研究

针对当前军事物资装载与运输问题,映射建立数学模型,运用两次禁忌搜索算法自动输出较优的可行运输方案.第一次禁忌搜索用于确定较优的初始解,针对初始解,运用第二次禁忌搜索,保证在一定时间限制条件下,对运输问题进行优化求解.计算结果表明,该模型通过两次禁忌搜索算法可以得出在满足时间限制条件下的成本较小的装运方案,使用该模型可以有效提高载具的利用率,避免运力的浪费.

Study on loading and transportation scheme of military materials based on twice tabu search algorithm

Aiming at the question of loading and transportation of military materials,mathematical model is built,the good feasible solution of transport problems are gotten automatically based on twice tabu search algorithm.Through the first using of tabu search algorithm,a good initial solution is gotten,then with the guarantee of a certain time constraints,the optimal solution of transport problems is given through the second tabu search algorithm.Example calculations show that the model is drawn through the twice tabu search algorithm under time constraints to meet the less cost of the shipping program,using the model can effectively improve the utilization of vehicles,and avoid the waste of transportation capacity.