Performance Profile of a Hybrid Heuristic Search Technique using Graph Coloring as a Seed Example
Design and analysis of new algorithms are ever going phenomena in life of computer scientists. NP problems are attracting designers to design both heuristic and approximate algorithms that can result in better optimal and time-space efficient algorithms. Here, we have designed a memetic algorithm (also known as metaheuristic or hybrid heuristic), for optimal vertex coloring of a simple, symmetric and connected graph. Other titan various uses, the problem has a perfume of efficient algorithm design in large-scale test graph. The earlier works, though encouraging, could not draw a conclusion that is deterministic. This paper is an essay towards jurther information in this area. Our work is progressing, but we dont know whether better players are needed for final bet through in this particular algorithm design.
memetic algorithm metaheuristic vertex coloring NP GA.
Anindya J. Pal Samar S. Sarma Biman Ray
Heritage Institute of Technology Chowbaga Road, Kolkata 700107, India University College of Sc & Technology 92 A. P. C. Road, Kolkata 700009, India
国际会议
Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)
北京
英文
640-645
2006-07-17（万方平台首次上网日期，不代表论文的发表时间）