Publication:
Finding the best tour for travelling salesman problem using artificial ecosystem optimization

datacite.subject.fos oecd::Social sciences
dc.contributor.author Quyen Thi Nguyen
dc.contributor.author Minh-Phung Bui
dc.date.accessioned 2022-11-02T01:22:24Z
dc.date.available 2022-11-02T01:22:24Z
dc.date.issued 2021
dc.description.abstract This paper presents a new method based on the artificial ecosystem optimization (AEO) algorithm for finding the shortest tour of the travelling salesman problem (TSP). Wherein, AEO is a newly developed algorithm based on the idea of the energy flow of living organisms in the ecosystem consisting of production, consumption and decomposition mechanisms. In order to improve the efficiency of the AEO for the TSP problem, the 2-opt movement technique is equipped to enhance the quality of the solutions created by the AEO. The effectiveness of AEO for the TSP problem has been verified on four TSP instances consisting of the 14, 30, 48 and 52 cities. Based on the calculated results and the compared results with the previous methods, the proposed AEO method is one of the effective approaches for solving the TSP problem.
dc.identifier.doi 10.11591/ijece.v11i6.pp5497-5504
dc.identifier.uri http://repository.vlu.edu.vn:443/handle/123456789/574
dc.language.iso en_US
dc.relation.ispartof International Journal of Electrical and Computer Engineering (IJECE)
dc.relation.issn 2722-2578
dc.relation.issn 2088-8708
dc.subject "2-opt algorithm
dc.subject Artificial ecosystem optimization
dc.subject Organisms
dc.subject Shortest tour
dc.subject TSP"
dc.title Finding the best tour for travelling salesman problem using artificial ecosystem optimization
dc.type journal-article
dspace.entity.type Publication
oaire.citation.issue 6
oaire.citation.volume 11
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
AS249.pdf
Size:
568.85 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: