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

Quantum-inspired ant colony optimisation algorithm for a two-stage permutation flow shop with batch processing machines

Author

Listed:
  • Zhen Chen
  • Xu Zheng
  • Shengchao Zhou
  • Chuang Liu
  • Huaping Chen

Abstract

This paper studied two-stage permutation flow shop problems with batch processing machines, considering different job sizes and arbitrary arrival times, with the optimisation objective of minimising the makespan. The quantum-inspired ant colony optimisation (QIACO) algorithm was proposed to solve the problem. In the QIACO algorithm, the ants are divided into two groups: one group selects the largest job in terms of job size as the initial job for each batch and the other group selects the smallest job as the initial job for each batch. Each group of ants has its own pheromone matrix. In the computational experiment, our novel algorithm was compared with the hybrid discrete differential evolution (HDDE) algorithm and the batch-based hybrid ant colony optimisation (BHACO) algorithm. Although the HDDE algorithm has a shorter run time, the quality of the solution for large-scale jobs is not good, while the BHACO algorithm always obtains a better solution but requires a longer run time. The computational results show that the QIACO algorithm embedded in the quantum information has advantages in terms of both solution quality and running time.

Suggested Citation

  • Zhen Chen & Xu Zheng & Shengchao Zhou & Chuang Liu & Huaping Chen, 2020. "Quantum-inspired ant colony optimisation algorithm for a two-stage permutation flow shop with batch processing machines," International Journal of Production Research, Taylor & Francis Journals, vol. 58(19), pages 5945-5963, October.
    • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:19:p:5945-5963
    DOI: 10.1080/00207543.2019.1661535
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1661535
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2019.1661535?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:58:y:2020:i:19:p:5945-5963. 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.