考虑众包情形下的动态异质订单配送优化问题

    Optimization of Dynamic Heterogeneous Order Delivery in Crowdsourcing Scenarios

    • 摘要: 根据顾客是否购买准时送达服务,或是否愿意支付额外费用让订单提前送达,将即时配送的订单分为不同的类型。除初始时刻的订单需求外,配送过程中还会出现新的订单需求。综合考虑订单的时间窗、车辆的容量限制、众包车辆服务范围等约束,以车辆配送成本与顾客点处的时间成本之和最小为目标建立数学模型;并设计一种基于滚动时域的改进混合禁忌搜索算法进行求解,在该算法中设置禁忌步长的动态调整机制以及解的多样化策略。参数分析表明,为了有效降低成本,运输企业不宜将更新时间间隔设置过长,应优先配送第2类及第3类异质订单,尽量扩大众包车辆的服务范围并充分利用该范围内的众包车辆。多个不同规模的算例测试表明,基于滚动时域的改进混合禁忌搜索算法能有效求解各规模算例。

       

      Abstract: According to whether customers purchase on-time delivery services or are willing to pay additional fees for early delivery, on-demand delivery orders are classified into different types. In addition to the initial order requirements, new orders may arise during the delivery process. A mathematical model is established with the objective of minimizing the sum of vehicle delivery costs and customer time costs, considering constraints such as delivery time windows, vehicle capacity, and the service range of crowdsourced vehicles. An improved hybrid tabu search algorithm based on rolling time horizons is designed to solve the problem, which incorporates a dynamic adjustment mechanism for the tabu step size and a diversification strategy for solutions. Parameter analysis shows that, in order to effectively reduce costs, transportation companies should avoid setting long update intervals. Instead, they should prioritize the delivery of heterogeneous orders of the second and third categories, and expand the service range of crowdsourced vehicles while fully utilizing the vehicles within this range. Multiple case studies of different scales demonstrate that the improved hybrid tabu search algorithm based on rolling time horizons can effectively solve cases of various scales.

       

    /

    返回文章
    返回