IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v57y2020i3d10.1007_s12597-020-00441-0.html
   My bibliography  Save this article

Optimization of the multi-hole drilling path sequence for concentric circular patterns

Author

Listed:
  • Sunny Diyaley

    (Sikkim Manipal Institute of Technology)

  • Abhiraj Aditya

    (Jadavpur University)

  • Shankar Chakraborty

    (Jadavpur University)

Abstract

Determination of the optimal path sequence in a multi-hole drilling operation is a challenging task in a manufacturing industry as it facilitates substantial reduction in tool travel distance (path length), machining time and machining cost. It is quite analogous to the travelling salesman problem, which is one of the most fundamental NP-hard optimization problems. In this paper, six well-known metaheuristics, i.e. ant colony optimization, artificial bee colony algorithm, particle swarm optimization, firefly algorithm, differential evolution and teaching learning-based optimization algorithm are applied to determine the optimal path sequences in computer numerically controlled multi-hole drilling operations. Two layouts consisting of four and five concentric circular patterns, and a heat exchanger tube sheet with 2600 holes are considered here as three different test problems. The minimum drill path lengths as estimated using these algorithms are observed to be better than that as determined by the spiral path method. Amongst them, teaching learning-based optimization algorithm performs best with respect to the derived optimal path length, consistency of the solution, convergence speed and computational time. Its distinctiveness over the others is also validated using the paired t-test.

Suggested Citation

  • Sunny Diyaley & Abhiraj Aditya & Shankar Chakraborty, 2020. "Optimization of the multi-hole drilling path sequence for concentric circular patterns," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 746-764, September.
    • Handle: RePEc:spr:opsear:v:57:y:2020:i:3:d:10.1007_s12597-020-00441-0
    DOI: 10.1007/s12597-020-00441-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-020-00441-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-020-00441-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. W. C. E. Lim & G. Kanagaraj & S. G. Ponnambalam, 2016. "A hybrid cuckoo search-genetic algorithm for hole-making sequence optimization," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 417-429, April.
    2. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vijay Rathod, 2023. "Multi-drill path sequencing models: A comparative study," OPSEARCH, Springer;Operational Research Society of India, vol. 60(1), pages 554-570, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dongni Li & Xianwen Meng & Miao Li & Yunna Tian, 2016. "An ACO-based intercell scheduling approach for job shop cells with multiple single processing machines and one batch processing machine," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 283-296, April.
    2. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    3. Vijay Rathod, 2023. "Multi-drill path sequencing models: A comparative study," OPSEARCH, Springer;Operational Research Society of India, vol. 60(1), pages 554-570, March.
    4. García-Villoria, Alberto & Domenech, Bruno & Ferrer-Martí, Laia & Juanpera, Marc & Pastor, Rafael, 2020. "Ad-hoc heuristic for design of wind-photovoltaic electrification systems, including management constraints," Energy, Elsevier, vol. 212(C).
    5. Dimitris Fotakis & Epameinondas Sidiropoulos, 2014. "Combined land-use and water allocation planning," Annals of Operations Research, Springer, vol. 219(1), pages 169-185, August.
    6. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    7. Sehyun Tak & Jeongyun Kim & Donghoun Lee, 2022. "Study on the Extraction Method of Sub-Network for Optimal Operation of Connected and Automated Vehicle-Based Mobility Service and Its Implication," Sustainability, MDPI, vol. 14(6), pages 1-28, March.
    8. Angel A. Juan & Helena Ramalhinho-Lourenço & Manuel Mateo & Quim Castellà & Barry B. Barrios, 2012. "ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem," Economics Working Papers 1319, Department of Economics and Business, Universitat Pompeu Fabra.
    9. Ranaboldo, Matteo & Ferrer-Martí, Laia & García-Villoria, Alberto & Pastor Moreno, Rafael, 2013. "Heuristic indicators for the design of community off-grid electrification systems based on multiple renewable energies," Energy, Elsevier, vol. 50(C), pages 501-512.
    10. Raghav Prasad Parouha & Pooja Verma, 2022. "An innovative hybrid algorithm for bound-unconstrained optimization problems and applications," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1273-1336, June.
    11. Christina Iliopoulou & Konstantinos Kepaptsoglou & Eleni Vlahogianni, 2019. "Metaheuristics for the transit route network design problem: a review and comparative analysis," Public Transport, Springer, vol. 11(3), pages 487-521, October.
    12. Jean-Yves Potvin, 2009. "State-of-the Art Review ---Evolutionary Algorithms for Vehicle Routing," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 518-548, November.
    13. Jann Michael Weinand & Kenneth Sorensen & Pablo San Segundo & Max Kleinebrahm & Russell McKenna, 2020. "Research trends in combinatorial optimisation," Papers 2012.01294, arXiv.org.
    14. Yiying Zhang & Aining Chi, 2023. "Group teaching optimization algorithm with information sharing for numerical optimization and engineering optimization," Journal of Intelligent Manufacturing, Springer, vol. 34(4), pages 1547-1571, April.
    15. Mejía-de-Dios, Jesús-Adolfo & Mezura-Montes, Efrén & Toledo-Hernández, Porfirio, 2022. "Pseudo-feasible solutions in evolutionary bilevel optimization: Test problems and performance assessment," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    16. Ranaboldo, Matteo & García-Villoria, Alberto & Ferrer-Martí, Laia & Pastor Moreno, Rafael, 2014. "A heuristic method to design autonomous village electrification projects with renewable energies," Energy, Elsevier, vol. 73(C), pages 96-109.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:opsear:v:57:y:2020:i:3:d:10.1007_s12597-020-00441-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.