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 than 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 further information in this area. Our work is progressing, but we don´t know whether better players are needed for final bet through in this particular algorithm design