Parallelization of Ant System for GPU under the PRAM Model

2018 ◽  
Vol 37 (1) ◽  
pp. 229-243 ◽  
Author(s):  
Andrej Brodnik ◽  
Marko Grgurovič
Keyword(s):  
Ant System ◽  
Pram Model

Identifying Measurement Invariant Item Sets in Cross-Cultural Settings Using an Automated Item Selection Procedure

Methodology ◽  
2018 ◽  
Vol 14 (4) ◽  
pp. 177-188 ◽  
Author(s):  
Martin Schultze ◽  
Michael Eid
Keyword(s):  
Measurement Invariance ◽  
Optimal Solution ◽  
Selection Procedure ◽  
Cross Cultural ◽  
Item Selection ◽  
Ant System ◽  
Item Quality ◽  
Ant System Algorithm ◽  
Selection For ◽  
Selection Of

Abstract. In the construction of scales intended for the use in cross-cultural studies, the selection of items needs to be guided not only by traditional criteria of item quality, but has to take information about the measurement invariance of the scale into account. We present an approach to automated item selection which depicts the process as a combinatorial optimization problem and aims at finding a scale which fulfils predefined target criteria – such as measurement invariance across cultures. The search for an optimal solution is performed using an adaptation of the [Formula: see text] Ant System algorithm. The approach is illustrated using an application to item selection for a personality scale assuming measurement invariance across multiple countries.

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

scholarly journals Improvement of Traveling Salesman Problem Solution Using Hybrid Algorithm Based on Best-Worst Ant System and Particle Swarm Optimization

2021 ◽  
Vol 11 (11) ◽  
pp. 4780
Author(s):  
Muhammad Salman Qamar ◽  
Shanshan Tu ◽  
Farman Ali ◽  
Ammar Armghan ◽  
Muhammad Fahad Munir ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Traveling Salesman Problem ◽  
Particle Swarm ◽  
Standard Test ◽  
Traveling Salesman ◽  
Problem Solution ◽  
Ant System ◽  
Swarm Optimization ◽  
Hybrid Particle Swarm Optimization ◽  
Novel Approach

This work presents a novel Best-Worst Ant System (BWAS) based algorithm to settle the Traveling Salesman Problem (TSP). The researchers has been involved in ordinary Ant Colony Optimization (ACO) technique for TSP due to its versatile and easily adaptable nature. However, additional potential improvement in the arrangement way decrease is yet possible in this approach. In this paper BWAS based incorporated arrangement as a high level type of ACO to upgrade the exhibition of the TSP arrangement is proposed. In addition, a novel approach, based on hybrid Particle Swarm Optimization (PSO) and ACO (BWAS) has also been introduced in this work. The presentation measurements of arrangement quality and assembly time have been utilized in this work and proposed algorithm is tried against various standard test sets to examine the upgrade in search capacity. The outcomes for TSP arrangement show that initial trail setup for the best particle can result in shortening the accumulated process of the optimization by a considerable amount. The exhibition of the mathematical test shows the viability of the proposed calculation over regular ACO and PSO-ACO based strategies.

A time-based pheromone approach for the ant system

2012 ◽  
Vol 6 (6) ◽  
pp. 1081-1099 ◽  
Author(s):  
U. Mahir Yildirim ◽  
Bülent Çatay
Keyword(s):  
Ant System

An ant system with steps counter for the job shop scheduling problem

2007 ◽  
Author(s):  
Emanuel Tellez-Enriquez ◽  
Efren Mezura-Montes ◽  
Carlos A. Coello Coello
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Ant System ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document