Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Applications》 2005-03
Add to Favorite Get Latest Update

A Mean Field Annealing-based Algorithm for Four-Coloring Map Problems

Liu Jingfa 1,2 Wang Zengbo 1 Huang Weiqi 21 (Dept.of Math.,Hengyang Normal College,Hengyang421008) 2 (Computer Science and Technology Institute of HUST,Wuhan430074)  
In this paper,a mean field annealing-based algorithm(AFA)is given for solving four-coloring map problem.First,it gives its neural network and computational energy.To avoid that the network will be stuck into local minimum,it adds"hill-climbing"term to the mean field,so that it can be expected to force the network to converge to the globally optimal or near-optimal solutions.Numerical simulations of four-coloring map problem show that AFA has an apparent advantage in the convergence speed by comparing AFA with the discrete binary Hopfield neural networks in conference(4)and the neural networks with transient chaos in.The experimental results show that it is an effective method.
【Fund】: 湖南省教育厅科研基金资助项目(编号:02C133)
【CateGory Index】: TP183
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【References】
Chinese Journal Full-text Database 1 Hits
1 LIAO Fei-xiong,MA Liang(College of Management,University of Shanghai for Science and Technology,Shanghai 200093);Heuristic Search-based Ant Algorithm of Solving Graph Coloring Problem[J];Computer Engineering;2007-16
【Citations】
Chinese Journal Full-text Database 2 Hits
1 WANG Xiu-hong+1, WANG Zheng-ou+1, QIAO Qing-li+2 (1. School of Management, Tianjin University, Tianjin 300072, China; 2. School of Life Science & Biotechnology, Shanghai Jiaotong University, Shanghai 200030, China);Artificial Neural Network with Transient Chaos for Four-Coloring Map Problems and K-Colorability Problems[J];Systems Engineering-theory & Practice;2002-05
2 XINJIAN ZHOU ,XIANGSUN ZHANG (Institute of Applied Mathematic, the Chinese Academy of Sciences, Beijing, 100080, China);Hopfield-type Neural Network For Solving "Four-Coloring Map Problems[J];OR TRANSACTIONS;1999-03
【Co-citations】
Chinese Journal Full-text Database 5 Hits
1 Cheng Wei-nan (Department of Electronic Engineering Nanjing University of Posts & Telecommunications,Nanjing,210003,China);Blind Equalization using Hopfield-type Neural Network algorithms[J];Electronics Quality;2008-03
2 CHEN Hong-shun1,2,3,XIA Bin1,2,PAN Cong1,2,3,LV Zhi-qiang1,3,HAN Yun41.Guangzhou Institute of Geochemistry,Chinese Academy of Sciences,Guangzhou 510640,China 2.Center for GIS Industry Development,Chinese Academy of Sciences,Beijing 100101,China 3.Graduate University of Chinese Academy of Sciences,Beijing 100049,China 4.South Digital Technology Co.Ltd( South Surveying & Mapping) ,Guangzhou 510665,China;Particle Swarm Optimization algorithm for solving four-coloring map problem[J];Computer Engineering and Applications;2009-20
3 WANG Xiu-hong,ZHAO Sheng-min(School of Management,Tianjin University,Tianjin 300072,China);ANT ALGORITHMS FOR SOLVING GRAPH COLORING[J];Journal of Inner Mongolia Institute of Agriculture and Animal Husbandry;2005-03
4 HAN Yun1,2 GUO Qingsheng1,2,3 ZHANG Liping1,2 SUN Yan1,2(1 School of Resource and Environment System,Wuhan University,129 Luoyu Road,Wuhan 430079,China)(2 Key Laboratory of Geographic Information System,Ministry of Education,Wuhan University,129 Luoyu Road,Wuhan 430079,China)(3 State Key Laboratory for Information Engineering in Surveying,Mapping and Remote Sensing,Wuhan University,129 Luoyu Road,Wuhan 430079,China);Hybrid Genetic Algorithm for Coloring Administrative Map[J];Geomatics and Information Science of Wuhan University;2007-08
5 Guangzhao Cui a, Limin Qin a, Sha Liua, Yanfeng Wang a, Xuncai Zhang b, Xianghong Cao a a College of Electrical and Electronic Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China b Research Institute of Biomolecular Computer, Huazhong University of Science and Technology, Wuhan 430074, China;Modifled PSO algorithm for solving planar graph coloring problem[J];自然科学进展(英文版);2008-03
【Co-references】
Chinese Journal Full-text Database 3 Hits
1 MA Liang, XIANG Pei Jun College of Management, University of Shanghai for Science and Technology, Shanghai 200093, China;Applications of the ant algorithm to combinatorial optimization[J];Journal of Manegement Sciences In China;2001-02
2 CHEN Weidong(Dept.of Computer Science,South China Normal University,Guangzhou,510631,China);New Algorithms for Graph Coloring Problem[J];Microcomputer applications;2004-04
3 Ma LiangAssociate Professor, College of Systems Science and Systems Engineering, University of Shanghai for Science and Technology, Shanghai 200093;Ant Algorithm-Optimization strategy from the insect colony[J];Nature Magazine;1999-03
【Secondary References】
Chinese Journal Full-text Database 2 Hits
1 ZHAI Xue-min1,LIU Yuan1,2,LIU Bo3,BI Rong-rong1(1.College of Information Engineering,Southern Yangtze University,Wuxi Jiangsu 214122,China;2.School of Computer,Nanjing University of Science & Technology,Nanjing 210094,China;3.College of Information Science & Engineering,Central South University,Changsha 410083,China);Optimized query strategy of XML data with swarm intelligent mix algorithms[J];Application Research of Computers;2008-10
2 CUI Xue-li,ZHU Zhen-gang(School of Economy & Management,SUST,Suzhou 215009,China);A Hybrid Improved Ant Algorithm for Vehicle Routing Problem[J];Journal of Suzhou University of Science and Technology(Engineering and Technology);2009-04
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved