NobleBlocks
Public

Combinatorial problem optimization using TLBO

Published • Sep 1, 2017
NobleIDNI3P20W73R15S21
Authors:
Sahil Saharan
,
J. S. Lather
,
R. Radhakrishnan

Abstract

Travelling Salesman Problem(TSP) is an NP hard problem, which has been addressed via several heuristic algorithms like genetic algorithms (GA) etc. The paper presents TSP solution using Teaching Learning Based optimization(TLBO) which includes many similarities like the other nature-inspired algorit...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!