A Multiscale Bridging Material Parameter and Damage Inversion Algorithm from Macroscale to Mesoscale Based on Ant Colony Optimization

2022 ◽  
Vol 148 (2) ◽  
Author(s):  
Bin Sun ◽  
Xiaojiang Liu ◽  
Zhao-Dong Xu
Keyword(s):  
Ant Colony Optimization ◽  
Material Parameter ◽  
Ant Colony ◽  
Inversion Algorithm

Parallel Ant Colony Optimization on the University Course-Faculty Timetabling Problem in MSU-IIT

2012 ◽  
Author(s):  
Earth B. Ugat ◽  
Jennifer Joyce M. Montemayor ◽  
Mark Anthony N. Manlimos ◽  
Dante D. Dinawanao
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony ◽  
Timetabling Problem ◽  
University Course ◽  
The University

Achievement of Cost-Effective Datasets Transference in The Cloud Through Ant Colony Optimization

2012 ◽  
Vol 3 (3) ◽  
pp. 122-125
Author(s):  
THAHASSIN C THAHASSIN C ◽  
◽  
A. GEETHA A. GEETHA ◽  
RASEEK C RASEEK C
Keyword(s):  
Ant Colony Optimization ◽  
Cost Effective ◽  
Ant Colony

The Map-Based Shortest Route Selection by Using Ant Colony Optimization Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 15
Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Google Earth ◽  
Ant Colony ◽  
Food Sources ◽  
Shortest Route ◽  
Study Results ◽  
Destination Point

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.

Modeling and optimizing logistics, information, economic and financial intercluster cooperation using the ant colony optimization algorithm

2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Population Decline ◽  
Innovation System ◽  
Federal District ◽  
Original Model ◽  
Ant Colony ◽  
Industrial Agglomeration ◽  
Ant Colony Optimization Algorithm

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.

Implementasi Algoritma MAX-MIN Ant System pada Penjadwalan Mata Kuliah

2013 ◽  
Vol 5 (2) ◽  
pp. 48-53
Author(s):  
William Aprilius ◽  
Lorentzo Augustino ◽  
Ong Yeremia M. H.
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony ◽  
Ant System ◽  
University Course Timetabling ◽  
Alternative Approach ◽  
Ant System Algorithm ◽  
Index Terms ◽  
Course Timetabling Problem ◽  
University Course ◽  
Selection Of

University Course Timetabling Problem is a problem faced by every university, one of which is Universitas Multimedia Nusantara. Timetabling process is done by allocating time and space so that the whole associated class and course can be implemented. In this paper, the problem will be solved by using MAX-MIN Ant System Algorithm. This algorithm is an alternative approach to ant colony optimization. This algorithm uses two tables of pheromones as stigmergy, i.e. timeslot pheromone table and room pheromone table. In addition, the selection of timeslot and room is done by using the standard deviation of the value of pheromones. Testing is carried out by using 105 events, 45 timeslots, and 3 types of categories based on the number of rooms provided, i.e. large, medium, and small. In each category, testing is performed 5 times and for each testing, the data recorded is the unplace and Soft Constraint Penalty. In general, the greater the number of rooms, the smaller the unplace. Index Terms—ant colony optimization, max-min ant system, timetabling

Sign in / Sign up

Export Citation Format

Share Document