Identification of time series models using sparse Takagi–Sugeno fuzzy systems with reduced structure

Simplifying fuzzy models, including those for predicting time series, is an important issue in terms of their interpretation and implementation. This simplification can involve both the number of inference rules (i.e., structure) and the number of parameters. This paper proposes novel hybrid methods for time series prediction that utilize Takagi–Sugeno fuzzy systems with reduced structure. The fuzzy sets are obtained using a global optimization algorithm (particle swarm optimization, simulated annealing, genetic algorithm, or pattern search). The polynomials are determined by elastic net regression, which is a sparse regression. The simplification is based on reducing the number of polynomial parameters in the then-part by using sparse regression and removing unnecessary rules by using labels. A new quality criterion is proposed to express a compromise between the model accuracy and its simplification. The experimental results show that the proposed methods can improve a fuzzy model while simplifying its structure.

SIMULATED ANNEALING GENETIC ALGORITHM-BASED HARVESTER OPERATION SCHEDULING MODEL

To address problems involving the poor matching ability of supply and demand information and outdated scheduling methods in agricultural machinery operation service, in this study, we proposed a harvester operation scheduling model and algorithm for an order-oriented multi-machine collaborative operation within a region. First, we analysed the order-oriented multi-machine collaborative operation within the region and the characteristics of agricultural machinery operation scheduling, examined the revenue of a mechanized harvesting operation and the components of each cost, and constructed a harvester operation scheduling model with the operation income as the optimization goal. Second, we proposed a simulated annealing genetic algorithm-based harvester operation scheduling algorithm and analysed the validity and stability of the algorithm through experimental simulations. The results showed that the proposed harvester operation scheduling model effectively integrated the operating cost, transfer cost, waiting time cost, and operation delay cost of the harvester, and the accuracy of the harvester operation scheduling model was improved; the harvester operation scheduling algorithm based on simulated annealing genetic algorithm (SAGA) was able to obtain a global near-optimal solution of high quality and stability with high computational efficiency.

Waste collection routing problem: A mini-review of recent heuristic approaches and applications

The waste collection routing problem (WCRP) can be defined as a problem of designing a route to serve all of the customers (represented as nodes) with the least total traveling time or distance, served by the least number of vehicles under specific constraints, such as vehicle capacity. The relevance of WCRP is rising due to its increased waste generation and all the challenges involved in its efficient disposal. This research provides a mini-review of the latest approaches and its application in the collection and routing of waste. Several metaheuristic algorithms are reviewed, such as ant colony optimization, simulated annealing, genetic algorithm, large neighborhood search, greedy randomized adaptive search procedures, and others. Some other approaches to solve WCRP like GIS is also introduced. Finally, a performance comparison of a real-world benchmark is presented as well as future research opportunities in WCRP field.

Solution strategy based on Gaussian mixture models and dispersion reduction for the capacitated centered clustering problem

The Capacitated Centered Clustering Problem (CCCP)—a multi-facility location model—is very important within the logistics and supply chain management fields due to its impact on industrial transportation and distribution. However, solving the CCCP is a challenging task due to its computational complexity. In this work, a strategy based on Gaussian mixture models (GMMs) and dispersion reduction is presented to obtain the most likely locations of facilities for sets of client points considering their distribution patterns. Experiments performed on large CCCP instances, and considering updated best-known solutions, led to estimate the performance of the GMMs approach, termed as Dispersion Reduction GMMs, with a mean error gap smaller than 2.6%. This result is more competitive when compared to Variable Neighborhood Search, Simulated Annealing, Genetic Algorithm and CKMeans and faster to achieve when compared to the best-known solutions obtained by Tabu-Search and Clustering Search.

Research on the Boundary Identification Method of Concealed Geological Bodies Based on Non-seismic Geophysical Data—— Taking Benxi-Xiuyan Area as an Example

In the process of deep geological structure research, gravity and aeromagnetic anomaly data are often used to invert the distribution law of concealed geological bodies. In order to reveal the boundaries of concealed geological bodies and divide structural divisions, this paper adopts fuzzy control simulated annealing genetic algorithm () to superimpose the gravity and aeromagnetic anomaly data in Benxi-Xiuyan area and classify the patterns, and identify the main geological body boundaries and fractures. Comparing the relationship with known geological maps, the two have a higher degree of matching. Experiments show that the application of SAGAFcm algorithm can quickly identify the boundaries of concealed geological bodies and provide a new means for field geological mapping.

Collaborative Distribution in the Soft Time Window of Agricultural-Means Supply Chain Based on Simulated Annealing-Genetic Algorithm

This paper mainly explores the collaborative distribution to multiple customers at the terminal of agricultural-means supply chain (AMSC). Firstly, a cost optimization model for collaborative distribution constrained by time window was constructed based on fuzzy appointment time function. Next, the proposed model was solved by simulated annealing-genetic algorithm (SA-GA). Through a case study, the cost optimization model constrained by customer satisfaction was compared with that not constrained by customer satisfaction. The results show that the cost optimization model constrained by customer satisfaction made the customers more satisfied without greatly elevating the distribution cost. The research results shed new light on the collaborative distribution of time-sensitive agricultural-means (AM) products, and the management of the AMSC.