A hybrid genetic-simulated annealing algorithm for optimization of hydraulic manifold blocks
Tóm tắt
This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks (HMB). Due to the limitation of its local search ability of genetic algorithm (GA) in solving a massive combinatorial optimization problem, simulated annealing (SA) is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.
Tài liệu tham khảo
Gandomkar M, Vakilian M, Ehsan M. A combination of genetic algorithm and simulated annealing for optimal DG allocation in distribution networks [C]// Canadian Conference on Electrical and Computer Engineering, Saskatchewan. [S.l.]: [s.n.], 2005: 645–648.
Ohlídal M, Schwarz J. Hybird parallel simulated annealing using genetic operations [C]//Mendel 2004 10th International Conference on Soft Computing, Bratislava. [S.l.]: Slovok Academy of Science, 2004: 48–53.
Li R Z, Li D L, Du H, et al. SOI MOSFET model parameter extraction via a compound genetic algorithm [J]. Chinese Journal of Semiconductors, 2006, 27(5): 796–803.
Ohlídal M, Schwarz J. Hybrid parallel simulated annealing using genetic operations [C]// Mendel 2004 10th Internacional Conference on Soft Computing, Bratislava. [S.l.]: Slovok Academy of Science, 2004: 89–94.
Tian Shujun, Li Li, Feng Yi. Optimal design of hydraulic manifold blocks based on computational intelligence [J]. China Mechanical Engineering, 2003, 14(17): 1492–1495 (in Chinese).
Castell C M L, Lakshmanan R, Skilling J M, et al. Optimisation of process plant layout using genetic algorithms [J]. Computers and Chemical Engineering, 1998, 1(22): 993–996.
Tian Shujun, Li Li, Feng Yi. Optimal design of networks in hydraulic manifold blocks [J]. Journal of Dalian University of Technology, 2003, 43(3): 324–328 (in Chinese).
Yan Qing, Bao Yuanlv. The new genetic simulated annealing algorithm solve the VRP problem [J]. Computer Applications, 2004, 24(S1): 261–263 (in Chinese).
Grefenstette J, Gopal R, Rosimaita B, et al. Genetic algorithms for the traveling salesman problem [C]// Proceedings of the 1st Conference on Genetic Algorithms, Mahwah. Hillsdale: Lawrence Erlbawm Associates, Inc., 1985: 160–168.
Wang Jinmin, Ma Fengning, Liu Li. The application of simulated annealing algorithm in the solution of layout problems [J]. Journal of Machine Design, 2000, 17(2): 6–9 (in Chinese).