带时间窗的中转联盟运输调度问题的混合算法研究  

Research of Hybrid Algorithm on Allied Vehicle Routing Problem with Transfer Stations and Time Windows

作　　者：陈金[1] 蔡延光[1] 

机构地区：[1]广东工业大学自动化学院,广东广州510006

出　　处：《工业控制计算机》2010年第1期70-72,共3页Industrial Control Computer

基　　金：广东省自然科学基金团队项目(8351009001000002);国家自然科学基金项目(60374062);广东省科技计划项目(2007B010200070)

摘　　要：介绍中转联盟运输调度问题的优越性和重要研究意义,建立了带中转点的优化运输调度问题的数学模型,并构造了求解该模型的优化算法,算法针对城市货物运输的特点,首先结合sweep算法和saving算法确定需求点与中转点之间的分派,随后采用改进的蚁群算法对每个中转点的运输路线进行优化。实例计算表明,提出的模型和算法能够有效的求解中转联盟运输调度问题。The advantages and research significance of the vehicle routing problem with transfer stations and time windows is analyzed,an optimized mathematical model to solve the problem is established,and the effective ant colony algorithm for the model is constructed.Considering the characteristics of urban freight transportation,the thesis combines sweep algorithm and saving algorithm to decide the allocation between the demand points and transfer stations,then adopts the improved ant colony algorithm to optimize the vehicle routing.

关 键 词：联盟运输调度问题 中转点 蚁群算法 sweep算法 saving算法 

分 类 号：O242.1[理学—计算数学]