带时间窗的开放式满载车辆路径问题建模及其求解算法

为满足某些企业的满载运输需求, 针对运输任务对车辆具有独占性的特点, 分析得到总运输费用的大小取决于车辆的空车运行费用, 在此基础上, 将带时间窗的开放式满载车辆路径问题转化为带时间窗的多车场开放式车辆路径问题, 建立了相应的数学模型, 并设计了改进的自适应遗传算法进行开环路径求解, 并把算法应用于某木材厂的周运输计划的制定, 算法在很短时间内求得了运输方案, 比木材厂原运输方案减少了车辆数, 并节省了运输费用. 实验证明, 算法是可行和有效的.

Modeling and algorithm for open vehicle routing problem with full-truckloads and time windows

The full-truckloads transportation problem is researched to satisfy the demand of production enterprises.Based on the exclusive characteristic of this problem,it’s concluded that the total transportation cost is determined by the empty-load transpotation cost.Then the open vehicle routing problem with full-truckloads and time windows is transferred to a multi-depot open vehicle routing problem with time windows and a mixed-integer mathematical model is presented.An adaptive genetic algorithm is given to solve the problem.The method is used to make the week transportation plan of the wood processing factory.The plan maken by the method uses less vehicles and induces the transportation cost compared to the former transportation scheme.The simulative computational results demonstrate that the proposed algorithm is feasible and effective.