首页> 外国专利> METHOD AND APPARATUS FOR DATA PROCESSING OF FINDING COMBINATORIAL OPTIMUM SOLUTION

METHOD AND APPARATUS FOR DATA PROCESSING OF FINDING COMBINATORIAL OPTIMUM SOLUTION

机译:寻找组合最优解的数据处理方法和装置

摘要

PPROBLEM TO BE SOLVED: To efficiently solve a combinatorial optimum problem. PSOLUTION: In a data processing method for finding a combinatorial optimum solution, for finding a combination state giving an optimum evaluation function value, a combination state to be transited is decided among combination states defined to be in an adjacent state with starting from an initial combination state, and transition of the combination state is repeated sequentially to perform network configuration search. A problem-specific distance as a distance between problem-specific states is defined, and when an improvement rate of the evaluation function value due to the search becomes a fixed value or less, transition with a large problem-specific distance is performed several times. Afterward, search is carried out a predetermined times only for state change with a small problem-specific distance, and the search is continued by repeating the above process. PCOPYRIGHT: (C)2010,JPO&INPIT
机译:

要解决的问题:有效地解决组合最优问题。

解决方案:在用于找到组合最优解的数据处理方法中,为了找到给出最佳评估函数值的组合状态,从定义为处于相邻状态的组合状态中,确定要转换的组合状态,从初始组合状态,并依次重复组合状态的转变以执行网络配置搜索。定义作为问题特定状态之间的距离的问题特定距离,并且当由于搜索而导致的评估函数值的提高率变为固定值或更小时,以特定问题大距离进行多次转换。之后,仅针对状态变化以预定的小距离来进行预定时间的搜索,并且通过重复上述过程来继续搜索。

版权:(C)2010,日本特许厅&INPIT

著录项

  • 公开/公告号JP2010186425A

    专利类型

  • 公开/公告日2010-08-26

    原文格式PDF

  • 申请/专利权人 MITSUBISHI ELECTRIC CORP;

    申请/专利号JP20090031515

  • 发明设计人 ITAYA NOBUHIKO;

    申请日2009-02-13

  • 分类号G06F19;

  • 国家 JP

  • 入库时间 2022-08-21 19:05:34

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号