DNCCLA: Discrete New Caledonian Crow Learning Algorithm for Solving Traveling Salesman Problem
The development of metaheuristic algorithms has led to the solution of various optimization problems. Bioinspired optimization algorithms like the New Caledonian crow learning algorithm (NCCLA) are primarily designed to address continuous problems. As most real-world problems are discrete, some oper...
Saved in:
Main Authors: | Ali H. Alsaidi, Wedad Al-Sorori, Abdulqader M. Mohsen |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2024-01-01
|
Series: | Applied Computational Intelligence and Soft Computing |
Online Access: | http://dx.doi.org/10.1155/acis/5324998 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Modified shuffled frog-leaping algorithm to solve traveling salesman problem
by: LUO Xue-hui, et al.
Published: (2009-01-01) -
Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem
by: Awaz Ahmad Shaban, et al.
Published: (2023-07-01) -
Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem
by: Ho-Yoeng Yun, et al.
Published: (2013-01-01) -
Trajectory Stability in the Traveling Salesman Problem
by: Sergio Sánchez, et al.
Published: (2018-01-01) -
An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
by: Jinmo Sung, et al.
Published: (2014-01-01)