Matches in SemOpenAlex for { <https://semopenalex.org/work/W4313506959> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W4313506959 endingPage "1095" @default.
- W4313506959 startingPage "1087" @default.
- W4313506959 abstract "Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in the graph. This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). DNNA finds shortest path among points by starting from an arbitrary point. In next steps this links will be a guide to make complete tour. In other words the links in partial tours have higher chance to be in the final solution. In order to improve the final solutions of a single created tour, The employee bees’ movement radius has been limited, because of avoidance of long random jump between nodes. To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. In addition, 2 types of scout bee were used for to intensify the probability property of the algorithm. Also, convergence in the probability function of employee bees’ movement was prevented by increasing the number of route-creating tours. The first scout bee applies the proposed DNNA and the secondary scout bee improves the partial tours of employee bees in a probable way. Although Althought the average error of proposed ABC algorithm has been 0.371% higher than best solution of all methods, it could improve the solution of 3 problems with average of 3.305%. The proposed algorithm has been better than basic ABC in all tested problems with average of 0.570%." @default.
- W4313506959 created "2023-01-06" @default.
- W4313506959 creator A5007809233 @default.
- W4313506959 creator A5081398085 @default.
- W4313506959 date "2021-11-30" @default.
- W4313506959 modified "2023-10-01" @default.
- W4313506959 title "Artificial Bee Colony Algorithm with Proposed Discrete Nearest Neighborhood Algorithm for Discrete Optimization Problems" @default.
- W4313506959 doi "https://doi.org/10.17576/jkukm-2021-33(4)-31" @default.
- W4313506959 hasPublicationYear "2021" @default.
- W4313506959 type Work @default.
- W4313506959 citedByCount "1" @default.
- W4313506959 countsByYear W43135069592022 @default.
- W4313506959 crossrefType "journal-article" @default.
- W4313506959 hasAuthorship W4313506959A5007809233 @default.
- W4313506959 hasAuthorship W4313506959A5081398085 @default.
- W4313506959 hasBestOaLocation W43135069591 @default.
- W4313506959 hasConcept C11413529 @default.
- W4313506959 hasConcept C126255220 @default.
- W4313506959 hasConcept C132525143 @default.
- W4313506959 hasConcept C154945302 @default.
- W4313506959 hasConcept C162324750 @default.
- W4313506959 hasConcept C175859090 @default.
- W4313506959 hasConcept C22590252 @default.
- W4313506959 hasConcept C2524010 @default.
- W4313506959 hasConcept C2777303404 @default.
- W4313506959 hasConcept C28719098 @default.
- W4313506959 hasConcept C33923547 @default.
- W4313506959 hasConcept C41008148 @default.
- W4313506959 hasConcept C50522688 @default.
- W4313506959 hasConcept C80444323 @default.
- W4313506959 hasConcept C97133563 @default.
- W4313506959 hasConceptScore W4313506959C11413529 @default.
- W4313506959 hasConceptScore W4313506959C126255220 @default.
- W4313506959 hasConceptScore W4313506959C132525143 @default.
- W4313506959 hasConceptScore W4313506959C154945302 @default.
- W4313506959 hasConceptScore W4313506959C162324750 @default.
- W4313506959 hasConceptScore W4313506959C175859090 @default.
- W4313506959 hasConceptScore W4313506959C22590252 @default.
- W4313506959 hasConceptScore W4313506959C2524010 @default.
- W4313506959 hasConceptScore W4313506959C2777303404 @default.
- W4313506959 hasConceptScore W4313506959C28719098 @default.
- W4313506959 hasConceptScore W4313506959C33923547 @default.
- W4313506959 hasConceptScore W4313506959C41008148 @default.
- W4313506959 hasConceptScore W4313506959C50522688 @default.
- W4313506959 hasConceptScore W4313506959C80444323 @default.
- W4313506959 hasConceptScore W4313506959C97133563 @default.
- W4313506959 hasIssue "4" @default.
- W4313506959 hasLocation W43135069591 @default.
- W4313506959 hasLocation W43135069592 @default.
- W4313506959 hasOpenAccess W4313506959 @default.
- W4313506959 hasPrimaryLocation W43135069591 @default.
- W4313506959 hasRelatedWork W1873411485 @default.
- W4313506959 hasRelatedWork W2100526970 @default.
- W4313506959 hasRelatedWork W2111852497 @default.
- W4313506959 hasRelatedWork W2186987970 @default.
- W4313506959 hasRelatedWork W2360299900 @default.
- W4313506959 hasRelatedWork W237089655 @default.
- W4313506959 hasRelatedWork W2765869083 @default.
- W4313506959 hasRelatedWork W2970566679 @default.
- W4313506959 hasRelatedWork W4246049005 @default.
- W4313506959 hasRelatedWork W4293113530 @default.
- W4313506959 hasVolume "33" @default.
- W4313506959 isParatext "false" @default.
- W4313506959 isRetracted "false" @default.
- W4313506959 workType "article" @default.