Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2011, Vol. 37 ›› Issue (7): 234-236. doi: 10.3969/j.issn.1000-3428.2011.07.079

• Networks and Communications • Previous Articles     Next Articles

Quantum Evolutionary Algorithm for Solving Postal Route Problem

ZHAO Jun-sheng   

  1. (Department of Computer Science, Gansu Normal University for Nationalities, Hezuo 747000, China)
  • Online:2011-04-05 Published:2011-03-31

一种求解邮路问题的量子进化算法

赵俊生   

  1. (甘肃民族师范学院计算机科学系,甘肃 合作 747000)
  • 作者简介:赵俊生(1971-),男,副教授,主研方向:DC元数据,智能算法,藏文数据库技术
  • 基金资助:
    甘肃省教育科研基金资助项目(0614B-03)

Abstract: The Village Postman Problem(VPP) is NP-complete problem. Most of the algorithms for it are intelligence algorithm and linear programming. Aiming at basic Quantum Evolution Algorithm(QEA) is easy to trap into local deceptive optima, an improved QEA is proposed. Experimental result demonstrates the improved algorithm can get better solution to the VPP than basic algorithm. It has better diversity and global search capacity. It indicates the algorithm is effective to solve the VPP.

Key words: Quantum Algorithm(QA), Quantum Evolutionary Algorithm(QEA), Village Postman Problem(VPP), Hamilton circle

摘要: 乡村邮递员问题属于NP完全问题,对它的近似求解方法主要是智能算法及线性规划,但其中的基本量子进化算法易陷于局部最优解。为此,提出一种新的量子进化算法,结合城市垃圾运输问题,对算法进行测试。结果表明,该算法在全局寻优能力及种群多样性方面均比传统算法有所改进,是求解乡村邮递员问题的一种有效算法。

关键词: 量子算法, 量子进化算法, 乡村邮递员问题, Hamilton圈

CLC Number: