Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Penerbit Universiti Kebangsaan Malaysia
2021
|
| Online Access: | http://journalarticle.ukm.my/18962/1/31.pdf http://journalarticle.ukm.my/18962/ https://www.ukm.my/jkukm/volume-334-2021/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|