|1/2012 - 5|
Elitist Ant System with 2-opt Local Search for the Traveling Salesman ProblemMARTINOVIC, G. , BAJER, D.
|Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science|
|Download PDF (1,384 KB) | Citation | Downloads: 1,212 | Views: 4,390|
2-opt algorithm, elitist ant system, local search, Traveling Salesman Problem, search stagnation
optimization(10), problem(7), colony(7), traveling(6), salesman(6), algorithm(6), stutzle(4), local(4), dorigo(4), computational(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2012-02-28
Volume 12, Issue 1, Year 2012, On page(s): 25 - 32
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2012.01005
Web of Science Accession Number: 000301075000005
SCOPUS ID: 84860778058
The Traveling Salesman Problem is one of the most famous problems in combinatorial optimization. The paper presents an algorithm based upon the elitist ant system for solving the traveling salesman problem. 2-opt local search is incorporated in the elitist ant system, and it is used for improvement of a given number of solutions previously constructed by artificial ants. A simple mechanism for avoiding a too early stagnation of the search is also proposed. The aforementioned is based on depositing strong pheromones on solution edges of randomly selected ants called random elitist ants. The aim is to encourage exploration in a greater area of the solution space. Experimental analysis shows how high-quality solutions can be achieved by using the considered algorithm instead of the usual elitist ant system with incorporated 2-opt local search.
Web of Science® Times Cited: 4 [View]
View record in Web of Science® [View]
View Related Records® [View]
Updated 2 days, 3 hours ago
SCOPUS® Times Cited: 5
View record in SCOPUS® [Free preview]
View citations in SCOPUS® [Free preview]
 MetrIntMeas a novel metric for measuring the intelligence of a swarm of cooperating agents, Iantovics, Laszlo Barna, Emmert-Streib, Frank, Arik, Sabri, Cognitive Systems Research, ISSN 1389-0417, Issue , 2017.
Digital Object Identifier: 10.1016/j.cogsys.2017.04.006 [CrossRef]
 A Modified Kruskal's Algorithm to Improve Genetic Search for Open Vehicle Routing Problem, Dutta, Joydeep, Barma, Partha Sarathi, Kar, Samarjit, De, Tanmay, International Journal of Business Analytics, ISSN 2334-4547, Issue 1, Volume 6, 2019.
Digital Object Identifier: 10.4018/IJBAN.2019010104 [CrossRef]
 Improvement of the Gravitational Search Algorithm by means of Low-Discrepancy Sobol Quasi Random-Number Sequence Based Initialization, ALTINOZ, O. T., YILMAZ, A. E., WEBER, G.-W., Advances in Electrical and Computer Engineering, ISSN 1582-7445, Issue 3, Volume 14, 2014.
Digital Object Identifier: 10.4316/AECE.2014.03007 [CrossRef] [Full text]
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Clarivate Analytics, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.