基于顾客点协作的车辆路径问题的两阶段算法

发布时间：2018-01-11 16:31

本文关键词：基于顾客点协作的车辆路径问题的两阶段算法　出处：《工业工程与管理》2014年03期 　论文类型：期刊论文

【摘要】：研究城市中面向顾客车辆接送服务的车辆路径问题。通过介绍车辆协作的相关概念,提出了孤立顾客点的定义,讨论了车辆协作的分类。以顾客满意度和绕行限制为约束条件,考虑顾客点作为车辆协作点,提出了顾客换乘的车辆协作规则,并通过最优化理论,提出了一种基于顾客点协作的两阶段算法。该算法通过车辆协作规则,利用协作车辆将孤立顾客点的顾客通过协作方式在顾客点进行换乘后,与非孤立点顾客一起由基本车辆接送到指定目的地。最后,以航空票务公司机场接送服务为应用案例进行仿真分析,仿真结果表明提出的算法是可行和有效的。
[Abstract]:This paper studies the problem of vehicle routing for customer oriented vehicle transport service in city. By introducing the concept of vehicle cooperation, the definition of isolated customer point is proposed. In this paper, the classification of vehicle cooperation is discussed. Taking customer satisfaction and circumvention constraints as constraints and considering customer points as vehicle cooperation points, the vehicle cooperation rules for customer transfer are proposed, and the optimization theory is adopted. In this paper, a two-stage algorithm based on customer point cooperation is proposed, which uses vehicle cooperation rules to transfer customers with isolated customer points through cooperation. At last, the application case of airline ticketing company airport shuttle service is analyzed. The simulation results show that the proposed algorithm is feasible and effective.
【作者单位】：东北大学工商管理学院;东北大学系统工程研究所;
【基金】：国家自然科学基金资助项目(71021061,61273204) 中央直属高校基本科研业务费资助项目(N090204001)
【分类号】：U492.22;TP301.6
【正文快照】： 1引言由Dantzig和Ramser于1959年提出的车辆路径问题(Vehicle Routing Problem,VRP),一直受到人们的广泛关注。它是指对一系列发货(或收货)点,组成适当的行车路径,使车辆有序地通过它们,在满足一定约束条件(如货物需求量、发送量、交发货时间、车辆容量限制等)的情况下,达到一

【相似文献】