IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-981-33-4359-7_64.html
   My bibliography  Save this book chapter

Balancing Optimization of Mixed-Flow Assembly Line Based on Hybrid Genetic Algorithm

In: Liss 2020

Author

Listed:
  • Meng Li

    (Beijing Jiaotong University)

  • Dan Chang

    (Beijing Jiaotong University)

Abstract

The balancing problem of the assembly line is a typical NP-hard problem and one of the most important problems to be solved by manufacturing companies. For the disadvantages that genetic algorithms are prone to local optimal solutions and precociousness in the optimization process, the article focuses on the second type of balancing issues for mixed-flow assembly lines. A hybrid genetic algorithm was designed and constructed to combine three evaluation metrics: the smoothing index, the equilibrium loss coefficient and the imbalance coefficient of the adaptation function, combining the simulated annealing algorithm with a genetic algorithm to speed up convergence to obtain a global optimal solution. Finally, a mixed-flow assembly line of Company L is used as an example to solve the equilibrium of the assembly line using the designed hybrid genetic algorithm for improvement and optimization. And also demonstrates that the method is suitable for solving balance problems in mixed-flow assembly lines.

Suggested Citation

  • Meng Li & Dan Chang, 2021. "Balancing Optimization of Mixed-Flow Assembly Line Based on Hybrid Genetic Algorithm," Springer Books, in: Shifeng Liu & Gábor Bohács & Xianliang Shi & Xiaopu Shang & Anqiang Huang (ed.), Liss 2020, pages 931-946, Springer.
  • Handle: RePEc:spr:sprchp:978-981-33-4359-7_64
    DOI: 10.1007/978-981-33-4359-7_64
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:sprchp:978-981-33-4359-7_64. 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: 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.