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

基于强化学习的一类NP问题求解算法
引用本文:孟祥萍,苑全德,皮玉珍,陈渝. 基于强化学习的一类NP问题求解算法[J]. 现代电子技术, 2007, 30(4): 138-139,142
作者姓名:孟祥萍  苑全德  皮玉珍  陈渝
作者单位:1. 长春工程学院,电气与信息工程学院,吉林,长春,130012
2. 东北电力大学,信息工程学院,吉林,吉林,132012
摘    要:Agent强化学习是机器学习的一个重要分支。阐述了Agent强化学习算法的基本理论,建立了求解类货郎担等NP问题的数学模型,给出了Agent强化学习算法解决这类问题的框架和基本方法,并运用该方法成功地解决了一个赛程安排问题,较传统方法有一定的改进。

关 键 词:强化学习  NP问题  货郎担问题
文章编号:1004-373X(2007)04-138-02
收稿时间:2006-07-18
修稿时间:2006-07-18

An Efficient Solution Algorithm Based on Reinforcement Learning for Some NP Problems
MENG Xiangping,YUAN Quande,PI Yuzhen,CHEN Yu. An Efficient Solution Algorithm Based on Reinforcement Learning for Some NP Problems[J]. Modern Electronic Technique, 2007, 30(4): 138-139,142
Authors:MENG Xiangping  YUAN Quande  PI Yuzhen  CHEN Yu
Affiliation:1. Department of Electrical Engineering, Changchun Institute of Technology, Changchun, 130012, China; 2. Department of Information Engineering, Northeast Dianli University,Jilin, 132012, China
Abstract:Agent reinforcement learning is an important branch of machine learning.In this paper the author introduces the theory of Agent reinforcement learning algorithm,establishes a mathematic model to solve some NP problems such as Traveling Salesman Problem,and presents a framework and a basic method using Agent reinforcement learning algorithm to solve this class problem.We have solved a problem about tournament sorting with our novel algorithm successfully,and the result shows it is more effective than traditional methods.
Keywords:Agent
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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