<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Collection:</title>
    <link>http://localhost:8080/xmlui/handle/123456789/2915</link>
    <description />
    <pubDate>Tue, 23 Jun 2026 06:28:56 GMT</pubDate>
    <dc:date>2026-06-23T06:28:56Z</dc:date>
    <item>
      <title>Tool path planning of hole-making operations in ejector plate of injection mould using modified shuffled frog leaping algorithm</title>
      <link>http://localhost:8080/xmlui/handle/123456789/2916</link>
      <description>Title: Tool path planning of hole-making operations in ejector plate of injection mould using modified shuffled frog leaping algorithm
Abstract: Optimization of hole-making operations in manufacturing industry plays a vital role. Tool travel and tool switch planning are the two major&#xD;
issues in hole-making operations. Many industrial applications such as moulds, dies, engine block, automotive parts etc. requires machining of&#xD;
large number of holes. Large number of machining operations like drilling, enlargement or tapping/reaming are required to achieve the final size&#xD;
of individual hole, which gives rise to number of possible sequences to complete hole-making operations on the part depending upon the location&#xD;
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&#xD;
hole-making operations. In this work, therefore an attempt is made to reduce the total processing cost of hole-making operations by applying&#xD;
relatively new optimization algorithms known as shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm for the&#xD;
determination of optimal sequence of hole-making operations. An industrial application example of ejector plate of injection mould is considered&#xD;
in this work to demonstrate the proposed approach. The obtained results by the shuffled frog leaping algorithm and proposed modified shuffled&#xD;
frog leaping algorithm are compared with each other. It is seen from the obtained results that the results of proposed modified shuffled frog&#xD;
leaping algorithm are superior to those obtained using shuffled frog leaping algorithm.</description>
      <pubDate>Wed, 06 Apr 2016 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/2916</guid>
      <dc:date>2016-04-06T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

