基于带随机需求的限量弧路径规划概率型邻域搜索算法OA北大核心CSCDCSTPCD
Probabilistic Neighborhood Search Algorithm Based on Capacitated Arc Routing Planning with Stochastic Demand
针对带随机需求的限量弧路径规划( CARPSD)问题，建立基于期望与方差的数学模型，设计一种概率型邻域搜索算法。采用随机路径扫描产生初始种群，构建最优解集。根据影响解的质量的4个关键指标，构建4种领域结构。应用算法的概率机制，计算邻域搜索的强度，进行大小邻域结构的转化，指导邻域搜索。通过Restart策略，扩大解空间的范围。实验结果表明，该算法可有效解决CARPSD问题，比自适应较大的邻域算法具有更强的寻优能力。
A mathematical model based on expectation and variance is constructed,and a Probabilistic Neighborhood Search(PNS) is proposed for the Capacitated Arc Routing Planning with Stochastic Demand(CARPSD). The heuristic generates the initial solution through Stochastic Path Scanning( SPS) to construct the set of optimal solution. According to four key indicators having an influence on the solution quality,it builds four neighborhood structure,applies probabilistic…查看全部>>
王立斌;安志朋;林丹
河北金融学院基础部，河北 保定071051河北金融学院基础部，河北 保定071051天津大学数学系，天津300072
信息技术与安全科学
带随机需求的限量弧路径规划邻域搜索概率机制随机需求随机路径扫描相似度
Capacitated Arc Routing Planning with Stochastic Demand(CARPSD)neighborhood searchprobabilistic mechanismstochastic demandStochastic Path Scanning(SPS)similarity
《计算机工程》 2015 (5)
197-201,5
评论