• Proceedings of the Korean Geotechical Society Conference
• /
• 1999.03a
• /
• pp.315-322
• /
• 1999

The probabilistic keyblock concept which was based upon block theory was applied to the example site by using the observed block moulds data. The more was the block failure likelihood (P(B)) which was defined by the product of the joint combination probability, the shape parameter and the instability parameter, the more were the frequencies of failures observed. If we can acquire these data during a tunnel construction stage, they will be used as a very useful data to construct another tunnel in the neighborhood. Furthermore, a sedimentary rock may have larger P(B) values than a crystalline rock, and for the given P(B) value, the percent block moulds are larger in the former than latter.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.266-273
• /
• 2016

Optimization of hole-making operations in manufacturing industry plays a vital role. Tool travel and tool switch planning are the two major issues in hole-making operations. Many industrial applications such as moulds, dies, engine block, automotive parts etc. requires machining of large number of holes. Large number of machining operations like drilling, enlargement or tapping/reaming are required to achieve the final size of individual hole, which gives rise to number of possible sequences to complete hole-making operations on the part depending upon the location of hole and tool sequence to be followed. It is necessary to find the optimal sequence of operations which minimizes the total processing cost of hole-making operations. In this work, therefore an attempt is made to reduce the total processing cost of hole-making operations by applying relatively new optimization algorithms known as shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm for the determination of optimal sequence of hole-making operations. An industrial application example of ejector plate of injection mould is considered in this work to demonstrate the proposed approach. The obtained results by the shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm are compared with each other. It is seen from the obtained results that the results of proposed modified shuffled frog leaping algorithm are superior to those obtained using shuffled frog leaping algorithm.