scholarly journals Multicriteria-Based Crowd Selection Using Ant Colony Optimization

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Guan Wang ◽  
Farhad Ali ◽  
Jonghoon Yang ◽  
Shah Nazir ◽  
Ting Yang ◽  
...  

Internet-enabled technologies have provided a way for people to communicate and collaborate with each other. The collaboration and communication made crowdsourcing an efficient and effective activity. Crowdsourcing is a modern paradigm that employs cheap labors (crowd) for accomplishing different types of tasks. The task is usually posted online as an open call, and members of the crowd self-select a task to be carried out. Crowdsourcing involves initiators or crowdsourcers (an entity usually a person or an organization who initiate the crowdsourcing process and seek out the ability of crowd for a task), the crowd (online participant who is a having a particular background, qualification, and experience for accomplishing task in crowdsourcing activity), crowdsourcing task (the activity in which the crowd contribute), the process (how the activity is carried out), and the crowdsourcing platform (software or market place) where requesters offer various tasks and crowd workers complete these tasks. As the crowdsourcing is carried out in the online environment, it gives rise to certain challenges. The major problem is the selection of crowd that is becoming a challenging issue with the growth in crowdsourcing popularity. Crowd selection has been significantly investigated in crowdsourcing processes. Nonetheless, it has observed that the selection is based only on a single feature of the crowd worker which was not sufficient for appropriate crowd selection. For addressing the problem of crowd selection, a novel “ant colony optimization-based crowd selection method” (ACO-CS) is presented in this paper that selects a crowd worker based on multicriteria features. By utilizing the proposed model, the efficiency and effectiveness of crowdsourcing activity will be increased.

2013 ◽  
Vol 5 (2) ◽  
pp. 48-53
Author(s):  
William Aprilius ◽  
Lorentzo Augustino ◽  
Ong Yeremia M. H.

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


2013 ◽  
Vol 43 (2) ◽  
pp. 790-802 ◽  
Author(s):  
Meie Shen ◽  
Wei-Neng Chen ◽  
Jun Zhang ◽  
Henry Shu-Hung Chung ◽  
O. Kaynak

2020 ◽  
Vol 19 (2) ◽  
pp. 108-112
Author(s):  
D. N. Shvaiba

Correctness of the trend selection for predicting characteristics of socio-economic security statistics can be qualified with the help of a mean square error value and an aspect of “Ascending” and “Descending” series (although there are other aspects, for example, the aspects based on the median of a sample). According to the proposed model, it is possible to predetermine average monitoring errors for development of lower and upper limits of the forecast version in respect of values for characteristics of socio-economic security statistics. Model creation is a labor-intensive process, so that when predicting  characteristics of socio-economic security statistics, it is advisable to use, as a rule, a deterministic component of trend models. At the same time, an assumption about random nature of deviations in empirical values of time series from a trend for 5 %  significance  value is not  rejected.  Study of  the material allows us to admit that it is impossible  to  note exact cycles in time series of values for characteristics of  socio-economic  security  statistics.  However,  this does not represent a basis for the conclusion about presence of cycles in time series of values for characteristics of socio-economic security statistics because these cycles do not coincide in time, there is no clear priority in exceedance of actual values for characteristics of socio-economic security statistics over the calculated ones obtained with the help of models, or, on the contrary, exceedance of the calculated values over the actual ones. Various approaches can be used to calculate a magnitude of the forecast error. Thus, a question pertaining to selection of trend models for an analysis of socio-economic security is natural due to difference in reliability of data when using different models, and correctness of the selection will improve an efficiency of the analysis. So the study acquires practical significance for economic entities and entire industries


2005 ◽  
Vol 11 (3) ◽  
pp. 269-291 ◽  
Author(s):  
James Montgomery ◽  
Marcus Randall ◽  
Tim Hendtlass

Ant colony optimization (ACO) is a constructive metaheuristic that uses an analogue of ant trail pheromones to learn about good features of solutions. Critically, the pheromone representation for a particular problem is usually chosen intuitively rather than by following any systematic process. In some representations, distinct solutions appear multiple times, increasing the effective size of the search space and potentially misleading ants as to the true learned value of those solutions. In this article, we present a novel system for automatically generating appropriate pheromone representations, based on the characteristics of the problem model that ensures unique pheromone representation of solutions. This is the first stage in the development of a generalized ACO system that could be applied to a wide range of problems with little or no modification. However, the system we propose may be used in the development of any problem-specific ACO algorithm.


Sign in / Sign up

Export Citation Format

Share Document