순회 판매원 문제 해결을 위한 개미집단 최적화 알고리즘 개선
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 장주영 | - |
dc.contributor.author | 김민제 | - |
dc.contributor.author | 이종환 | - |
dc.date.available | 2020-04-24T10:25:20Z | - |
dc.date.created | 2020-03-31 | - |
dc.date.issued | 2019 | - |
dc.identifier.issn | 2005-0461 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/kumoh/handle/2020.sw.kumoh/227 | - |
dc.description.abstract | It is one of the known methods to obtain the optimal solution using the Ant Colony Optimization Algorithm for the Traveling Salesman Problem (TSP), which is a combination optimization problem. In this paper, we solve the TSP problem by proposing an improved new ant colony optimization algorithm that combines genetic algorithm mutations in existing ant colony optimization algorithms to solve TSP problems in many cities. The new ant colony optimization algorithm provides the opportunity to move easily fall on the issue of developing local optimum values of the existing ant colony optimization algorithm to global optimum value through a new path through mutation. The new path will update the pheromone through an ant colony optimization algorithm. The renewed new pheromone serves to derive the global optimal value from what could have fallen to the local optimal value. Experimental results show that the existing algorithms and the new algorithms are superior to those of existing algorithms in the search for optimum values of newly improved algorithms. | - |
dc.language | 한국어 | - |
dc.language.iso | ko | - |
dc.publisher | 한국산업경영시스템학회 | - |
dc.title | 순회 판매원 문제 해결을 위한 개미집단 최적화 알고리즘 개선 | - |
dc.title.alternative | Improvement of Ant Colony Optimization Algorithmto Solve Traveling Salesman Problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 이종환 | - |
dc.identifier.doi | 10.11627/jkise.2019.42.3.001 | - |
dc.identifier.bibliographicCitation | 한국산업경영시스템학회지, v.42, no.3, pp.1 - 7 | - |
dc.relation.isPartOf | 한국산업경영시스템학회지 | - |
dc.citation.title | 한국산업경영시스템학회지 | - |
dc.citation.volume | 42 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 7 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART002506719 | - |
dc.description.journalClass | 2 | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Ant Colony Optimization Algorithm | - |
dc.subject.keywordAuthor | Traveling Salesman Problem | - |
dc.subject.keywordAuthor | Optimization | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
350-27, Gumi-daero, Gumi-si, Gyeongsangbuk-do, Republic of Korea (39253)054-478-7170
COPYRIGHT 2020 Kumoh University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.