Brownian Distribution Guided Bacterial Foraging Algorithm for Controller Design Problem

Author(s):  
N. Sri Madhava Raja ◽  
V. Rajinikanth
Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Qi Sun ◽  
Liwen Jiang ◽  
Haitao Xu

The accumulation of real-time data has attracted the attention of various industries because valuable information can be extracted from the effective model and method design. This paper designs a low-carbon model and focuses on the real-time information-sharing network in order to get sustainable strategies promptly and exactly. The design problem is concerned with determining optimal integration strategies on a series of multilocation, multipath, and multiwarehouse freight provided by an information-sharing network to find an effective balance between the total costs and carbon emission. Firstly, the biobjective information-sharing network model is established to describe real-time problem with total cost and carbon emission factor. Secondly, a double-layer bacterial foraging algorithm is divided into inner and outer layers to solve the model, in which the inner section solves the transportation and inventory problems, and the outer section solves the supplier location problem. The double-layer bacterial foraging algorithm realizes the optimization of multisource e-commerce information-sharing model through nesting inside and outside layers. Finally, double-layer bacterial foraging algorithm can be confirmed to get the global optimal solution rapidly based on test data and the e-business case study of Jingdong, China.


2012 ◽  
Vol 12 (11) ◽  
pp. 3500-3513 ◽  
Author(s):  
Nicole Pandit ◽  
Anshul Tripathi ◽  
Shashikala Tapaswi ◽  
Manjaree Pandit

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Peng Li ◽  
Hua Zhu

The optimal performance of the ant colony algorithm (ACA) mainly depends on suitable parameters; therefore, parameter selection for ACA is important. We propose a parameter selection method for ACA based on the bacterial foraging algorithm (BFA), considering the effects of coupling between different parameters. Firstly, parameters for ACA are mapped into a multidimensional space, using a chemotactic operator to ensure that each parameter group approaches the optimal value, speeding up the convergence for each parameter set. Secondly, the operation speed for optimizing the entire parameter set is accelerated using a reproduction operator. Finally, the elimination-dispersal operator is used to strengthen the global optimization of the parameters, which avoids falling into a local optimal solution. In order to validate the effectiveness of this method, the results were compared with those using a genetic algorithm (GA) and a particle swarm optimization (PSO), and simulations were conducted using different grid maps for robot path planning. The results indicated that parameter selection for ACA based on BFA was the superior method, able to determine the best parameter combination rapidly, accurately, and effectively.


Sign in / Sign up

Export Citation Format

Share Document