Experimental Comparison of Methods to Handle Boundary Constraints in Differential Evolution

Arabas, Jarosław; Szczepankiewicz, A.; Wroniak, Tomasz

doi:10.1007/978-3-642-15871-1_42

Cited by 34 publications

(44 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recent study proves that boundary repair methods have great impact on the performance of evolutionary algorithms [11]. Popularly used repair methods in literature include reinitialization, projection, resampling, conservatism, wrapping, reflection, and parent medium [11,12].…”

Section: Boundary Repair Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A novel artificial bee colony algorithm for radar polyphase code and antenna array designs

Zhang

2016

J Wireless Com Network

View full text Add to dashboard Cite

When designing radar, mobile, or satellite communication systems, optimization problems often come out and need to be handled to accomplish certain requirements. Polyphase code design and circular antenna array design problems are considered in this paper. To deal with the two problems, a novel artificial bee colony (ABC) algorithm is proposed. A population reduction method is used in the proposed algorithm. Large population is initially set for exploration search, while population is reduced to a small one for exploitation search. Moreover, a new boundary repair method is proposed to amend the candidate solutions that violate boundary constraints. It hybridizes four popularly used repair methods in literature. The resulting algorithm is called population reduction and hybrid repair ABC (PRHRABC). Experiments are conducted on the two design problems. Results show that PRHRABC presents promising performance in dealing with the problems compared with standard and a state-of-the-art ABC algorithms.

show abstract

Section: Boundary Repair Methodsmentioning

confidence: 99%

“…Popularly used repair methods in literature include reinitialization, projection, resampling, conservatism, wrapping, reflection, and parent medium [11,12].…”

Section: Boundary Repair Methodsmentioning

confidence: 99%

A novel artificial bee colony algorithm for radar polyphase code and antenna array designs

Zhang

2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…A recent study of boundary repair methods of DE algorithm reveals that repair methods have great impact on the performance of DE (Arabas et al 2010). First let review several popularly used repair methods.…”

Section: Hybrid Boundary Repair Methodsmentioning

confidence: 99%

“…It is useful for increasing population diversity of the algorithm. As reported in Arabas et al (2010), resampling and projection methods are the first two choices because of their good performance on many benchmark functions. Resampling keeps the algorithm's evolving dynamics, but may consume many computational resources.…”

Section: Hybrid Boundary Repair Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Improving differential evolution by differential vector archive and hybrid repair method for global optimization

Zhang

Xiu

2016

Soft Comput

View full text Add to dashboard Cite

Differential evolution (DE) has been extensively studied in the past decade, though researchers may ignore the effect of an archive storing previous search information. Moreover, boundary repair issue is seldom handled in the literature. This paper attempts to improve the performance of DE algorithm from these two aspects. First, a differential vector archive is constructed and adaptively updated during the optimization process of DE. The archive stores a set of differential vectors representing potential good search directions. Second, inspired by recently reported results about repair methods, a hybrid of four commonly used repair methods is proposed. The hybrid method is more applicable to unknown optimization problems than a single repair method. A test suite containing 28 benchmark functions is employed for experimental investigation. Experimental results show that the proposed algorithm usually affects the search to attain better performance in the later evolutionary stage. Our algorithm significantly outperforms a state-of-the-art algorithm. This result verifies the effectiveness of the proposed algorithm.

show abstract

Investigating bound handling schemes and parameter settings for the interior search algorithm to solve truss problems

Kashani

Chiong

Dhakal

et al. 2021

Engineering Reports

View full text Add to dashboard Cite

The interior search algorithm (ISA) is an optimization algorithm inspired by esthetic techniques used for interior design and decoration. The algorithm has only one parameter, controlled by θ, and uses an evolutionary boundary constraint handling (BCH) strategy to keep itself within an admissible solution space while approaching the optimum. We apply the ISA to find optimal weight design of truss structures with frequency constraints. Sensitivity of the ISA's performance to the θ parameter and the BCH strategy is investigated by considering different values of θ and BCH techniques. This is the first study in the literature on the sensitivity of truss optimization problems to various BCH approaches. Moreover, we also study the impact of different BCH methods on diversification and intensification. Through extensive numerical simulations, we identified the best BCH methods that provide consistently better results for all truss problems studied, and obtained a range of θ that maximizes the ISA's performance for all problem classes studied. However, results also recommend further fine-tuning of parameter settings for specific case studies to obtain the best results.

show abstract

Experimental Comparison of Methods to Handle Boundary Constraints in Differential Evolution

Cited by 34 publications

References 17 publications

A novel artificial bee colony algorithm for radar polyphase code and antenna array designs

A novel artificial bee colony algorithm for radar polyphase code and antenna array designs

Improving differential evolution by differential vector archive and hybrid repair method for global optimization

Investigating bound handling schemes and parameter settings for the interior search algorithm to solve truss problems

Contact Info

Product

Resources

About