IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3407646.html
   My bibliography  Save this article

Optimum Assembly Sequence Planning System Using Discrete Artificial Bee Colony Algorithm

Author

Listed:
  • Özkan Özmen
  • Turgay Batbat
  • Tolgan Özen
  • Cem Sinanoğlu
  • Ayşegül Güven

Abstract

Assembly refers both to the process of combining parts to create a structure and to the product resulting therefrom. The complexity of this process increases with the number of pieces in the assembly. This paper presents the assembly planning system design (APSD) program, a computer program developed based on a matrix-based approach and the discrete artificial bee colony (DABC) algorithm, which determines the optimum assembly sequence among numerous feasible assembly sequences (FAS). Specifically, the assembly sequences of three-dimensional (3D) parts prepared in the computer-aided design (CAD) software AutoCAD are first coded using the matrix-based methodology and the resulting FAS are assessed and the optimum assembly sequence is selected according to the assembly time optimisation criterion using DABC. The results of comparison of the performance of the proposed method with other methods proposed in the literature verify its superiority in finding the sequence with the lowest overall time. Further, examination of the results of application of APSD to assemblies consisting of parts in different numbers and shapes shows that it can select the optimum sequence from among hundreds of FAS.

Suggested Citation

  • Özkan Özmen & Turgay Batbat & Tolgan Özen & Cem Sinanoğlu & Ayşegül Güven, 2018. "Optimum Assembly Sequence Planning System Using Discrete Artificial Bee Colony Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-14, April.
  • Handle: RePEc:hin:jnlmpe:3407646
    DOI: 10.1155/2018/3407646
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/3407646.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2018/3407646.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/3407646?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:3407646. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.