首页> 外文期刊>Swarm and Evolutionary Computation >A parameter-free discrete particle swarm algorithm and its application to multi-objective pavement maintenance schemes
【24h】

A parameter-free discrete particle swarm algorithm and its application to multi-objective pavement maintenance schemes

机译:无参数离散粒子群算法及其在多目标路面维护方案中的应用

获取原文
获取原文并翻译 | 示例
       

摘要

Regular maintenance is paramount for a healthy road network, the arteries of any economy. As the resources for maintenance are limited, optimization is necessary. A number of conflicting objectives exist with many influencing variables. Although many methods have been proposed, the related research is very active, due to difficulties in adoption to the actual practice owing to reasons such high-dimensional problems even for small road networks. Literature survey tells that particle swarms have not been exploited much, mainly due to unavailability of many techniques in this domain for multi-objective discrete problems like this. In this work, a novel particle swarm algorithm is proposed for a general, discrete, multi-objective problem. In contrast to the standard particle swarm, the bare-bones technique has a clear advantage in that it is a parameter-free technique, hence the end users need not be optimization experts. However, the existing barebones algorithm is available only for continuous domains, sans any particle velocity terms. For discrete domains, the proposed method introduces a parameter-free velocity term to the standard bare-bones algorithm. Based on the peak velocities observed by the different dimensions of a particle, its new position is calculated. A number of benchmark test functions are also solved. The results show that the proposed algorithm is highly competitive and able to obtain much better spread of solutions compared to three other existing PSO and genetic algorithms. The method is benchmarked against a number of other algorithms on an actual pavement maintenance problem. When compared against another particle swarm algorithm, it not only shows better performance, but also significant reduction in run-time compared to other POS algorithm. Hence, for large road network maintenance, the proposed method shows a lot of promise in terms of analysis time, while improving on the quality of solutions.
机译:经常经济的动脉,定期维护至关重要。随着维护资源有限,优化是必要的。许多影响变量存在许多冲突的目标。虽然已经提出了许多方法,但相关的研究非常活跃,因为由于对于小型道路网络即使是小路网络也是如此的高维问题,因此采用了实际做法的困难。文献调查告诉粒子群没有被利用多大,主要是由于这种域中的许多技术的不可用来进行这样的多目标离散问题。在这项工作中,提出了一种新的粒子群算法,用于一般,离散,多目标问题。与标准粒子群相比,裸骨技术具有明显的优势,因为它是一种无参数技术,因此最终用户不需要优化专家。然而,现有的鞍座算法仅适用于连续域,使用任何粒子速度术语。对于离散域,所提出的方法向标准裸骨算法引入无参数的速度术语。基于由粒子的不同尺寸观察到的峰值速度,计算其新位置。还解决了许多基准测试功能。结果表明,与其他三个现有的PSO和遗传算法相比,该算法具有竞争力,能够获得更好的解决方案传播。该方法采用实际路面维护问题的许多其他算法基准测试。与另一个粒子群算法进行比较时,与其他POS算法相比,它不仅显示出更好的性能,而且显示出运行时间的显着降低。因此,对于大型道路网络维护,所提出的方法在分析时间方面表现出很多承诺,同时提高了解决方案的质量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号