When using the Cobb-Douglas (C-D) production function to measure the contribution rate of agricultural technological progress (ATP), it is necessary to estimate the output elasticity coefficient (OEC) of each input factor in C-D production function. For this purpose, it is usually necessary to take logarithm at both sides of C-D production function and convert it into a linear function, and then use regression analysis method to estimate the OECs of input factors. However, there are some problems in this method remains unsolved: first, the OECs estimated by taking logarithm of C-D production function are not the optimal estimation of the original C-D production function; second, the regression results sometimes fail to pass statistical test; third, some OECs cannot be guaranteed to be non-negative. Aiming at resolving these problems, a method for estimating OECs in C-D production function based on the Hybrid Improved Bat Optimization Algorithm (HIBA) was proposed. This method solves the problems existing in the OEC estimation methods in the existing literatures. To verify the effectiveness of the proposed method in this study, the OECs of input factors in China’ Sichuan Province from 1996 to 2018 was estimated. The estimation results show that, compared with other estimation methods in the existing literatures, the proposed method can not only guarantee that it is the optimal estimation of the OECs in the original C-D production function, but also ensure that the OECs are non-negative and with high precision and good fitting effect. Finally, based on the estimation results, this study measured and analyzed the contribution rate of agricultural input factors and ATP of Sichuan Province and puts forward corresponding suggestions for the agricultural development in this region.
Aiming at the problem of poor global search ability and slow convergence speed when solving optimization problems, this paper proposes improved hybrid firefly algorithm (HFA). HFA improves the position updating method, mutation strategy, chaotic search method and evolution strategy of the population. Specifically, the improved position update formula considers both the effect of high-brightness fireflies on position-updated fireflies, and the effects of the optimal firefly on position-updated fireflies. At the same time, a method of adaptive adjustment parameters in the position update formula is presented, which makes the position update method exhibit strong global search ability and local search ability in the initial stage and the later stage of iteration, respectively. In addition, a combined mutation operator is introduced into HFA, which effectively takes into account the local search and global search ability of the algorithm. Since chaotic search exhibits good ergodicity, an evolution strategy for random movement of all fireflies in the population according to chaotic search is proposed, which enhances the ability of the algorithm to traverse the whole search space, and further improves the global search ability of the algorithm. To verify the effectiveness of HFA, 28 CEC2017 test problems are selected. The calculation results of 28 CEC2017 test problems show that compared with other algorithms, the accuracy of HFA is obviously better than that of other algorithms. Finally, HFA and other intelligent optimization methods in the literatures are used to optimize the structural parameters of cantilever beams. The optimization results show that the weight of the cantilever beam obtained by HFA is obviously smaller than other algorithms. The calculation results of CEC2017 test problems and practical problem show that the solving quality of HFA is obviously better than other algorithms.
The traveling salesman problem (TSP) is one of the most extensively studied problems in the combinatorial optimization area and still presents unsolved challenges due to its NP-hard attribute. Although many real-coded algorithms are available for TSP, they still have some performance challenges in the switch from continuous space to discrete space and perform at low convergence speed. This paper proposes a real-coded carnivorous plant algorithm with a heuristic decoding method (CPA-HDM) to solve the traveling salesman problem (TSP), which exhibits good convergence speed and solution accuracy. In this improved method, a new heuristic decoding method (HDM) is designed, which helps to map continuous variables to discrete ones without losing information, maintain population diversity, and enhance the solution quality after decoding. To balance the algorithm’s search capability and enhance the probability of preferable individuals generated, an adaptive attraction probability (AAP), an improved growth model of carnivorous plants (IGMOCP), and a position update method of prey (IPUMOP) are developed. Aiming to reduce the probability of premature and prevent search stagnation, an improved reproduction strategy (IRS) and an adaptive combination perturbation are reconstructed. Finally, a local search algorithm is employed to improve the exploitation capability. To verify its validation, CPA-HDM is compared with six algorithms, for solving 28 TSP instances. The simulation results and statistical analyses demonstrate the superior performance of the proposed algorithm.
An improved hybrid firefly algorithm with probability attraction model (IHFAPA) is proposed to solve the problems of low computational efficiency and low computational accuracy in solving complex optimization problems. First, the method of square-root sequence was used to generate the initial population, so that the initial population had better population diversity. Second, an adaptive probabilistic attraction model is proposed to attract fireflies according to the brightness level of fireflies, which can minimize the brightness comparison times of the algorithm and moderate the attraction times of the algorithm. Thirdly, a new location update method is proposed, which not only overcomes the deficiency in that the relative attraction of two fireflies is close to 0 when the distance is long but also overcomes the deficiency that the relative attraction of two fireflies is close to infinity when the distance is small. In addition, a combinatorial variational operator based on selection probability is proposed to improve the exploration and exploitation ability of the firefly algorithm (FA). Later, a similarity removal operation is added to maintain the diversity of the population. Finally, experiments using CEC 2017 constrained optimization problems and four practical problems in engineering show that IHFAPA can effectively improve the quality of solutions.