单纯形蚁群算法对带时间窗车辆路径优化问题的研究  

Research on A Simplex Ant Colony Optimization Algorithm for VRP with Time Windows

作　　者：李永亮[1] 王玉富 向长城[1] 

机构地区：[1]湖北民族学院理学院,湖北恩施445000 [2]郑州测绘学校,河南郑州450015

出　　处：《湖北民族学院学报（自然科学版）》2014年第4期422-425,共4页Journal of Hubei Minzu University(Natural Science Edition)

基　　金：湖北省自然科学基金项目(2010CDZ047);恩施州科技局项目(201103)

摘　　要：研究了单纯形蚁群算法解决带时间窗约束条件的车辆路径问题,旨在突出研讨在运输中不仅距离最短,而且使应用的时间尽可能的少.首先建立时间、距离对搜索路径的影响函数,然后用单纯形蚁群算法解出最优路径.简单介绍了运输的现状,提出了物流双向运输的数学模型及单纯形蚁群算法,得出了物流运输最经济的合理路线结论.This paper studied a complex vehicle routing problem with time window constraints by simplex ant colony algorithm.This article aims to research not only the shortest distance,but also the application of time as small as possible in the vehicle of transportation.We established function that time and distance influence on searching path,then,we used simplex ACO to solve this problem and get the optimal solu-tion.By describing the status of transportation,we proposed a mathematical model of a two-way transport and logistics simplex ant colony algorithm,and obtained the most economical transport routes.

关 键 词：物流配送 单纯形蚁群算法 车辆路径问题 时间窗 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]