排序方式: 共有5条查询结果,搜索用时 15 毫秒
1
1.
Modified binary particle swarm optimization 总被引:1,自引:0,他引:1
Sangwook. Lee Sangmoon Soak Sanghoun Oh Witold Pedrycz Moongu Jeonc 《自然科学进展(英文版)》2008,18(9):1161-1166
This paper presents a modified binary particle swarm optimization (BPSO) which adopts concepts of the genotype-phenotype representation and the mutation operator of genetic algorithms. Its main feature is that the BPSO can be treated as a continuous PSO. The proposed BPSO algorithm is tested on various benchmark functions, and its performance is compared with that of the original BPSO. Experimental results show that the modified BPSO outperforms the original BPSO algorithm. 相似文献
2.
This paper focuses on a new optimization problem, which is called “The Multiple Container Packing Problem (MCPP)” and proposes a new evolutionary approach for it. The proposed evolutionary approach uses “Adaptive Link Adjustment Evolutionary Algorithm (ALA-EA)” as a basic framework and it incorporates a heuristic local improvement approach into ALA-EA. The first step of the local search algorithm is to raise empty space through the exchange among the packed items and then to improve the fitness value through packing unpacked items into the raised empty space. The second step is to exchange the packed items and the unpacked items one another toward improving the fitness value. The proposed algorithm is compared to the previous evolutionary approaches at the benchmark instances (with the same container capacity) and the modified benchmark instances (with different container capacity) and that the algorithm is proved to be superior to the previous evolutionary approaches in the solution quality. 相似文献
3.
This paper focuses on a new optimization problem, which is called "The Multiple Container Packing Problem (MCPP)" and proposes a new evolutionary approach for it. The proposed evolutionary approach uses "Adaptive Link Adjustment Evolutionary Algorithm (ALA-EA)" as a basic framework and it incorporates a heuristic local improvement approach into ALA-EA. The first step of the local search algorithm is to raise empty space through the exchange among the packed items and then to improve the fitness value through packing unpacked items into the raised empty space. The second step is to exchange the packed items and the unpacked items one another toward improving the fitness value. The proposed algorithm is compared to the previous evolutionary approaches at the benchmark instances (with the same container capacity) and the modified benchmark instances (with different container capacity) and that the algorithm is proved to be superior to the previous evolutionary approaches in the solution quality. 相似文献
4.
This paper presents a modified binary particle swarm optimization(BPSO)which adopts concepts of the genotype-phenotype rep-resentation and the mutation operator of genetic algorithms.Its main feature is that the BPSO can be treated as a continuous PSO.The proposed BPSO algorithm is tested on various benchmark functions,and its performance is compared with that of the original BPSO.Experimental results show that the modified BPSO outperforms the original BPSO algorithm. 相似文献
5.
This paper focuses on a new optimization problem, which is called "The Multiple Container Packing Problem (MCPP)" and proposes a new evolutionary approach for it. The proposed evolutionary approach uses "Adaptive Link Adjustment Evolutionary Algorithm (ALA-EA)" as a basic framework and it incorporates a heuristic local improvement approach into ALA-EA. The first step of the local search algorithm is to raise empty space through the exchange among the packed items and then to improve the fitness value through packing unpacked items into the raised empty space. The second step is to exchange the packed items and the unpacked items one another toward improving the fitness value. The proposed algorithm is compared to the previous evolutionary approaches at the bench-mark instances (with the same container capacity) and the modified benchmark instances (with different container capacity) and that the algorithm is proved to be superior to the previous evolutionary approaches in the solution quality. 相似文献
1