考虑到普通带时间窗约束的车辆路径问题(vehicle routing problem with time windows,VRPTW)模型不能真正反映顾客对时间的偏好,故在车辆路径优化模型的基础上,结合顾客时间满意度函数,同时放松需求点经过即被服务的约束限制,允许多次...考虑到普通带时间窗约束的车辆路径问题(vehicle routing problem with time windows,VRPTW)模型不能真正反映顾客对时间的偏好,故在车辆路径优化模型的基础上,结合顾客时间满意度函数,同时放松需求点经过即被服务的约束限制,允许多次经过同一需求点的情况发生,而需求点只能被同一辆车服务一次,建立了基于顾客时间满意度的车辆配送(vehicle routing problem with satisfaction,VRPWS)模型,并利用模拟退火算法编程求解.为验证VRPWS模型的有效性进行了数值实验.实验结果表明:与传统的带软时间窗约束的车辆路径优化(vehicle routing problems with soft time window,VRPSTW)模型和VRPTW相比,VRPWS模型配送效益提升了170.0%和3.2%.分析结果表明该工作在一定程度上有助于物流企业在配送过程中提高顾客满意度和降低运输成本.展开更多
In this article, we consider the multiclass network equilibrium problems. A so called strongly valid toll can support any multiclass user equilibrium flow pattern as a system minimum when the system objective function...In this article, we consider the multiclass network equilibrium problems. A so called strongly valid toll can support any multiclass user equilibrium flow pattern as a system minimum when the system objective function is measured by total emission. Using Hoffman lemma and exact penalization method, we provide the existence of strongly valid tolls for multiclass network equilibrium problems.展开更多
文摘考虑到普通带时间窗约束的车辆路径问题(vehicle routing problem with time windows,VRPTW)模型不能真正反映顾客对时间的偏好,故在车辆路径优化模型的基础上,结合顾客时间满意度函数,同时放松需求点经过即被服务的约束限制,允许多次经过同一需求点的情况发生,而需求点只能被同一辆车服务一次,建立了基于顾客时间满意度的车辆配送(vehicle routing problem with satisfaction,VRPWS)模型,并利用模拟退火算法编程求解.为验证VRPWS模型的有效性进行了数值实验.实验结果表明:与传统的带软时间窗约束的车辆路径优化(vehicle routing problems with soft time window,VRPSTW)模型和VRPTW相比,VRPWS模型配送效益提升了170.0%和3.2%.分析结果表明该工作在一定程度上有助于物流企业在配送过程中提高顾客满意度和降低运输成本.
基金supported by the National Natural Science Foundation of China NSFC:71071035
文摘In this article, we consider the multiclass network equilibrium problems. A so called strongly valid toll can support any multiclass user equilibrium flow pattern as a system minimum when the system objective function is measured by total emission. Using Hoffman lemma and exact penalization method, we provide the existence of strongly valid tolls for multiclass network equilibrium problems.