Influence of Programming Language on the Execution Time of Ant Colony Optimization Algorithm
Supply chains can be accelerated by route optimization, a computationally intensive process for a large number of instances. Traveling Salesmen Problem, as the representative example of routing problems, is NP-hard combinatorial problem. It means that the time needed for solving the problem with exa...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
University North
2022-01-01
|
Series: | Tehnički Glasnik |
Subjects: | |
Online Access: | https://hrcak.srce.hr/file/400302 |