A novel chaos optimization algorithm

Feng, Junhong; Zhang, Jie; Zhu, Xiaoshu; Lian, Wenwu

doi:10.1007/s11042-016-3907-z

Cited by 97 publications

(36 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The chaotic mapping method is one of the core contents of chaos search. There are many researches on onedimensional or two-dimensional chaotic mapping [24][25][26][27].These studies mainly aimed at improving the ergodicity of particles in chaotic mapping space and other related features. The studies about chaotic mapping for higher dimensional space are few in number.…”

Section: Particle Chaos Methodsmentioning

confidence: 99%

Hybrid Scheduling for Multi-Equipment at U-Shape Trafficked Automated Terminal Based on Chaos Particle Swarm Optimization

Yang

et al. 2021

JMSE

View full text Add to dashboard Cite

Aimed to improve the efficiency of port operations, Shanghai Zhenhua Heavy Industries Co., Ltd. (ZPMC) proposed a new U-shape trafficked automated terminal. The new U-shape trafficked automated terminal brings a new hybrid scheduling problem. A hybrid scheduling model for yard crane (YC), AGV and ET in the U-shape trafficked automated terminal yard is established to solve the problem. The AGV and ET yard lanes are assumed to be one-way lane. Take the YC, AGV and ET scheduling results (the container transportation sequences) as variables and the minimization of the maximum completion time as the objective function. A scheduling model architecture with hierarchical abstraction of scheduling objects is proposed to refine the problem. The total completion time is solved based on a static and dynamic mixed scheduling strategy. A chaotic particle swarm optimization algorithm with speed control (CCPSO) is proposed, which include a chaotic particle strategy, a particle iterative speed control strategy, and a particle mapping space for hybrid scheduling. The presented model and algorithm were applied to experiments with different numbers of containers and AGVs. The parameters of simulation part refer to Qinzhou Port. The simulation results show that CCPSO can obtain a near-optimal solution in a shorter time and find a better solution when the solution time is sufficient, comparing with the traditional particle swarm optimization algorithm, the adaptive particle swarm optimization algorithm and the random position particle swarm optimization algorithm.

show abstract

Section: Particle Chaos Methodsmentioning

confidence: 99%

Hybrid Scheduling for Multi-Equipment at U-Shape Trafficked Automated Terminal Based on Chaos Particle Swarm Optimization

Yang

et al. 2021

JMSE

View full text Add to dashboard Cite

show abstract

“…Its behavior is complex and similar to random so that it can be used for random search. Chaotic variables have the following characteristics [16]:…”

Section: Chaos Optimizationmentioning

confidence: 99%

An Improvement in LQR Controller Design based on Modified Chaotic Particle Swarm Optimization and Model Order Reduction

Abdullah¹

2021

IJIES

View full text Add to dashboard Cite

The diverse engineering and scientific applications are stated through complex and high-order systems. The significant difficulties of these systems are the complications of modeling, analyzing, and controlling. It is easier to examine simpler models for more physical insights than more complex models and result in lower-ordering controllers that are easier to implement. The model order reduction (MOR) was used to simplify the computational difficulty of such complications and was later developed intensively for use with increasingly CDS. In this paper, a new Modified Chaos Particle Swarm Optimization (MCPSO) technique is employed to get a reduced-order model of a large scale system and design a Linear Quadratic Regulator (LQR) based controller. The mod uses the combination of advantages of basic PSO algorithms and chaotic algorithms. It becomes an excellent algorithm with fast convergence, few control parameters, simple execution, and avoidance of local extremes. In addition to combining the chaotic algorithm, CPSO also improved the weight parameter w, adjusting it to the dynamic attenuation direction. First, efficient reduced-order model parameters are obtained for original higher-order systems based on the MCPSO. Then linear quadratic regulator (LQR (controller parameters optimized for the reduced-order model. The goodness of the proposed method is evaluated through a numerical example. The experimental results indicate that the proposed technique’s reduced order model provides an excellent close approximation to the original system.

show abstract

“…A chaotic map is usually generated by a simple deterministic function and can pass through all states in a range without duplicates. It is very unstable to the initial value, meaning that small changes in the initial value may lead to differences in the output [23].…”

Section: Chaosmentioning

confidence: 99%

“…The existing Kent map, which is computed by Equation (3) and produces values in (0, 1), has been used in many applications [24]. Similarly, neuron map chaos, which is computed by Equation ( 4) and generates values in (−1.5, 0.5), has achieved excellent performance on several vital benchmarks [23]. The proposed chaotic map generates chaotic sequences in (0, 1), and a new map is formed as Equation (5).…”

Section: The Proposed Asymmetric (Right-skewed) Chaotic Mapmentioning

confidence: 99%

An Asymmetric Chaotic Competitive Swarm Optimization Algorithm for Feature Selection in High-Dimensional Data

2020

View full text Add to dashboard Cite

This paper presents a method for feature selection in a high-dimensional classification context. The proposed method finds a candidate solution based on quality criteria using subset searching. In this study, the competitive swarm optimization (CSO) algorithm was implemented to solve feature selection problems in high-dimensional data. A new asymmetric chaotic function was proposed and used to generate the population and search for a CSO solution. Its histogram is right-skewed. The proposed method is named an asymmetric chaotic competitive swarm optimization algorithm (ACCSO). According to the asymmetrical property of the proposed chaotic map, ACCSO prefers zero than one. Therefore, the solution is very compact and can achieve high classification accuracy with a minimal feature subset for high-dimensional datasets. The proposed method was evaluated on 12 datasets, with dimensions ranging from 4 to 10,304. ACCSO was compared to the original CSO algorithm and other metaheuristic algorithms. Experimental results show that the proposed method can increase accuracy and it reduces the number of selected features. Compared to different optimization algorithms with other wrappers, the proposed method exhibits excellent performance.

show abstract

A novel chaos optimization algorithm

Cited by 97 publications

References 13 publications

Hybrid Scheduling for Multi-Equipment at U-Shape Trafficked Automated Terminal Based on Chaos Particle Swarm Optimization

Hybrid Scheduling for Multi-Equipment at U-Shape Trafficked Automated Terminal Based on Chaos Particle Swarm Optimization

An Improvement in LQR Controller Design based on Modified Chaotic Particle Swarm Optimization and Model Order Reduction

An Asymmetric Chaotic Competitive Swarm Optimization Algorithm for Feature Selection in High-Dimensional Data

Contact Info

Product

Resources

About