IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i8p1235-d1631103.html
   My bibliography  Save this article

Modeling and Optimization of Cable Production Scheduling by Incorporating an Ant Colony Algorithm

Author

Listed:
  • Changbiao Zhu

    (School of Mechanical Engineering, Southeast University, Nanjing 211189, China
    Anhui Cable Co., Ltd., Tianchang 239300, China)

  • Chongxin Wang

    (School of Mechanical Engineering, Southeast University, Nanjing 211189, China)

  • Zhonghua Ni

    (School of Mechanical Engineering, Southeast University, Nanjing 211189, China)

  • Xiaojun Liu

    (School of Mechanical Engineering, Southeast University, Nanjing 211189, China
    Engineering Research Center of New Light Sources Technology and Equipment, Ministry of Education, Southeast University, Nanjing 210018, China)

  • Abbas Raza

    (School of Mechanical Engineering, Southeast University, Nanjing 211189, China)

Abstract

With the development of small batch and multi-batch service production mode, manual scheduling by hand has been difficult to adapt to the production of a large number of complex orders. This work proposed a cable production scheduling optimization method based on an ant colony algorithm, aiming at solving the problems of the inefficiency and underutilization of resources in the process of traditional cable scheduling. Applying an ant colony (ACO) algorithm to solve the production scheduling problem achieved the intelligent scheduling and optimization of production tasks. The method utilizes the search and optimization capabilities of the ant colony algorithm, with the characteristics of the cable production line, achieving a reasonable allocation and scheduling of production tasks. After applying the proposed model to the cable production line, the scheduling scheme generated by the ACO algorithm-based objective order scheduling method reduced the total production time required from 3 days to 2.6882 days, resulting in a 10.04% increase in production efficiency. The results show that the method can effectively improve the production efficiency and resource utilization of the cable production line, and has high practicality and feasibility.

Suggested Citation

  • Changbiao Zhu & Chongxin Wang & Zhonghua Ni & Xiaojun Liu & Abbas Raza, 2025. "Modeling and Optimization of Cable Production Scheduling by Incorporating an Ant Colony Algorithm," Mathematics, MDPI, vol. 13(8), pages 1-26, April.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:8:p:1235-:d:1631103
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/8/1235/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/8/1235/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:8:p:1235-:d:1631103. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.