软时间窗车辆路径问题(VRPSTW)是VRP的一种重要扩展类型,定义了其惩罚函数并建立数学模型。设计用于求解该问题的混合改进型蚁群算法并求解标准数据库中的紧时间窗实例。经过大量数据测试,获得了较好的效果,并验证了蚁群算法用于求解软时间窗车辆路径问题的成功实现。
Vehicle routing problem with soft time windows is a very important extended type of vehicle routing problem. This paper defined penalty function and established mathematical model of VRPSTW. Designed a hybrid improved ant algorithm for solving this problem and solved some Solomon instances with hard time windows. Computational experiments show that this approach is promising in good performances and verify the success of applying ant algorithm in solving vehicle routing problem with soft time windows.