Quantum-Inspired Automatic Clustering Technique Using Ant Colony Optimization Algorithm

Author(s):  
Sandip Dey ◽  
Siddhartha Bhattacharyya ◽  
Ujjwal Maulik

Quantum computing has emerged as the most challenging field of research in efficient computation. This chapter introduces a novel quantum-inspired ant colony optimization technique for automatic clustering. This chapter presents an application of this proposed technique to the automatic clustering of real-life gray-scale image data sets. In contrary to the other techniques, the proposed one requires no previous knowledge of the data to be classified. It finds the optimal number of clusters of the data by itself. The Xie-Beni cluster validity measure has been employed as the objective function for clustering purpose. Effectiveness of the proposed technique is exhibited on four real-life gray-scale images. Superiority of the proposed technique is established over its counterpart with respect to various aspects, which include accuracy, stability, computational time and standard errors. Finally, a statistical supremacy test, called unpaired two-tailed t-test, is conducted between them. It shows that superiority in favor of the proposed technique is established.

2020 ◽  
Vol 1 (1) ◽  
pp. 1-10
Author(s):  
Nisreen L. Ahmed

Swarm intelligence is a relatively new approach to problem solving that takes inspiration from the social behaviors of insects and other animals. Ants, in particular, have inspired a number of methods and techniques among which the most studied and successful is the general-purpose optimization technique, also known as ant colony optimization, In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs.  Ant Colony Optimization (ACO) algorithm is used to arrive at the best solution for TSP. In this article, the researcher has introduced ways to use a great deluge algorithm with the ACO algorithm to increase the ability of the ACO in finding the best tour (optimal tour). Results are given for different TSP problems by using ACO with great deluge and other local search algorithms.


2018 ◽  
Vol 6 (3) ◽  
pp. 368-386 ◽  
Author(s):  
Sudipta Chowdhury ◽  
Mohammad Marufuzzaman ◽  
Huseyin Tunc ◽  
Linkan Bian ◽  
William Bullington

Abstract This study presents a novel Ant Colony Optimization (ACO) framework to solve a dynamic traveling salesman problem. To maintain diversity via transferring knowledge to the pheromone trails from previous environments, Adaptive Large Neighborhood Search (ALNS) based immigrant schemes have been developed and compared with existing ACO-based immigrant schemes available in the literature. Numerical results indicate that the proposed immigrant schemes can handle dynamic environments efficiently compared to other immigrant-based ACOs. Finally, a real life case study for wildlife surveillance (specifically, deer) by drones has been developed and solved using the proposed algorithm. Results indicate that the drone service capabilities can be significantly impacted when the dynamicity of deer are taken into consideration. Highlights Proposed a novel ACO-ALNS based metaheuristic. Four variants of the proposed metaheuristic is developed to investigate the efficiency of each of them. A real life case study mirroring the behavior of DTSP is developed.


2010 ◽  
Vol 30 (2) ◽  
pp. 486-514 ◽  
Author(s):  
Jodelson A. Sabino ◽  
José Eugênio Leal ◽  
Thomas Stützle ◽  
Mauro Birattari

This paper proposes an ant colony optimization algorithm to assist railroad yard operational planning staff in their daily tasks. The proposed algorithm tries to minimize a multi-objective function that considers both fixed and variable transportation costs involved in moving railroad cars within the railroad yard area. This is accomplished by searching the best switch engine schedule for a given time horizon. As the algorithm was designed for real life application, the solution must be delivered in a predefined processing time and it must be in accordance with railroad yard operational policies. A railroad yard operations simulator was built to produce artificial instances in order to tune the parameters of the algorithm. The project is being developed together with industrial professionals from the Tubarão Railroad Terminal, which is the largest railroad yard in Latin America.


2013 ◽  
Vol 321-324 ◽  
pp. 2116-2121
Author(s):  
Ji Ung Sun

This paper deals with a real-life two machine scheduling problem for the side frame press shop in a truck manufacturing company. The shop consists of two machines where only the first machine, press machine, has separable, external and sequence dependent setup times. Moreover all the jobs require processing by the press machine more than once in their operation sequences with re-entrant work flows. Redefining the job elements, the problem is transformed into a general two machine flow shop problem which has a set of job-element precedence constraints. To solve the problem, an ant colony optimization (ACO) algorithm with the objective of the minimum makespan is developed. We investigate performance of the proposed ACO algorithm through the comparative study. Experiment results show that the proposed algorithm is more effective than existing method for the problem.


2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov

Subject. This article discusses the issues related to the creation of a technology of modeling and optimization of economic, financial, information, and logistics cluster-cluster cooperation within a federal district. Objectives. The article aims to propose a model for determining the optimal center of industrial agglomeration for innovation and industry clusters located in a federal district. Methods. For the study, we used the ant colony optimization algorithm. Results. The article proposes an original model of cluster-cluster cooperation, showing the best version of industrial agglomeration, the cities of Samara, Ulyanovsk, and Dimitrovgrad, for the Volga Federal District as a case study. Conclusions. If the industrial agglomeration center is located in these three cities, the cutting of the overall transportation costs and natural population decline in the Volga Federal District will make it possible to qualitatively improve the foresight of evolution of the large innovation system of the district under study.


2019 ◽  
Vol 9 (2) ◽  
pp. 79-85
Author(s):  
Indah Noviasari ◽  
Andre Rusli ◽  
Seng Hansun

Students and scheduling are both essential parts in a higher educational institution. However, after schedules are arranged and students has agreed to them, there are some occasions that can occur beyond the control of the university or lecturer which require the courses to be cancelled and arranged for replacement course schedules. At Universitas Multimedia Nusantara, an agreement between lecturers and students manually every time to establish a replacement course. The agreement consists of a replacement date and time that will be registered to the division of BAAK UMN which then enter the new schedule to the system. In this study, Ant Colony Optimization algorithm is implemented for scheduling replacement courses to make it easier and less time consuming. The Ant Colony Optimization (ACO) algorithm is chosen because it is proven to be effective when implemented to many scheduling problems. Result shows that ACO could enhance the scheduling system in Universitas Multimedia Nusantara, which specifically tested on the Department of Informatics replacement course scheduling system. Furthermore, the newly built system has also been tested by several lecturers of Informatics UMN with a good level of perceived usefulness and perceived ease of use. Keywords—scheduling system, replacement course, Universitas Multimedia Nusantara, Ant Colony Optimization


Sign in / Sign up

Export Citation Format

Share Document