Packing degree optimization of arbitrary circle arrangements by genetic algorithm

Hamid Rahmani

首页> 外文期刊>Granular matter >Packing degree optimization of arbitrary circle arrangements by genetic algorithm

【24h】

Packing degree optimization of arbitrary circle arrangements by genetic algorithm

机译：遗传算法优化任意圆排列的装箱度

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Selection of optimal aggregate proportions is the main part of the concrete mix design optimization. Assuming circular aggregates, a new Sequential Packing Algorithm (SPA) is proposed to densify arrangement of arbitrary circles. To achieve the densest packing of circles, the porosity packed circle assemblies is optimized by a Genetic Algorithm (GA) search module. Proper adjustment of the algorithm's parameters and selection of the initial population are effective tools for speeding up the computational progress. The model exactly solves known problems. Finally, Ideal-grading curve is presented after the implementation of GA on the data set.

机译：选择最佳骨料比例是混凝土配合比设计优化的主要部分。假设圆形聚合，提出了一种新的顺序打包算法（SPA）来压缩任意圆的排列。为了实现最密集的圆堆积，通过遗传算法（GA）搜索模块优化了孔隙堆积圆组件。适当调整算法参数和选择初始种群是加快计算进度的有效工具。该模型完全解决了已知问题。最后，在数据集上实施遗传算法后，给出了理想梯度曲线。

著录项

来源
《Granular matter》 |2014年第5期|751-760|共10页
作者
Hamid Rahmani;
展开▼
作者单位

Department of Civil Engineering, College of Engineering, University of Yasouj, Yasouj, Iran;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词
Genetic algorithm; Sequential packing algorithm; Packing degree; Optimization; Circle;

机译：遗传算法顺序打包算法;包装程度;优化;圈;

相似文献

外文文献
中文文献
专利

1. The importance of implementation details and parameter settings in black-box optimization: a case study on Gaussian estimation-of-distribution algorithms and circles-in-a-square packing problems [J] . Peter A. N. Bosman, Marcus Gallagher Soft computing: A fusion of foundations, methodologies and applications . 2018,第4期

机译：黑盒优化中实施细节和参数设置的重要性：以高斯分布分布算法和圈子 - 一方面包装问题为例
2. An action-space-based global optimization algorithm for packing circles into a square container [J] . Kun He, Menglong Huang, Chenkai Yang Computers & operations research . 2015,第juna期

机译：基于动作空间的全局优化算法，用于将圆包装到方形容器中
3. Kinematic arrangement optimization of a quadruped robot with genetic algorithms [J] . Gulhan Mehmet Mert, Erbatur Kemalettin Measurement and Control: Journal of the Institute of Measurement and Control . 2018,第9a10期

机译：遗传算法的四足机器人的运动安排优化
4. An efficient algorithm for solving the Arbitrary Sized Circle Packing Problem [C] . Huang Wenqi, Fu Zhanghua, Xu Ruchu 2011 International Conference on Electronic Mechanical Engineering and Information Technology . 2011

机译：一种求解任意大小圆环堆积问题的有效算法
5. Strategies of distributed genetic algorithms for three-dimensional bin packing in a SLS machine. [D] . Lewis, James Eugene. 2003

机译：SLS机器中三维装箱的分布式遗传算法的策略。
6. Optimized intelligent control of a 2-degree of freedom robot for rehabilitation of lower limbs using neural network and genetic algorithm [O] . Wahab Aminiazar, Farid Najafi, Mohammad Ali Nekoui 2013

机译：基于神经网络和遗传算法的2自由度下肢康复机器人智能优化控制
7. Optimization of the Stator Pole Arrangement of 3-Degree of Freedom Spherical Actuator Using Genetic Algorithm [O] . Yusuke NISHIURA, Katsuhiro HIRATA, Keisuke OHYA, 2015

机译：遗传算法优化3度自由球致动器的定子极布置

Packing degree optimization of arbitrary circle arrangements by genetic algorithm

摘要

著录项

相似文献

相关主题

期刊订阅