摘要
考虑不同容量和运输成本的多车型车辆,建立容量限制和软时间约束,并以最小化车辆在路段上的运输量和该路段的长度乘积为目标的数学模型,给出求解该问题的禁忌搜索算法。在算法中考虑使用车辆最少的插入算法生成初始解。最后,通过仿真算例,检验模型和算法的有效性。
The vehicle routing problem with soft time windows is studied in this paper.The various kinds of vehicles associated with different capacities are considered.The model subject to capacity and soft time windows constraints is formulated.The objective function is to minimize the product of the travel cost,distance and vehicle load,which use the variables,travel cost （the cost per ton per kilometer）,travel distance and the load of vehicle to represent the actually cost of vehicle traveling.An algorithm based on Tabu Search technique is designed to solve the developed model.Initial solution is generated by the improved insertion heuristics.Finally,the developed model and algorithm were successfully tested with the help of a numerical example.
出处
《交通科技与经济》
2010年第6期44-46,共3页
Technology & Economy in Areas of Communications
关键词
车辆路径问题
软时间窗
禁忌搜索
算法
vehicle routing problem
soft time windows
Tabu Search
procedures
