Shuffled Frog Leaping Algorithm Driven by Nuclear Center and Its Application
Aiming at the defects of slow evolution speed and easy to fall into local convergence caused by the inertia provided by the current position of individual frog and the jump step of shuffled frog leaping algorithm (SFLA), a shuffled frog leaping algorithm driven by nuclear center (NCSFLA) is proposed...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2022-05-01
|
| Series: | Jisuanji kexue yu tansuo |
| Subjects: | |
| Online Access: | http://fcst.ceaj.org/fileup/1673-9418/PDF/1652926932557-1039682361.pdf |
| _version_ | 1818554508511281152 |
|---|---|
| author | LIU Liqun, GU Renyuan |
| author_facet | LIU Liqun, GU Renyuan |
| author_sort | LIU Liqun, GU Renyuan |
| collection | DOAJ |
| description | Aiming at the defects of slow evolution speed and easy to fall into local convergence caused by the inertia provided by the current position of individual frog and the jump step of shuffled frog leaping algorithm (SFLA), a shuffled frog leaping algorithm driven by nuclear center (NCSFLA) is proposed, in which the jump evolution behavior of individual frog is defined as quantum mechanical behavior. In the global optimization, the concentric circle centered on the nucleus is used as the electron orbit to form the frog population. In the local optimization, three different local search strategies are used to update the worst individual in the population, such as jumping to the local optimal individual with the transition step as the radius, jumping to the global optimal individual with the driving step as the radius, and randomly generating non repeated frog individual components. Taking the electron orbit center, that is, the local optimal individual, as the inertial guidance of the transition, makes the convergence in the population more conducive to finding the local optimal solution and improving the search ability. If it falls into local optimization, the inertial guidance driven by the nuclear center, that is, the global optimal individual, makes the frog individuals gather around the nuclear center as much as possible, so as to speed up the convergence speed. The algorithm is applied to solving the capacity-limited vehicle routing problem (CVRP), and a shuffled frog leaping algorithm driven by nuclear center for capacity-limited vehicle routing problem (NCSFLA-CVRP) is proposed. In the test of 20 benchmark functions such as single peak value, multi-peak function and composite function, the expe-rimental results show that the improved shuffled frog leaping algorithm driven by nuclear center has the charac-teristics of fast convergence and high accuracy compared with other five algorithms. The test results of Solomon example standard test data show that this method can effectively improve the optimization performance of capacity-limited vehicle routing problem. |
| first_indexed | 2024-12-12T09:40:35Z |
| format | Article |
| id | doaj.art-8c7f13ef231b450a8e5f51576e713b3c |
| institution | Directory Open Access Journal |
| issn | 1673-9418 |
| language | zho |
| last_indexed | 2024-12-12T09:40:35Z |
| publishDate | 2022-05-01 |
| publisher | Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press |
| record_format | Article |
| series | Jisuanji kexue yu tansuo |
| spelling | doaj.art-8c7f13ef231b450a8e5f51576e713b3c2022-12-22T00:28:34ZzhoJournal of Computer Engineering and Applications Beijing Co., Ltd., Science PressJisuanji kexue yu tansuo1673-94182022-05-011651169118110.3778/j.issn.1673-9418.2108067Shuffled Frog Leaping Algorithm Driven by Nuclear Center and Its ApplicationLIU Liqun, GU Renyuan0College of Information Science and Technology, Gansu Agricultural University, Lanzhou 730070, ChinaAiming at the defects of slow evolution speed and easy to fall into local convergence caused by the inertia provided by the current position of individual frog and the jump step of shuffled frog leaping algorithm (SFLA), a shuffled frog leaping algorithm driven by nuclear center (NCSFLA) is proposed, in which the jump evolution behavior of individual frog is defined as quantum mechanical behavior. In the global optimization, the concentric circle centered on the nucleus is used as the electron orbit to form the frog population. In the local optimization, three different local search strategies are used to update the worst individual in the population, such as jumping to the local optimal individual with the transition step as the radius, jumping to the global optimal individual with the driving step as the radius, and randomly generating non repeated frog individual components. Taking the electron orbit center, that is, the local optimal individual, as the inertial guidance of the transition, makes the convergence in the population more conducive to finding the local optimal solution and improving the search ability. If it falls into local optimization, the inertial guidance driven by the nuclear center, that is, the global optimal individual, makes the frog individuals gather around the nuclear center as much as possible, so as to speed up the convergence speed. The algorithm is applied to solving the capacity-limited vehicle routing problem (CVRP), and a shuffled frog leaping algorithm driven by nuclear center for capacity-limited vehicle routing problem (NCSFLA-CVRP) is proposed. In the test of 20 benchmark functions such as single peak value, multi-peak function and composite function, the expe-rimental results show that the improved shuffled frog leaping algorithm driven by nuclear center has the charac-teristics of fast convergence and high accuracy compared with other five algorithms. The test results of Solomon example standard test data show that this method can effectively improve the optimization performance of capacity-limited vehicle routing problem.http://fcst.ceaj.org/fileup/1673-9418/PDF/1652926932557-1039682361.pdf|shuffled frog leaping algorithm (sfla)|nuclear center|track center|driving strategy|capacity-limited vehicle routing problem (cvrp) |
| spellingShingle | LIU Liqun, GU Renyuan Shuffled Frog Leaping Algorithm Driven by Nuclear Center and Its Application Jisuanji kexue yu tansuo |shuffled frog leaping algorithm (sfla)|nuclear center|track center|driving strategy|capacity-limited vehicle routing problem (cvrp) |
| title | Shuffled Frog Leaping Algorithm Driven by Nuclear Center and Its Application |
| title_full | Shuffled Frog Leaping Algorithm Driven by Nuclear Center and Its Application |
| title_fullStr | Shuffled Frog Leaping Algorithm Driven by Nuclear Center and Its Application |
| title_full_unstemmed | Shuffled Frog Leaping Algorithm Driven by Nuclear Center and Its Application |
| title_short | Shuffled Frog Leaping Algorithm Driven by Nuclear Center and Its Application |
| title_sort | shuffled frog leaping algorithm driven by nuclear center and its application |
| topic | |shuffled frog leaping algorithm (sfla)|nuclear center|track center|driving strategy|capacity-limited vehicle routing problem (cvrp) |
| url | http://fcst.ceaj.org/fileup/1673-9418/PDF/1652926932557-1039682361.pdf |
| work_keys_str_mv | AT liuliqungurenyuan shuffledfrogleapingalgorithmdrivenbynuclearcenteranditsapplication |