Hybrid iterated local search algorithm for optimization route of airplane travel plans
The traveling salesman problem (TSP) is a very popular combinatorics problem. This problem has been widely applied to various real problems. The TSP problem has been classified as a Non-deterministic Polynomial Hard (NP-Hard), so a non-deterministic algorithm is needed to solve this problem. However...
Saved in:
| Published in: | International journal of electrical and computer engineering (Malacca, Malacca) Vol. 13; no. 4; p. 4700 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.08.2023
|
| ISSN: | 2088-8708, 2722-2578 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!