计算机应用 ›› 2010, Vol. 30 ›› Issue (06): 1508-1512.

• 人工智能 • 上一篇    下一篇

求解CARP车场选址问题的混合随机搜索算法

刘琳1,朱征宇1,许林2,陈飞3   

  1. 1. 重庆大学
    2. 重庆市重庆大学
    3.
  • 收稿日期:2009-12-07 修回日期:2010-03-04 发布日期:2010-06-01 出版日期:2010-06-01
  • 通讯作者: 朱征宇

Hybrid random searching algorithm for solving depot-location problem of CARP

  • Received:2009-12-07 Revised:2010-03-04 Online:2010-06-01 Published:2010-06-01

摘要: 针对环保车车场选址问题,提出了一种混合随机搜索算法(HRSA)。新算法利用当车场已知时计算环保车优化行使路线的CARP算法作为车场选址评估函数,为加快收敛速度采用改进的Dijkstra算法计算初始车场地址,进而采用一种局部搜索策略寻找当前车场附近的更优地址,同时为避免陷入局部最优采用一种随机跳变策略探测其他更优地址,实现对解空间的高效搜索。在洒水车车场选址问题上的实验表明,HRSA求解此类问题是有效的。

关键词: CARP, 车场选址, 随机搜索, 洒水车

Abstract: To solve the depot-location of pro-environment vehicles, a Hybrid Random Searching Algorithm (HRSA) was presented. A Capacitated Arc Routing Problem (CARP) algorithm of finding the optimal driven-route of pro-environment vehicles when the depot had been known was used in HRSA as its evaluation function for the current depot. An improved Dijkstra-algorithm of computing its initial depot was also used in HRSA to speed up its convergence rate. The new algorithm can realize an effective searching in the solution space by using a local searching mechanism to find a more optimal depot near the current depot and by using a random searching mechanism to prevent it from getting into a local optimal depot. The validity and efficiency of the HRSA algorithm are shown by the experiments on the depot-location of sprinkler-cars.

Key words: CARP, location, random searching, sprinkler cars