2017•Unpublished venueRequires access

Improving a distributed agent-based Ant Colony Optimization for Solving Traveling Salesman Problem

Aleksandar Kaplar, Milan Vidaković, Nikola Luburić, Mirjana Ivanović

Abstract

Optimization of a large-scale Traveling Salesman Problem, which is a well-known NP-hard problem in combinatorial optimization, is a time-consuming problem. A modern approach to dealing with such time-consuming problems is with the use of distributed computing, which can significantly improve the speed of the problem-solving algorithm. In this paper, we discuss the design approaches for an agent-based distributed algorithm and their benefits. Based on further analysis and experiments, we have improved our previous agent-based Ant Colony Optimization algorithm for Solving Traveling Salesman Problem using Siebog multiagent middleware.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Travelling salesman problem, Ant colony optimization algorithms, 2-opt, Computer science, Extremal optimization, Mathematical optimization, Combinatorial optimization, Multi-agent system