Search Results (32)

This paper addresses single-machine due-window assignment scheduling with truncated learning effects and past-sequence-dependent setup times. In practical production systems, truncated learning effects capture the ceiling of skill improvement, past-sequence-dependent setup times reflect sequence-dependent switching efforts, and position-dependent weights allow varying importance across job positions. The due-window assignment includes the common, slack, and different assignments. The objective cost is the minimum of the weighted sum of earliness and tardiness, the number of early and tardy jobs, due-window cost, and the completion time. In which the weights are position-dependent. For the common and slack due-window assignments, several optimal structural properties are established. Based on these, the optimal schedule can be derived by solving a series of assignment problems, i.e., the problems can be solved in polynomial time $O\left(n^5\right)$, where n is the number of jobs. Under the common, slack, and different assignments without the number of early and tardy jobs cost, the optimal schedule of the problems can be obtained from an assignment problem, i.e., the problems can be solved in $O\left(n^3\right)$ time. In addition, an extension of the job-dependent processing times is given. This study extends existing research models in this domain and proposes polynomial-time algorithms that guarantee optimal solutions for minimizing the objective cost function. The proposed approach not only advances scheduling theory by handling multiple realistic constraints simultaneously but also offers a practical decision-making tool for just-in-time production systems. The algorithms are tested numerically and compared with simulated annealing algorithm and tabu search algorithm. Full article

Path planning for large-scale agricultural fields faces challenges such as irregular field shapes, uncertain boundaries, and the need to balance path efficiency, energy consumption, and coverage quality. To address these problems, this research introduces a strategy-aware hierarchical hybrid optimization framework (HANS) for autonomous agricultural operations. This framework introduces a global principal axis extraction method based on Principal Component Analysis (PCA), utilizing the statistical distribution of field boundaries to guide path direction, thereby improving robustness against boundary noise and irregular geometries. The framework integrates Adaptive Large Neighborhood Search (ALNS) for global exploration and Tabu Search (TS) for local optimization, forming a tightly coordinated hybrid structure. The framework further employs a Pareto-set-based decision support selection strategy to solve a multi-objective optimization model encompassing machine kinematics, turning patterns, and energy-aware cost evaluation. This strategy provides three methods: weighted preference-based compromise solution selection, crowding distance-based diversified solution selection, and single-objective extreme value-based dedicated optimization solution selection. To balance the impact of path length, energy consumption, and coverage rate, we assigned equal or nearly equal weights to them (i.e., (0.33, 0.33, 0.34)). Furthermore, the framework incorporates operators and feedback learning mechanisms specific to agricultural coverage path problems to enable adaptive operator selection and reduce reliance on manual parameter tuning. Simulation results under three representative field scenarios show that compared to fixed-direction planning, HANS improves the average coverage rate by 0.51 percentage points and reduces fuel consumption by 4.34%. Compared to Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Tabu Search (TS), and Simulated Annealing (SA), the proposed method shortens the working path length by 0.37–0.83%, improves coverage rate by 0.34–1.11%, and reduces energy consumption by 0.61–1.03%, while maintaining competitive computational costs. These results demonstrate the effectiveness and practicality of HANS in large-scale autonomous farming operations. Full article

Neuronal firing behaviors are fundamental to brain information processing, and their abnormalities are closely associated with neurological disorders. This study conducts a comprehensive bifurcation and firing-behavior analysis of an improved Tabu Learning neuron model using a semi-analytical discrete implicit mapping framework. First, a discrete implicit mapping is constructed for the Tabu Learning neuron, enabling high-precision localization of stable and unstable periodic orbits within chaotic regimes and overcoming the limitations of conventional time-domain integration. Second, an eigenvalue-centered analysis is used to classify bifurcation types and stability, summarized in explicit bifurcation tables that reveal self-similar offset bifurcation routes, coexisting periodic and chaotic attractors, and chaotic bubbling firing patterns. Third, the proposed neuron model and its discrete mapping are implemented on an FPGA platform, where hardware experiments faithfully reproduce the analytically predicted stable and unstable motions, thereby tightly linking theoretical analysis and digital neuromorphic hardware. Overall, this work establishes a unified analytical–numerical–hardware framework for exploring complex neuronal dynamics and provides a potential basis for neuromodulation strategies and neuromorphic computing system design. Full article

This paper explores the physical layer security performance of collaborative drone fleets enabled by visible light communication (VLC) in a multi-eavesdropper scenario, where multiple drones leverage VLC to serve terrestrial users. To strengthen system security, we formulate a sum worst-case secrecy rate maximization problem. To address the non-convex optimization challenge of this problem, we develop two innovative Q-learning-based position decision algorithms (Q-PDA and Q-PDA-lite) with a dynamic reward mechanism, allowing drones to adaptively optimize their positions. Additionally, we propose an enhanced Tabu Search-based grouping algorithm (TS-GA) to establish the suboptimal user equipment (UE)–drone association by balancing candidate solution exploration and tabu constraint exploitation. Simulation results demonstrate that the proposed Q-PDA and Q-PDA-lite achieve worst-case secrecy rates significantly exceeding those of Random-PDA and K-means-PDA. While Q-PDA-lite exhibits 2% lower performance than Q-PDA, it offers reduced complexity. Additionally, the proposed TS-GA achieves a worst-case secrecy rate that substantially outperforms random grouping, UE-channel-gain-based grouping, and channel-gain-based grouping. Collectively, the hybrid approach integrating Q-PDA and TS-GA achieves 10% near-global optimality with guaranteed convergence, while preserving computational efficiency. Furthermore, this hybrid approach outperforms other combinations in terms of security metrics. Full article

Tabu search is a well-known local search-based metaheuristic, widely used for tackling complex combinatorial optimization problems. As with other metaheuristics, its performance is sensitive to parameter configurations, requiring careful tuning. Among the critical parameters of tabu search is the tabu tenure. This study aims to identify key search attributes and instance characteristics that can help establish comprehensive guidelines for a robust tabu tenure policy. First, a review different tabu tenure policies is provided. Next, critical baselines to understand the fundamental relationship between tabu tenure settings and solution quality are established. We verified that generalizable parameter selection rules provide value when implementing metaheuristic frameworks, specifically showing that a more robust tabu tenure policy can be achieved by considering whether a move is improving or non-improving. Finally, we explore the integration of machine learning techniques that exploits both dynamic search attributes and static instance characteristics to obtain effective and robust tabu tenure policies. A statistical analysis confirms that the integration of machine learning yields statistically significant performance gains, achieving a mean improvement of 12.23 (standard deviation 137.25, $n=$ 10,000 observations) when compared to a standard randomized tabu tenure selection (p-value < 0.001). While the integration of machine learning introduces additional computational overhead, it may be justified in scenarios where heuristics are repeatedly applied to structurally similar problem instances, and even small improvements in solution quality can accumulate to large overall gains. Nonetheless, our methods have limitations. The influence of the tabu tenure parameter is difficult to detect in real time during the search process, complicating the reliable identification of when and how tenure adjustments impact search performance. Additionally, the proposed policies exhibit similar performance on the chosen instances, further complicating the evaluation and differentiation of policy effectiveness. Full article

Efficient sales route optimization is a critical challenge in logistics and distribution, especially under real-world conditions involving traffic variability and dynamic constraints. This study proposes a novel Hybrid Genetic Algorithm (GAAM-TS) that integrates Adaptive Mutation, Tabu Search, and an LSTM-based travel time prediction model to enable real-time, intelligent route planning. The approach addresses the limitations of traditional genetic algorithms by enhancing solution quality, maintaining population diversity, and incorporating data-driven traffic estimations via deep learning. Experimental results on real-world data from the NYC Taxi dataset show that GAAM-TS significantly outperforms both Standard GA and GA-AM variants, achieving up to 20% improvement in travel efficiency while maintaining robustness across problem sizes. Although GAAM-TS incurs higher computational costs, it is best suited for offline or batch optimization scenarios, whereas GA-AM provides a balanced alternative for near-real-time applications. The proposed methodology is applicable to last-mile delivery, fleet routing, and sales territory management, offering a scalable and adaptive solution. Future work will explore parallelization strategies and multi-objective extensions for sustainability-aware routing. Full article

Marine voyage optimization determines the optimal route and speed to ensure timely arrival. The problem becomes particularly complex when incorporating a dynamic environment, such as future expected weather conditions along the route and unexpected disruptions. This study explores two model-free Deep Reinforcement Learning (DRL) algorithms: (i) a Double Deep Q Network (DDQN) and (ii) a Deep Deterministic Policy Gradient (DDPG). These algorithms are computationally costly, so we split optimization into an offline phase (costly pre-training for a route) and an online phase where the algorithms are fine-tuned as updated weather data become available. Fine tuning is quick enough for en-route adjustments and for updating the offline planning for different dates where the weather might be very different. The models are compared to classical and heuristic methods: the DDPG achieved a 4% lower fuel consumption than the DDQN and was only outperformed by Tabu Search by 1%. Both DRL models demonstrate high adaptability to dynamic weather updates, achieving up to 12% improvement in fuel consumption compared to the distance-based baseline model. Additionally, they are non-graph-based and self-learning, making them more straightforward to extend and integrate into future digital twin-driven autonomous solutions, compared to traditional approaches. Full article

The dairy supply chain encompasses all stages involved in the production, processing, distribution, and delivery of dairy products from farms to end consumers. Artificial intelligence (AI) refers to the use of advanced technologies to optimize processes and make informed decisions. Using the PRISMA methodology, this research analyzes AI technologies applied in the dairy supply chain, their impact on process optimization, the factors facilitating or hindering their adoption, and their potential to enhance sustainability and operational efficiency. The findings show that artificial intelligence (AI) is transforming dairy supply chain management through technologies such as artificial neural networks, deep learning, IoT sensors, and blockchain. These tools enable real-time planning and decision-making optimization, improve product quality and safety, and ensure traceability. The use of machine learning algorithms, such as Tabu Search, ACO, and SARIMA, is highlighted for predicting production, managing inventories, and optimizing logistics. Additionally, AI fosters sustainability by reducing environmental impact through more responsible farming practices and process automation, such as robotic milking. However, its adoption faces barriers such as high costs, lack of infrastructure, and technical training, particularly in small businesses. Despite these challenges, AI drives operational efficiency, strengthens food safety, and supports the transition toward a more sustainable and resilient supply chain. It is important to note that the study has limitations in analyzing long-term impacts, stakeholder resistance, and the lack of comparative studies on the effectiveness of different AI approaches. Full article

Finding the best configuration of a neural network’s hyper-parameters may take too long to be feasible using an exhaustive search, especially when the cardinality of the search space has a big combinatorial number of possible solutions with various hyper-parameters. This problem is aggravated when we also need to optimize the parameters of the neural network, such as the weight of the hidden neurons and biases. Extreme learning machines (ELMs) are part of the random weights neural network family, in which parameters are randomly initialized, and the solution, unlike gradient-descent-based algorithms, can be found analytically. This ability is especially useful for metaheuristic analysis due to its reduced training times allowing a faster optimization process, but the problem of finding the best hyper-parameter configuration is still remaining. In this paper, we propose a modification of the artificial bee colony (ABC) metaheuristic to act as parameterizers for a regularized ELM, incorporating three methods: an adaptive mechanism for ABC to balance exploration (global search) and exploitation (local search), an adaptation of the opposition-based learning technique called opposition local-based learning (OLBL) to strengthen exploitation, and a record of access to the search space called forbidden redundant indexes (FRI) that allow us to avoid redundant calculations and track the explored percentage of the search space. We set ten parameterizations applying different combinations of the proposed methods, limiting them to explore up to approximately 10% of the search space, with results over 98% compared to the maximum performance obtained in the exhaustive search in binary and multiclass datasets. The results demonstrate a promising use of these parameterizations to optimize the hyper-parameters of the R-ELM in datasets with different characteristics in cases where computational efficiency is required, with the possibility of extending its use to other problems with similar characteristics with minor modifications, such as the parameterization of support vector machines, digital image filters, and other neural networks, among others. Full article

In this paper, by replacing the exponential memory kernel function of a tabu learning single-neuron model with the power-law memory kernel function, a novel Caputo’s fractional-order tabu learning single-neuron model and a network of two interacting fractional-order tabu learning neurons are constructed firstly. Different from the integer-order tabu learning model, the order of the fractional-order derivative is used to measure the neuron’s memory decay rate and then the stabilities of the models are evaluated by the eigenvalues of the Jacobian matrix at the equilibrium point of the fractional-order models. By choosing the memory decay rate (or the order of the fractional-order derivative) as the bifurcation parameter, it is proved that Hopf bifurcation occurs in the fractional-order tabu learning single-neuron model where the value of bifurcation point in the fractional-order model is smaller than the integer-order model’s. By numerical simulations, it is shown that the fractional-order network with a lower memory decay rate is capable of producing tangent bifurcation as the learning rate increases from 0 to 0.4. When the learning rate is fixed and the memory decay increases, the fractional-order network enters into frequency synchronization firstly and then enters into amplitude synchronization. During the synchronization process, the oscillation frequency of the fractional-order tabu learning two-neuron network increases with an increase in the memory decay rate. This implies that the higher the memory decay rate of neurons, the higher the learning frequency will be. Full article

The primary objective of introducing metaheuristic algorithms into traditional systematic logic is to minimize the cost function. However, there is a lack of research on the impact of introducing metaheuristic algorithms on the cost function under different proportions of positive literals. In order to fill in this gap and improve the efficiency of the metaheuristic algorithm in systematic logic, we proposed a metaheuristic algorithm based on mutation tabu search and embedded it in probabilistic satisfiability logic in discrete Hopfield neural networks. Based on the traditional tabu search algorithm, the mutation operators of the genetic algorithm were combined to improve its global search ability during the learning phase and ensure that the cost function of the systematic logic converged to zero at different proportions of positive literals. Additionally, further optimization was carried out in the retrieval phase to enhance the diversity of solutions. Compared with nine other metaheuristic algorithms and exhaustive search algorithms, the proposed algorithm was superior to other algorithms in terms of time complexity and global convergence, and showed higher efficiency in the search solutions at the binary search space, consolidated the efficiency of systematic logic in the learning phase, and significantly improved the diversity of the global solution in the retrieval phase of systematic logic. Full article

A Bayesian network (BN) is a probabilistic graphical model that can model complex and nonlinear relationships. Its structural learning from data is an NP-hard problem because of its search-space size. One method to perform structural learning is a search and score approach, which uses a search algorithm and structural score. A study comparing 15 algorithms showed that hill climbing (HC) and tabu search (TABU) performed the best overall on the tests. This work performs a deeper analysis of the application of the adaptive genetic algorithm with varying population size (AGAVaPS) on the BN structural learning problem, which a preliminary test showed that it had the potential to perform well on. AGAVaPS is a genetic algorithm that uses the concept of life, where each solution is in the population for a number of iterations. Each individual also has its own mutation rate, and there is a small probability of undergoing mutation twice. Parameter analysis of AGAVaPS in BN structural leaning was performed. Also, AGAVaPS was compared to HC and TABU for six literature datasets considering F1 score, structural Hamming distance (SHD), balanced scoring function (BSF), Bayesian information criterion (BIC), and execution time. HC and TABU performed basically the same for all the tests made. AGAVaPS performed better than the other algorithms for F1 score, SHD, and BIC, showing that it can perform well and is a good choice for BN structural learning. Full article

The Internet of Things (IoT) and network-enabled smart devices are crucial to the digitally interconnected society of the present day. However, the increased reliance on IoT devices increases their susceptibility to malicious activities within network traffic, posing significant challenges to cybersecurity. As a result, both system administrators and end users are negatively affected by these malevolent behaviours. Intrusion-detection systems (IDSs) are commonly deployed as a cyber attack defence mechanism to mitigate such risks. IDS plays a crucial role in identifying and preventing cyber hazards within IoT networks. However, the development of an efficient and rapid IDS system for the detection of cyber attacks remains a challenging area of research. Moreover, IDS datasets contain multiple features, so the implementation of feature selection (FS) is required to design an effective and timely IDS. The FS procedure seeks to eliminate irrelevant and redundant features from large IDS datasets, thereby improving the intrusion-detection system’s overall performance. In this paper, we propose a hybrid wrapper-based feature-selection algorithm that is based on the concepts of the Cellular Automata (CA) engine and Tabu Search (TS)-based aspiration criteria. We used a Random Forest (RF) ensemble learning classifier to evaluate the fitness of the selected features. The proposed algorithm, CAT-S, was tested on the TON_IoT dataset. The simulation results demonstrate that the proposed algorithm, CAT-S, enhances classification accuracy while simultaneously reducing the number of features and the false positive rate. Full article

Quantification of vegetation biophysical variables such as leaf area index (LAI), fractional vegetation cover (fCover), and biomass are among the key factors across hydrological, agricultural, and irrigation management studies. The present study proposes a kernel-based machine learning algorithm capable of performing adaptive and nonlinear data fitting so as to generate a suitable, accurate, and robust algorithm for spatio-temporal estimation of the three mentioned variables using Sentinel-2 images. To this aim, Gaussian process regression (GPR)–particle swarm optimization (PSO), GPR–genetic algorithm (GA), GPR–tabu search (TS), and GPR–simulated annealing (SA) hyperparameter-optimized algorithms were developed and compared against kernel-based machine learning regression algorithms and artificial neural network (ANN) and random forest (RF) algorithms. The accuracy of the proposed algorithms was assessed using digital hemispherical photography (DHP) data and destructive measurements performed during the growing season of silage maize in agricultural fields of Ghale-Nou, southern Tehran, Iran, in the summer of 2019. The results on biophysical variables against validation data showed that the developed GPR-PSO algorithm outperformed other algorithms under study in terms of robustness and accuracy (0.917, 0.931, 0.882 using R² and 0.627, 0.078, and 1.99 using RMSE in LAI, fCover, and biomass of Sentinel-2 20 m, respectively). GPR-PSO also possesses the unique ability to generate pixel-based uncertainty maps (confidence level) for prediction purposes (i.e., estimated uncertainty level <0.7 in LAI, fCover, and biomass, for 96%, 98%, and 71% of the total study area, respectively). Altogether, GPR-PSO appears to be the most suitable option for mapping biophysical variables at the local scale using Sentinel-2 images. Full article

The performance of optimization algorithms, and consequently of AI/machine learning solutions, is strongly influenced by the setting of their hyperparameters. Over the last decades, a rich literature has developed proposing methods to automatically determine the parameter setting for a problem of interest, aiming at either robust or instance-specific settings. Robust setting optimization is already a mature area of research, while instance-level setting is still in its infancy, with contributions mainly dealing with algorithm selection. The work reported in this paper belongs to the latter category, exploiting the learning and generalization capabilities of artificial neural networks to adapt a general setting generated by state-of-the-art automatic configurators. Our approach differs significantly from analogous ones in the literature, both because we rely on neural systems to suggest the settings, and because we propose a novel learning scheme in which different outputs are proposed for each input, in order to support generalization from examples. The approach was validated on two different algorithms that optimized instances of two different problems. We used an algorithm that is very sensitive to parameter settings, applied to generalized assignment problem instances, and a robust tabu search that is purportedly little sensitive to its settings, applied to quadratic assignment problem instances. The computational results in both cases attest to the effectiveness of the approach, especially when applied to instances that are structurally very different from those previously encountered. Full article