TY  - CONF
CY  - Omaha, NB
AV  - none
N2  - The problems which are NP-complete in nature are always attracting the computer scientists to develop some heuristic algorithms, generating optimal solution in time-space efficient manner compared to the existing ones. Coloring of the vertices of a graph with minimum number of colours belongs to the same category, where the algorithm designers are trying to propose some new algorithms for better result. Here, we have designed modified Simulated Annealing (MSA) for optimal vertex coloring of a simple, symmetric and connected graph (GCP). The algorithm has been tested upon a series of benchmarks including large scale test case and has shown better output than the simple or non-modified version of the same algorithm. This paper describes the advancement of performance of simple SA applied upon the problem of graph coloring using a specially designed operator called random change operator instead of the general change operator. Our work is still going on for designing better algorithms generating optimal solutions. © 2012 Published by Elsevier Ltd.
N1  - cited By 14; Conference of 12th Annual International Conference on Computational Science, ICCS 2012 ; Conference Date: 4 June 2012 Through 6 June 2012; Conference Code:103361
ID  - scholars3128
TI  - Comparative performance of modified simulated annealing with simple simulated annealing for graph coloring problem
SP  - 321
Y1  - 2012///
SN  - 18770509
PB  - Elsevier B.V.
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-84885866341&doi=10.1016%2fj.procs.2012.04.034&partnerID=40&md5=408675ad3ce834f9e26fac35bf22005d
A1  - Pal, A.J.
A1  - Ray, B.
A1  - Zakaria, N.
A1  - Sarma, S.S.
VL  - 9
EP  - 327
ER  -