# Application of Multi-core Parallel Programming to a Combination of Ant Colony Optimization and Genetic Algorithm

@article{Kalyani2014ApplicationOM, title={Application of Multi-core Parallel Programming to a Combination of Ant Colony Optimization and Genetic Algorithm}, author={Rishita Kalyani}, journal={ArXiv}, year={2014}, volume={abs/1411.4297} }

This Paper will deal with a combination of Ant Colony and Genetic Programming Algorithm to optimize Travelling Salesmen problem (NP-Hard). However, the complexity of the algorithm requires considerable computational time and resources. Parallel implementation can reduce the computational time. In this paper, emphasis in the parallelizing section is given to Multi-core architecture and Multi-Processor Systems which is developed and used almost everywhere today and hence, multi-core… Expand

#### 10 Citations

Parallelizing GA based heuristic approach for TSP over CUDA and OPENMP

- Computer Science
- 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI)
- 2017

A parallel version of GA for both multicore and many core architectures over OpenMP and CUDA in order to make some of the challenging problems like Vehicle Routing Problem for google maps, DNA sequencing and many more optimization problems involving a good amount of complex computation and data handling. Expand

A novel genetic algorithm based on circles for larger-scale traveling salesman problem

- Mathematics
- 2017 International Conference on Robotics and Automation Sciences (ICRAS)
- 2017

The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard combinatorial optimization problems and Genetic Algorithm (GA) is an effective method for solving it. Nevertheless, the… Expand

Adapting Travelling Salesmen Problem for Real-Time UAS Path Planning Using Genetic Algorithm

- Computer Science
- Lecture Notes in Mechanical Engineering
- 2021

This paper develops an algorithm using the concept of GA to solve TSP as per the requirements of UAS path planning and shows that the approach of the GA is relatively effective in finding the minimum path direction. Expand

Task Scheduling Model

- Computer Science
- 2015

This work attempts to optimize on the scheduling time by designing a task scheduling model based on ACO, a swarm intelligence model, and the predicted schedule is comparable to the actual schedule with respect to waiting time of tasks and average processor utilization. Expand

MULTIDIMENSIONAL ANALYSIS OF GENETIC ALGORITHM USING MATLAB

- Computer Science
- 2018

Genetic algorithm the energy of Genetic Algorithm for advancement is investigated by utilizing MATLAB in view of usage of Rastrigin's capacity to clarify some key meanings of genetic change like determination Optimal fitness, mutation, sore, selection. Expand

Scheduling on a Flexible Job Shop with Setup Operation in IT Manufacturing Fabrication

- Computer Science
- 2016

Objectives: We consider the scheduling problem in which the separate sequence dependent setup is considered even though a job to be processed is not arrived. Methods/Statistical Analysis: In a… Expand

A Survey of Performance Analysis Tools for OpenMP and MPI

- Computer Science
- 2016

This study shows that MPI offers the best performance characteristics in the field of shared memory programming whereas OpenMP is a better choice because of the global style of the resulting program. Expand

Accelerating Motif Finding Problem Using Skip Brute-Force on CPUs and GPU ’ s Architectures

- 2017

Motif Finding Problem (MFP) aims to discover unknown motifs that are expected to be common in a set of sequences. MFP is considered as one of the most computationally intensive problems in the field… Expand

Mathematical Modelling on Avoidance-to- Acceptance Transition in Leaf Cutting Ant Colonies

- Computer Science
- 2016

The system has capacity of the ant colony to exhibit transitions from one collective decision and colony memory to the next and the colony of leaf-cutting ants can switch from avoidance to acceptance of leaves which had been deemed unsuitable due to the presence of unwarranted chemical compounds. Expand

International Journal of Scientific Research in Computer Science, Engineering and Information Technology

- 2017

This work is to present a new method based on the radically different approach of learning the 2D-to-3D conversion from examples. It is based on locally estimating the entire depth map of query image… Expand

#### References

SHOWING 1-10 OF 17 REFERENCES

Application of multi-core parallel ant colony optimization in target assignment problem

- Computer Science
- 2010 International Conference on Computer Application and System Modeling (ICCASM 2010)
- 2010

A new parallel ant colony optimization (PACO) algorithm is proposed, which applies two kinds of typical multi-core computing technologies, the well-known OpenMP and the recently introduced TBB (Threading Building Blocks) library by Intel Corporation, to solve target assignment problem (TAP). Expand

The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances

- Computer Science
- 2003

The field of ACO algorithms is very lively, as testified, for example, by the successful biannual workshop (ANTS—From Ant Colonies to Artificial Ants: A Series of International Workshops on Ant… Expand

Ant Algorithms for Discrete Optimization

- Computer Science, Medicine
- Artificial Life
- 1999

An overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and the ant colony optimization (ACO) metaheuristic is presented. Expand

Ant colonies for the traveling salesman problem

- 1997

We describe an artificial ant colony capable of solving the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using… Expand

Improvements on the Ant-System: Introducing the MAX-MIN Ant System

- Computer Science
- ICANNGA
- 1997

This paper describes in detail the improvements on Ant system, discusses the addition of local search to MMAS, and reports on the computational results, showing that the system also improves over other variations of Ant system. Expand

Ant system: optimization by a colony of cooperating agents

- Computer Science, Medicine
- IEEE Trans. Syst. Man Cybern. Part B
- 1996

It is shown how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling, and the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS. Expand

Genetic Algorithms in Search Optimization and Machine Learning

- Computer Science
- 1988

This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields. Expand

AntNet: Distributed Stigmergetic Control for Communications Networks

- Computer Science
- J. Artif. Intell. Res.
- 1998

AntNet is a distributed, mobile agents based Monte Carlo system that was inspired by recent work on the ant colony metaphor for solving optimization problems, and showed superior performance under all the experimental conditions with respect to its competitors. Expand

Ant colony optimization

- Computer Science, Mathematics
- GECCO '10
- 2004

A forage harvester includes four multiple-bladed rotary cutting segments positioned near a shearbar, each including a permanent magnet and a sensing coil to monitor only selected one or ones of the cutting segments. Expand