Optimal Drilling Sequences for Rectangular Hole Matrices Using Modified Shuffled Frog Leaping Algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Dalavi Amol M.; Pawar Padmakar J.; Singh Tejinder P.; Gomes Alyssa

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2022 | Volume:33 | Issue:4 Page(s): 1-10

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Optimal Drilling Sequences for Rectangular Hole Matrices Using Modified Shuffled Frog Leaping Algorithm

Author(s)

Dalavi Amol M. | Pawar Padmakar J. | Singh Tejinder P. | Gomes Alyssa | Issue Writer Certificate

Keywords

Hole-making operations

Injection mould

modified shuffled frog leaping algorithm

advanced optimization techniques

Tool path planning

Abstract

Several industrial products such as moulds, dies, engine block, automotive parts, etc., require machining of a large number of holes. Similarly, applications like boiler plates, food-business processing separator's, printed circuit boards, drum and trammel screens, etc., consist of a matrix of a large number of holes. Many machining operations, such as drilling, enlargement, tapping, or reaming, are needed to achieve the final sizes of individual holes, resulting in a variety of possible sequences to complete the Hole-making operations. The major issue involved in Hole-making operations is the tool travel time. It is often vital to determine the optimal sequence of operations so that the overall processing cost of Hole-making operations can be minimized. In this work, thus an attempt is made to minimize the total tool travel of Hole-making operations by using a relatively new optimization algorithm known as modified shuffled frog leaping for the determination of the optimal sequence of operations. Modification is made in the present shuffled frog-leaping algorithm by using three parameters with their positive values in order to widen the search capability of the existing algorithm. This paper considers three case studies of a rectangular matrix of holes to explain the proposed procedure. The outcomes of optimization with a modified shuffled frog-leaping algorithm are compared to those obtained with the genetic algorithm and the ant colony algorithm. Additionally, the higher dimensional problem of 20 x 20 rectangular matrix of holes is considered in this work.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans