An empirical evaluation of memory less and memory using meta-heuristics for solving travelling salesman problem Online publication date: Tue, 09-Jan-2018
by Arun Prakash Agrawal; Arvinder Kaur
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 3, No. 4, 2017
Abstract: In many situations, a researcher gets bewildered when it comes to selection of an appropriate meta-heuristic algorithm for any specific problem. Meta-heuristic algorithms need to be categorised depending on their ability to solve problems of varying degree of complexity to overpower such confusion. Considering this view, the performance evaluations of six popular meta-heuristic algorithms have been done. Three research questions are framed to evaluate the hypothesis for any difference in the performance of memory less and memory based meta-heuristics. The domain of inquiry in this paper is the travelling salesman problem. Extensive experiments are conducted and results are analysed using various statistical tests such as F-test, and post-hoc tests. An obvious outcome of this study is that there is an interaction effect between the problem sizes and the meta-heuristic used and no clear superiority of one meta-heuristic over the other.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook