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

Improved dual-population genetic algorithm to solve human–robot collaborative assembly line balancing problem

Author

Listed:
  • Jiahong Cai
  • Haoyun Xue
  • Chengye Zheng
  • Hongyan Shi

Abstract

The human–robot collaborative assembly line has been applied as an effective strategy in production to further improve the efficiency, adaptability, and flexibility. The assembly line balancing is an important part of assembly line design and optimisation. However, the current research often neglects the key factor of the number of stations, which lacks better guidance for the actual assembly line design and optimisation. To provide a better practical reference, this research first takes the number of stations, the makespan and the balance ratio as the optimisation objectives, and constructs a corresponding model. Then, an improved dual-population genetic algorithm is designed to solve the problem more efficiently. This algorithm optimises multiple operators based on the traditional genetic algorithm. The efficacy of the proposed algorithm is substantiated through numerical experimentation with three traditional heuristic algorithms. The experimental results show that the improved algorithm has superior performance in solving the human–robot collaborative assembly line balancing problem. On the one hand, the average improvement of fitness in different scale cases reaches 3.14% (up to 52.33%), and the distribution of solutions is more stable. On the other hand, the convergence speed is faster, the average reduction of convergence time is 11.50% (up to 88.24%).

Suggested Citation

  • Jiahong Cai & Haoyun Xue & Chengye Zheng & Hongyan Shi, 2025. "Improved dual-population genetic algorithm to solve human–robot collaborative assembly line balancing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 63(17), pages 6452-6474, September.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:17:p:6452-6474
    DOI: 10.1080/00207543.2025.2473067
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2025.2473067
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2025.2473067?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

    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:63:y:2025:i:17:p:6452-6474. 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.