带双时间窗约束的粮食专用车调度优化

Scheduling optimization of special vehicles for grain with double time window constraint

针对港口企业经营的粮食专用车调度问题,在传统的车辆调度问题上新增双时间窗约束,以粮食专用车周转率最大和港口企业经营粮食专用车的收入最大为目标建立双目标规划模型,并用算例验证模型和算法的有效性。结论如下:在运量与运距相矛盾的情况下,优先选择距离近、运量小的客户进行服务。此研究能够为粮食专用车调度决策提供参考。

Aiming at the scheduling problem of special vehicles for grain operated by port enterprises,the double time window constraint is added to the traditional vehicle scheduling problem,and the two-objective programming model is established with the objectives of the maximum turnover rate of special vehicles for grain and the maximum income brought by port enterprises to operate special vehicles for grain.The validity of the model and the algorithm is verified by examples.The conclusion is as follows:in the case of contradiction between transportation volume and transportation distance,customers with close distance and small transportation volume are preferred to serve.This research can provide reference for the scheduling decision of special vehicles for grain.