带软时间窗的开放式满载车辆路径问题研究

Research on open vehicle routing problem with full load and soft-time windows

为满足某些生产制造企业的满载运输需求,针对运输任务对车辆具有独占性的特点,分析得到总运输费用的大小取决于车辆的空车行驶费用,在此基础上,将带软时间窗的开放式满载车辆路径问题转化为带软时间窗的多车场开放式车辆路径问题,在非对称图上建立了相应的数学模型,并设计了近邻粒子群算法对模型进行求解。设计算例对算法进行了验证,实验结果表明:该算法可以快速求得软时间窗的开放式满载车辆路径问题的满意解。

The full load 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 transportation cost.Then the open vehicle routing problem with full load and soft-time windows is transferred to a multi-depot open vehicle routing problem with soft-time windows and a mixed-integer mathematical model is presented based on the transferred asymmetric graph.PSO algorithm with near neighbor interactions is given to solve the problem and is verified through an example.The experiment results prove the high efficiency of the algorithm to solve the open vehicle routing problem with full load and soft-time windows.