Investigating users ' affective load in collaborative search

2019 ◽  
Vol 56 (1) ◽  
pp. 427-431
Author(s):  
Kun Huang ◽  
Xin Yuan ◽  
Lei Li ◽  
Edwin Mouda Ye
Keyword(s):  
2021 ◽  
pp. 1-18
Author(s):  
Baohua Zhao ◽  
Tien-Wen Sung ◽  
Xin Zhang

The artificial bee colony (ABC) algorithm is one of the classical bioinspired swarm-based intelligence algorithms that has strong search ability, because of its special search mechanism, but its development ability is slightly insufficient and its convergence speed is slow. In view of its weak development ability and slow convergence speed, this paper proposes the QABC algorithm in which a new search equation is based on the idea of quasi-affine transformation, which greatly improves the cooperative ability between particles and enhances its exploitability. During the process of location updating, the convergence speed is accelerated by updating multiple dimensions instead of one dimension. Finally, in the overall search framework, a collaborative search matrix is introduced to update the position of particles. The collaborative search matrix is transformed from the lower triangular matrix, which not only ensures the randomness of the search, but also ensures its balance and integrity. To evaluate the performance of the QABC algorithm, CEC2013 test set and CEC2014 test set are used in the experiment. After comparing with the conventional ABC algorithm and some famous ABC variants, QABC algorithm is proved to be superior in efficiency, development ability, and robustness.


2019 ◽  
Vol 43 (3) ◽  
pp. 369-386 ◽  
Author(s):  
Abu Shamim Mohammad Arif ◽  
Jia Tina Du

Purpose Collaborative information searching is common for people when planning their group trip. However, little research has explored how tourists collaborate during information search. Existing tourism Web portals or search engines rarely support tourists’ collaborative information search activities. Taking advantage of previous studies of collaborative tourism information search behavior, in the current paper the purpose of this paper is to propose the design of a collaborative search system collaborative tourism information search (ColTIS) to support online information search and travel planning. Design/methodology/approach ColTIS was evaluated and compared with Google Talk-embedded Tripadvisor.com through a user study involving 18 pairs of participants. The data included pre- and post-search questionnaires, web search logs and chat history. For quantitative measurement, statistical analysis was performed using SPSS; for log data and the qualitative feedback from participants, the content analysis was employed. Findings Results suggest that collaborative query formulation, division of search tasks, chatting and results sharing are important means to facilitate tourists’ collaborative search. ColTIS was found to outperform Tripadvisor significantly regarding the ease of use, collaborative support and system usefulness. Originality/value The innovation of the study lies in the development of an integrated real-time collaborative tourism information search system with unique features. These features include collaborative query reformulation, travel planner and automatic result and query sharing that assist multiple people search for holiday information together. For system designers and tourism practitioners, implications are provided.


Author(s):  
M Vasile ◽  
F Zuiani

This article presents an algorithm for multi-objective optimization that blends together a number of heuristics. A population of agents combines heuristics that aim at exploring the search space both globally and in a neighbourhood of each agent. These heuristics are complemented with a combination of a local and global archive. The novel agent-based algorithm is tested at first on a set of standard problems and then on three specific problems in space trajectory design. Its performance is compared against a number of state-of-the-art multi-objective optimization algorithms that use the Pareto dominance as selection criterion: non-dominated sorting genetic algorithm (NSGA-II), Pareto archived evolution strategy (PAES), multiple objective particle swarm optimization (MOPSO), and multiple trajectory search (MTS). The results demonstrate that the agent-based search can identify parts of the Pareto set that the other algorithms were not able to capture. Furthermore, convergence is statistically better although the variance of the results is in some cases higher.


Sign in / Sign up

Export Citation Format

Share Document