Tourism Demand Interval Forecasting Amid COVID-19: A Hybrid Model With a Modified Multi-Objective Optimization Algorithm
Ontology highlight
ABSTRACT:
SUBMITTER: Wang J
PROVIDER: S-EPMC9841211 | biostudies-literature | 2023 Jan
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:This work considers the Bi-objective Traveling Salesman Problem (BTSP), where two conflicting objectives, the travel time and monetary cost between cities, are minimized. Our purpose is to compute the trade-off solutions that fulfill the problem requirements. We introduce a novel three-Phase Hybrid Evolutionary Algorithm (3PHEA) based on the Lin-Kernighan Heuristic, an improved version of the Non-Dominated Sorting Genetic Algorithm, and Pareto Variable Neighborhood Search, a multi-objective version of VNS. We conduct a comparative study with three existing approaches dedicated to solving BTSP. To assess the performance of algorithms, we consider 20 BTSP instances from the literature of varying degrees of difficulty (e.g., euclidean, random, mixed, etc.) and different sizes ranging from 100 to 1000 cities. We also compute several multi-objective performance indicators, including running time, coverage, hypervolume, epsilon, generational distance, inverted generational distance, spread, and generalized spread. Experimental results and comparative analysis indicate that the proposed three-phase method 3PHEA is significantly superior to existing approaches covering up to 80% of the true Pareto fronts.
| S-EPMC10017715 | biostudies-literature
Project description:A microarray is a revolutionary tool that generates vast volumes of data that describe the expression profiles of genes under investigation that can be qualified as Big Data. Hadoop and Spark are efficient frameworks, developed to store and analyze Big Data. Analyzing microarray data helps researchers to identify correlated genes. Clustering has been successfully applied to analyze microarray data by grouping genes with similar expression profiles into clusters. The complex nature of microarray data obligated clustering methods to employ multiple evaluation functions to ensure obtaining solutions with high quality. This transformed the clustering problem into a Multi-Objective Problem (MOP). A new and efficient hybrid Multi-Objective Whale Optimization Algorithm with Tabu Search (MOWOATS) was proposed to solve MOPs. In this article, MOWOATS is proposed to analyze massive microarray datasets. Three evaluation functions have been developed to ensure an effective assessment of solutions. MOWOATS has been adapted to run in parallel using Spark over Hadoop computing clusters. The quality of the generated solutions was evaluated based on different indices, such as Silhouette and Davies-Bouldin indices. The obtained clusters were very similar to the original classes. Regarding the scalability, the running time was inversely proportional to the number of computing nodes.
| S-EPMC8022636 | biostudies-literature
Project description:A new software tool making use of a genetic algorithm for multi-objective experimental optimization (GAME.opt) was developed based on a strength Pareto evolutionary algorithm. The software deals with high dimensional variable spaces and unknown interactions of design variables. This approach was evaluated by means of multi-objective test problems replacing the experimental results. A default parameter setting is proposed enabling users without expert knowledge to minimize the experimental effort (small population sizes and few generations).
| S-EPMC1705497 | biostudies-other
Project description:With the introduction of various loads and dispersed production units to the system in recent years, the significance of precise forecasting for short, long, and medium loads have already been recognized. It is important to analyze the power system's performance in real-time and the appropriate response to changes in the electric load to make the best use of energy systems. Electric load forecasting for a long period in the time domain enables energy producers to increase grid stability, reduce equipment failures and production unit outages, and guarantee the dependability of electricity output. In this study, SqueezeNet is first used to obtain the required power demand forecast at the user end. The structure of the SqueezeNet is then enhanced using a customized version of the Sewing Training-Based Optimizer. A comparison between the results of the suggested method and those of some other published techniques is then implemented after the method has been applied to a typical case study with three different types of demands-short, long, and medium-term. A time window has been set up to collect the objective and input data from the customer at intervals of 20 min, allowing for highly effective neural network training. The results showed that the proposed method with 0.48, 0.49, and 0.53 MSE for Forecasting the short-term, medium-term, and long-term electricity provided the best results with the highest accuracy. The outcomes show that employing the suggested technique is a viable option for energy consumption forecasting.
| S-EPMC10360951 | biostudies-literature
Project description:Effective tourist demand forecasting is crucial for company operations and destination management. Furthermore, tourists may plan better personalized multi-attraction itineraries based on demand forecasting to avoid travel peaks and improve the enjoyment of their vacation. This study developed a unique deep learning model called the convolution block attention module (CBAM) that is built on convolutional blocks and attention modules to estimate tourism demand precisely. Then, the passenger flow grid map was extracted from mobile phone signaling data. To forecast the subsequent period of the passenger flow grid map, the CBAM model uses the multi-channel spatial-temporal grid graph that is built by multiple successive passenger flow grid maps. Finally, the forecasted passenger flow grid map was used to derive the tourist demand for multi-attractions for the next period. The analysis of mobile phone signaling data from Beijing and Xiamen using the proposed model reveals that its mean absolute percentage error (MAPE) is 8.11%, which is lower than other benchmark deep learning models. Supplementary Information The online version contains supplementary material available at 10.1007/s40558-023-00247-y.
| S-EPMC10075180 | biostudies-literature
Project description:Flexible manufacturing system (FMS) enhances the firm's flexibility and responsiveness to the ever-changing customer demand by providing a fast product diversification capability. Performance of an FMS is highly dependent upon the accuracy of scheduling policy for the components of the system, such as automated guided vehicles (AGVs). An AGV as a mobile robot provides remarkable industrial capabilities for material and goods transportation within a manufacturing facility or a warehouse. Allocating AGVs to tasks, while considering the cost and time of operations, defines the AGV scheduling process. Multi-objective scheduling of AGVs, unlike single objective practices, is a complex and combinatorial process. In the main draw of the research, a mathematical model was developed and integrated with evolutionary algorithms (genetic algorithm (GA), particle swarm optimization (PSO), and hybrid GA-PSO) to optimize the task scheduling of AGVs with the objectives of minimizing makespan and number of AGVs while considering the AGVs' battery charge. Assessment of the numerical examples' scheduling before and after the optimization proved the applicability of all the three algorithms in decreasing the makespan and AGV numbers. The hybrid GA-PSO produced the optimum result and outperformed the other two algorithms, in which the mean of AGVs operation efficiency was found to be 69.4, 74, and 79.8 percent in PSO, GA, and hybrid GA-PSO, respectively. Evaluation and validation of the model was performed by simulation via Flexsim software.
| S-EPMC5338791 | biostudies-literature
Project description:The demand for virtual machine requests has increased recently due to the growing number of users and applications. Therefore, virtual machine placement (VMP) is now critical for the provision of efficient resource management in cloud data centers. The VMP process considers the placement of a set of virtual machines onto a set of physical machines, in accordance with a set of criteria. The optimal solution for multi-objective VMP can be determined by using a fitness function that combines the objectives. This paper proposes a novel model to enhance the performance of the VMP decision-making process. Placement decisions are made based on a fitness function that combines three criteria: placement time, power consumption, and resource wastage. The proposed model aims to satisfy minimum values for the three objectives for placement onto all available physical machines. To optimize the VMP solution, the proposed fitness function was implemented using three optimization algorithms: particle swarm optimization with Lévy flight (PSOLF), flower pollination optimization (FPO), and a proposed hybrid algorithm (HPSOLF-FPO). Each algorithm was tested experimentally. The results of the comparative study between the three algorithms show that the hybrid algorithm has the strongest performance. Moreover, the proposed algorithm was tested against the bin packing best fit strategy. The results show that the proposed algorithm outperforms the best fit strategy in total server utilization.
| S-EPMC8771797 | biostudies-literature
Project description:Several optimization problems can be abstracted into many-objective optimization problems (MaOPs). The key to solving MaOPs is designing an effective algorithm to balance the exploration and exploitation issues. This paper proposes a novel many-objective African vulture optimization algorithm (MaAVOA) that simulating the African vultures' foraging and navigation behaviours to solve the MaOPs. MaAVOA is an updated version of the African Vulture Optimization Algorithm (AVOA), which was recently proposed to solve the MaOPs. A new social leader vulture for the selection process is introduced and integrated into the proposed model. In addition, an environmental selection mechanism based on the alternative pool is adapted to improve the selection process to maintain diversity for approximating different parts of the whole Pareto Front (PF). The best-nondominated solutions are saved in an external Archive based on the Fitness Assignment Method (FAM) during the population evolution. FAM is based on a convergence measure that promotes convergence and a density measure that promotes variety. Also, a Reproduction of Archive Solutions (RAS) procedure is developed to improve the quality of archiving solutions. RAS has been designed to help reach out to the missing areas of the PF that the vultures easily miss. Two experiments are conducted to verify and validate the suggested MaAVOA's performance efficacy. First, MaAVOA was applied to the DTLZ functions, and its performance was compared to that of several popular many-objective algorithms and according to the results, MaAVOA outperforms the competitor algorithms in terms of inverted generational distance and hypervolume performance measures and has a beneficial adaptation ability in terms of both convergence and diversity performance measures. Also, statistical tests are implemented to demonstrate the suggested algorithm's statistical relevance. Second, MaAVOA has been applied to solve two real-life constrained engineering MaOPs applications, namely, the series-parallel system and overspeed protection for gas turbine problems. The experiments show that the suggested algorithm can tackle many-objective real-world applications and provide promising choices for decision-makers.
| S-EPMC10191289 | biostudies-literature
Project description:Multi-objective clustering has received widespread attention recently, as it can obtain more accurate and reasonable solution. In this paper, an improved multi-objective clustering framework using particle swarm optimization (IMCPSO) is proposed. Firstly, a novel particle representation for clustering problem is designed to help PSO search clustering solutions in continuous space. Secondly, the distribution of Pareto set is analyzed. The analysis results are applied to the leader selection strategy, and make algorithm avoid trapping in local optimum. Moreover, a clustering solution-improved method is proposed, which can increase the efficiency in searching clustering solution greatly. In the experiments, 28 datasets are used and nine state-of-the-art clustering algorithms are compared, the proposed method is superior to other approaches in the evaluation index ARI.
| S-EPMC5716574 | biostudies-literature
Project description:This study considers multi-period inventory systems for optimizing profit and storage space under stochastic demand. A nonlinear programming model based on random demand is proposed to simulate the inventory operation. The effective inventory management system is realized using a multi-objective grey wolf optimization (MOGWO) method, reducing storage space while maximizing profit. Numerical outcomes are used to confirm the efficacy of the optimal solutions. The numerical analysis and tests for multi-objective inventory optimization are performed in the four practical scenarios. The inventory model's sensitivity analysis is performed to verify the optimal solutions further. Especially the proposed approach allows businesses to optimize profits while regulating the storage space required to operate in inventory management. The supply chain performance can be significantly enhanced using inventory management strategies and inventory management practices. Finally, the novel decision-making strategy can offer new insights into effectively managing digital supply chain networks against market volatility.
| S-EPMC10769039 | biostudies-literature