首页> 外文会议>Evolutionary computation in combinatorial optimization >Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape Measures
【24h】

Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape Measures

机译:使用信息理论景观测量预测车辆路径问题的遗传算法性能

获取原文

摘要

In this paper we examine the predictability of genetic algorithm (GA) performance using information-theoretic fitness landscape measures. The outcome of a GA is largely based on the choice of search operator, problem representation and tunable parameters (crossover and mutation rates, etc). In particular, given a problem representation the choice of search operator will determine, along with the fitness function, the structure of the landscape that the GA will search upon. Statistical and information theoretic measures have been proposed that aim to quantify properties (ruggedness, smoothness, etc) of this landscape. In this paper we concentrate on the utility of information theoretic measures to predict algorithm output for various instances of the capacitated and time-windowed vehicle routing problem. Using a clustering-based approach we identify similar landscape structures within these problems and propose to compare GA results to these clusters using performance profiles. These results highlight the potential for predicting GA performance, and providing insight self-configurable search operator design.
机译:本文使用信息理论健身景观措施来研究遗传算法(GA)性能的可预测性。 GA的结果主要基于搜索操作员的选择,问题表示和可调参数(交叉和突变率等)。特别地,给出问题表示,搜索操作员的选择将与GA将突出的景观的结构一起确定。已经提出了统计和信息理论措施,旨在量化这种景观的性质(坚固性,平滑度等)。在本文中,我们专注于信息理论措施的效用,以预测电容和时间窗口路线问题的各种情况的算法输出。使用基于聚类的方法,我们在这些问题中识别类似的横向结构,并建议使用性能配置文件将GA结果与这些集群进行比较。这些结果突出了预测GA性能的可能性,并提供Insight自配置搜索操作员设计。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号