IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v57y2019i18p5874-5891.html
   My bibliography  Save this article

A MCVRP-based model for PCB assembly optimisation on the beam-type placement machine

Author

Listed:
  • Shujuan Guo
  • Fei Geng
  • Katsuhiko Takahashi
  • Xiaohan Wang
  • Zhihong Jin

Abstract

The beam-type placement machine is capable of picking up multiple components simultaneously from the feeders in printed circuit board (PCB) assembly. Simultaneous pickup occurs only if the heads in the beam are aligned with the feeders and the nozzle-types on these heads match with the component-types on the feeders. In order to minimise the assembly cycle time, the optimisation problem is decomposed into two sub-problems, the pickup combination and sequencing problem, and the placement cluster and sequencing problem. These two sub-problems are simultaneously solved by the proposed hybrid genetic algorithm (HGA). The pickup combination and sequencing problem is similar to the popular multi-compartment vehicle routing problem (MCVRP); a genetic algorithm (GA) for the MCVRP is therefore modified and applied to solving the pickup combination and sequencing problem. A greedy heuristic algorithm is used to solve the placement cluster and sequencing problem. The numerical experiments reveal that the HGA outperforms the algorithms proposed by previous papers.

Suggested Citation

  • Shujuan Guo & Fei Geng & Katsuhiko Takahashi & Xiaohan Wang & Zhihong Jin, 2019. "A MCVRP-based model for PCB assembly optimisation on the beam-type placement machine," International Journal of Production Research, Taylor & Francis Journals, vol. 57(18), pages 5874-5891, September.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:18:p:5874-5891
    DOI: 10.1080/00207543.2018.1555380
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1555380
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1555380?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.

    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:taf:tprsxx:v:57:y:2019:i:18:p:5874-5891. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.