基于竞争环境的截流设施选址与车辆路径问题

Flow interception facility location and vehicle routing problem based on competitive conditions

研究竞争环境下截流设施选址与带时间窗的多中心车辆路径问题.首先,在考虑设施覆盖范围衰退的情况下,利用阶梯型效用函数和偏离距离描述消费者的选择行为,并确定截流设施的需求量;然后,采用基于聚集度的启发式算法对门店进行分类,借助双层规划法,建立门店选址与车辆路径安排的多目标整数规划模型;最后,采用改进的蚁群算法进行求解.通过分析对比实验结果,验证了模型的有效性和可行性.

The combined problem of flow interception facility location and multi-depot vehicle routing with time windows under competitive conditions is considered. Firstly, considering the decay cover of facilities and deviation distance from the given path, the spatial customer choice and the demands of flow interception facilities are described by using the step utility function. Then, after classifying facilities with the aggregation-based heuristic algorithm, the multi-objective integer programming model is established based on bi-level programming. Its upper planning targets at the maximum of market share, while the lower planning targets at the minimum cost of vehicle transportation. Finally, with the concept of greedy algorithm and Pareto optimization, objective values are obtained by means of the improved ant colony algorithm. Experiment results are analyzed and compared to verify the effectiveness and feasibility of the proposed method.