Abstract:
Constraint Satisfaction Problems are regarded as NP-Complete problems which solving them with systematic methods requires exponential time. Firefly algorithm is a nature ...Show MoreMetadata
Abstract:
Constraint Satisfaction Problems are regarded as NP-Complete problems which solving them with systematic methods requires exponential time. Firefly algorithm is a nature inspired algorithm which has been successfully applied to different combinatorial problems. This paper presents a new Discrete Firefly Algorithm for Solving Constraint Satisfaction problems (CSPs) and investigates its applicability for dealing with such problems. Performance of the proposed method has been assessed through extensive experiments on CSP instances generated by Model RB which is a standard mean for generating CSPs with different tightness. Results of the experiments in comparison with other methods including classical methods and other metaheuristic methods clearly demonstrate the significant performance of proposed discrete firefly algorithm in dealing with CSPs.
Published in: 2018 IEEE Congress on Evolutionary Computation (CEC)
Date of Conference: 08-13 July 2018
Date Added to IEEE Xplore: 04 October 2018
ISBN Information: