首页 | 本学科首页   官方微博 | 高级检索  
     

求解CARP车场选址问题的混合随机搜索算法
引用本文:刘琳,朱征宇,许林,陈飞. 求解CARP车场选址问题的混合随机搜索算法[J]. 计算机应用, 2010, 30(6): 1508-1512
作者姓名:刘琳  朱征宇  许林  陈飞
作者单位:1. 重庆大学2. 重庆市重庆大学3.
基金项目:国家科技支撑计划项目(2007BAH08B04);;重庆大学创新性实验计划项目(2008)
摘    要:针对环保车车场选址问题,提出了一种混合随机搜索算法(HRSA)。新算法利用当车场已知时计算环保车优化行使路线的CARP算法作为车场选址评估函数,为加快收敛速度采用改进的Dijkstra算法计算初始车场地址,进而采用一种局部搜索策略寻找当前车场附近的更优地址,同时为避免陷入局部最优采用一种随机跳变策略探测其他更优地址,实现对解空间的高效搜索。在洒水车车场选址问题上的实验表明,HRSA求解此类问题是有效的。

关 键 词:CARP  车场选址  随机搜索  洒水车  
收稿时间:2009-12-07
修稿时间:2010-03-04

Hybrid random searching algorithm for solving depot-location problem of CARP
LIU Lin,ZHU Zheng-yu,XU Lin,CHEN Fei. Hybrid random searching algorithm for solving depot-location problem of CARP[J]. Journal of Computer Applications, 2010, 30(6): 1508-1512
Authors:LIU Lin  ZHU Zheng-yu  XU Lin  CHEN Fei
Affiliation:College of Computer Science/a>;Chongqing University/a>;Chongqing 400044/a>;China
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 sp...
Keywords:arc routing problem  depot-location  random searching  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号