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

Multi-objective sequence optimization of PCB component assembly with GA based on the discrete Fréchet distance

Author

Listed:
  • Guang-Yu Zhu
  • Xue-Wei Ju
  • Wei-Bo Zhang

Abstract

A new mechanism，namely a combination of curve matching method based on the discrete Fréchet distance and evolutionary algorithms，is proposed to solve pick-and-place sequence optimisation problems as a multi-objective optimisation problem. The essence of the mechanism is to accomplish the comparison of objective vectors with curve matching method. The objective vector is mapped into the array of points with a binary mapping operator and the discrete Fréchet distance is utilised to measure the similarity between the reference array of points and the comparison array of points. The genetic algorithm based on the discrete Fréchet distance (FGA) is proposed. To test the new mechanism, together with FGA, three other test algorithms are selected to solve the sequence optimisation problem. The simulation results indicate that FGA outperforms other algorithms. This new mechanism is rational and feasible for multi-objective pick-and-place sequence optimisation problems.

Suggested Citation

  • Guang-Yu Zhu & Xue-Wei Ju & Wei-Bo Zhang, 2018. "Multi-objective sequence optimization of PCB component assembly with GA based on the discrete Fréchet distance," International Journal of Production Research, Taylor & Francis Journals, vol. 56(11), pages 4017-4034, June.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:11:p:4017-4034
    DOI: 10.1080/00207543.2018.1440091
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1440091
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1440091?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:56:y:2018:i:11:p:4017-4034. 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.