scholarly journals The surgical case scheduling problem with fuzzy duration time: An ant system algorithm

2018 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Reza Behmanesh ◽  
Mostafa Zandieh ◽  
Seyyed Mohammad Hadji Molana
Keyword(s):  
Scheduling Problem ◽  
Ant System ◽  
Surgical Case ◽  
Duration Time ◽  
Ant System Algorithm

A Max–Min Ant System algorithm to solve the Software Project Scheduling Problem

2014 ◽  
Vol 41 (15) ◽  
pp. 6634-6645 ◽  
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Franklin Johnson ◽  
Eric Monfroy ◽  
Fernando Paredes
Keyword(s):  
Project Scheduling ◽  
Software Project ◽  
Scheduling Problem ◽  
Ant System ◽  
Project Scheduling Problem ◽  
Ant System Algorithm

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

An Ant System Algorithm for the Neutralization Problem

2013 ◽  
pp. 53-61 ◽  
Author(s):  
Ramazan Algin ◽  
Ali Fuat Alkaya ◽  
Vural Aksakalli ◽  
Dindar Öz
Keyword(s):  
Ant System ◽  
Ant System Algorithm
Sign in / Sign up

Export Citation Format

Share Document