optimal drilling sequences for rectangular hole matrices using modified shuffled frog leaping algorithm

Several industrial products, including engine blocks, moulds, automotive parts, dies, etc., require many holes to be machined into them. similarly, applications like processing separators in the food industry, printed circuit boards, drum and trammel screens, boilerplates, etc., also contain a large matrix of holes. many machining operations, such as drilling, tapping, and reaming, are needed to achieve the required hole diameters, which various operational sequences can produce. one of the biggest hassles with hole-making operations is optimizing the sequence of operations to achieve minimal tool travel time. this is essential in reducing the overall processing costs associated with hole-making operations. the present work attempts to minimize the total tool travel time for hole-drilling operations by employing a relatively new nature-inspired optimization algorithm - the modified shuffled frog leaping algorithm (sfla). the modifications in sfla are introduced using three positive parameters to broaden its search capacity. this paper considers three case studies of a rectangular matrix of holes to explain the proposed procedure. the outcomes of the optimization using modified sfla are compared to those obtained using a genetic algorithm and the ant colony algorithm. additionally, a higher dimensional problem of a 20x20 rectangular matrix of holes is considered in this work.