CAJ | 학술논문

为使多集散点车辆路径问题结果全局最优,以订单为基准建立货运车辆路径问题模型.以订单为基准建立蚁群算法的二维禁忌数组,确定相邻两个集散点相同时的蚂蚁状态转移规则,使蚁群在满足车辆约束条件下,按禁忌表对所有订单搜索.此模型和算法实现了所有车辆对所有订单进行路径搜索,易于全局最优.实例求解结果表明模型及算法的有效性.
위사다집산점차량로경문제결과전국최우,이정단위기준건립화운차량로경문제모형.이정단위기준건립의군산법적이유금기수조,학정상린량개집산점상동시적마의상태전이규칙,사의군재만족차량약속조건하,안금기표대소유정단수색.차모형화산법실현료소유차량대소유정단진행로경수색,역우전국최우.실례구해결과표명모형급산법적유효성.
In order to get the global solution in multi-depots vehicle routing problem （VRP）, VRP model based on detail order information was established. A two dimension tabu table based on orders was established for ant colony optimization algorithm, and state transfer rules were established when the two adjacent nodes were same. Then all the vehicle routs were searched by ants that satisfied the vehicle constrain according to ants tabu table. It is easy to get the global solution for model and algorithm implement the routs search of all vehicles to all orders. The illustration result shows that model and algorithm are effective for multi-depots vehicle routing problem.