Explore the vast range of titles available.

Purpose This study aims to provide an assessment of the existing literature on the role of social media advertising in hospitality, tourism and travel (HTT) as well as an agenda for future research. Design/methodology/approach Covering a 15-year time span (2004–2019), this study is focused on journal papers archived in two academic databases in social sciences: Business Source Complete and Communication and Mass Media Complete. Each of the 192 papers collected was coded for 8 major variables: journal, year of publication, research topic, country studied, type of social media investigated, method, theoretical underpinning and key findings. Findings Three major topic areas are identified in this study: use of social media from consumer’s perspective, use of social media from organization’s perspective and effects of social media. Research limitations/implications Although a few prior papers have provided a literature review of social media in tourism and hospitality, no review-based papers have ever examined social media as an advertising vehicle in the context of HTT. Most reviews to date have been limited to general social media studies, without much advancement of theory building in advertising research. Originality/value To the best of the authors’ knowledge, this paper represents the first theoretical review of academic research on social media advertising in HTT. The review concludes by suggesting a theoretical framework for studying social media advertising in HTT and offering an agenda for future research.

The Phasmatodea Population Evolution (PPE) algorithm, inspired by the evolution of the phasmatodea population, is a recently proposed meta-heuristic algorithm that has been applied to solve problems in engineering. Chaos theory has been increasingly applied to enhance the performance and convergence of meta-heuristic algorithms. In this paper, we introduce chaotic mapping into the PPE algorithm to propose a new algorithm, the Chaotic-based Phasmatodea Population Evolution (CPPE) algorithm. The chaotic map replaces the initialization population of the original PPE algorithm to enhance performance and convergence. We evaluate the effectiveness of the CPPE algorithm by testing it on 28 benchmark functions, using 12 different chaotic maps. The results demonstrate that CPPE outperforms PPE in terms of both performance and convergence speed. In the performance analysis, we found that the CPPE algorithm with the Tent map showed improvements of 8.9647%, 10.4633%, and 14.6716%, respectively, in the Final, Mean, and Standard metrics, compared to the original PPE algorithm. In terms of convergence, the CPPE algorithm with the Singer map showed an improvement of 65.1776% in the average change rate of fitness value, compared to the original PPE algorithm. Finally, we applied our CPPE to stock prediction. The results showed that the predicted curve was relatively consistent with the real curve.

Cat swarm optimization (CSO) has been applied to a variety of fields because of the better capacity of searching for optimum and higher robustness. However, the poor convergency and larger memory consumption are still core defects, which restricts the efficiency of optimization to a larger extent. A new heuristic algorithm named Parallel Compact Cat Swarm Optimization (PCCSO) with three separate communication strategies and the concept of the compact are presented in this article. The advantage of PCCSO is not only reflected in enhancing the ability of local search, but also in saving the computer memory. The experimental results on CEC2013 benchmark functions demonstrate that the PCCSO is always superior to PSO, CSO, and improved CSO in getting convergent. Then, the PCCSO is applied to DV-Hop to effectively improve the localization accuracy of unknown nodes while also saving WSN memory. The experimental results based on PCCSO from the different number of sensor nodes also illustrate that the PCCSO-DV-Hop shows a lower localization error compared to other optimization algorithms based on DV-Hop.

The pressure sensor placement in the water distribution networks (WDNs) is a typical NP‐Hard problem. The goal is to monitor the running state of the whole network area by placing a small number of pressure sensors. This letter proposes an enhanced Rafflesia optimization algorithm (EROA) to solve this problem. The simulation results show that compared with the original ROA algorithm and the traditional intelligent optimization algorithms, the proposed EROA algorithm exhibits superior optimization capabilities and solution efficiency, and can provide a more reasonable sensor placement scheme. The first attempt is to apply the Rafflesia optimization algorithm and its variant to the problem of pressure sensor placement in the WDN. The enhanced ROA algorithm (EROA) is proposed to improve the problems existing in the original ROA algorithm. The performance of the EROA algorithm is better than the original ROA algorithm, the traditional GA, DE, and PSO algorithms in solving the problem of pressure sensor placement.

Multi-level thresholding for image segmentation is one of the key techniques in image processing. Although numerous methods have been introduced, it remains challenging to achieve stable and satisfactory thresholds when segmenting images with various unknown properties. This paper proposes an equilibrium optimizer algorithm to find the optimal multi-level thresholds for grayscale images. The proposed algorithm AEO (advanced equilibrium optimizer) uses two sub-populations to balance exploration and exploitation during the multi-level threshold search process. Two mutation schemes are proposed for the sub-populations to prevent them from being trapped in local optima. AEO offers a repair function to avoid generating duplicate thresholds. The performance of AEO is evaluated on multiple benchmark images. Experimental results demonstrate that AEO has an outstanding ability for multi-level threshold image segmentation in terms of cross-entropy, signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), and feature similarity index (FSIM).

Wireless sensor network (WSN) has been paid more attention by scholars due to the practical communication of a system of devices to transfer information gathered from a monitored field through wireless links. Precise and accurate data of aggregating messages from sensor nodes is a vital demand for a success WSN application. This paper proposes a new scheme of identifying the correctness data scheme for aggregating data in cluster heads in hierarchical WSN based on naive Bayes classification. The collecting environmental information includes temperature, humidity, sound, and pollution levels, from sensor nodes to cluster heads that classify data fault and aggregate and transfer them to the base station. The collecting data is classified based on the classifier to aggregate in the cluster head of WSN. Compared with some existing methods, the proposed method offers an effective way of forwarding the correct data in WSN applications.

The localization problem of nodes in wireless sensor networks is often the focus of many researches. This paper proposes an opposition-based learning and parallel strategies Artificial Gorilla Troop Optimizer (OPGTO) for reducing the localization error. Opposition-based learning can expand the exploration space of the algorithm and significantly improve the global exploration ability of the algorithm. The parallel strategy divides the population into multiple groups for exploration, which effectively increases the diversity of the population. Based on this parallel strategy, we design communication strategies between groups for different types of optimization problems. To verify the optimized effect of the proposed OPGTO algorithm, it is tested on the CEC2013 benchmark function set and compared with Particle Swarm Optimization (PSO), Sine Cosine Algorithm (SCA), Whale Optimization Algorithm (WOA) and Artificial Gorilla Troops Optimizer (GTO). Experimental studies show that OPGTO has good optimization ability, especially on complex multimodal functions and combinatorial functions. Finally, we apply OPGTO algorithm to 3D localization of wireless sensor networks in the real terrain. Experimental results proved that OPGTO can effectively reduce the localization error based on Time Difference of Arrival (TDOA).

Wireless sensor network (WSN) can effectively help us monitor the surrounding environment and prevent the occurrence of some natural disasters earlier, but we can only get the information of the surrounding environment correctly if we know the locations of nodes. How to know the exact positions of nodes is a strict challenge in WSN. Intelligent computing algorithms have been developed in recent years. They easily solve complex optimization problems, especially for those that cannot be modeled mathematically. This paper proposes a novel algorithm, named parallel whale optimization algorithm (PWOA). It contains two information exchange strategies between groups, and it significantly enhances global search ability and population diversity of the original whale optimization algorithm (WOA). Also, the algorithm is adopted to optimize the localization of WSN. Twenty-three mathematical optimization functions are accustomed to verifying the efficiency and effectiveness of the novel approach. Compared with some existing intelligent computing algorithms, the proposed PWOA may reach better results.

The unmanned aerial vehicle (UAV) path planning problem is primarily concerned with avoiding collision with obstacles while determining the best flight path to the target position. This paper first establishes a cost function to transform the UAV route planning issue into an optimization issue that meets the UAV’s feasible path requirements and path safety constraints. Then, this paper introduces a modified Mayfly Algorithm (modMA), which employs an exponent decreasing inertia weight (EDIW) strategy, adaptive Cauchy mutation, and an enhanced crossover operator to effectively search the UAV configuration space and discover the path with the lowest overall cost. Finally, the proposed modMA is evaluated on 26 benchmark functions as well as the UAV route planning problem, and the results demonstrate that it outperforms the other compared algorithms.

The Pigeon-Inspired Optimization (PIO) algorithm is an intelligent algorithm inspired by the behavior of pigeons returned to the nest. The binary pigeon-inspired optimization (BPIO) algorithm is a binary version of the PIO algorithm, it can be used to optimize binary application problems. The transfer function plays a very important part in the BPIO algorithm. To improve the solution quality of the BPIO algorithm, this paper proposes four new transfer function, an improved speed update scheme, and a second-stage position update method. The original BPIO algorithm is easier to fall into the local optimal, so a new speed update equation is proposed. In the simulation experiment, the improved BPIO is compared with binary particle swarm optimization (BPSO) and binary grey wolf optimizer (BGWO). In addition, the benchmark test function, statistical analysis, Friedman’s test and Wilcoxon rank-sum test are used to prove that the improved algorithm is quite effective, and it also verifies how to set the speed of dynamic movement. Finally, feature selection was successfully implemented in the UCI data set, and higher classification results were obtained with fewer feature numbers.