An Effective Hybrid Genetic Algorithm and Variable Neighborhood Search for Integrated Process Planning and Scheduling in a Packaging Machine Workshop

Xinyu Li, Liang Gao, Quanke Pan, Liang Wan, Kuo-Ming Chao

Research output: Contribution to journalArticle

16 Citations (Scopus)
52 Downloads (Pure)

Abstract

Process planning and scheduling are modeled sequentially in the traditional manufacturing system. However, because of their complementarity, the increasing need to integrate them has emerged to enhance the manufacturing productivity significantly. Therefore, the integrated process planning and scheduling (IPPS) is becoming a hotspot in providing a blueprint for efficient manufacturing system. This paper proposes a novel algorithm hybridizing the genetic algorithm with strong global searching ability and variable neighborhood search with strong local searching ability for the IPPS problem. To improve the searching ability, a novel procedure, encoding method, and local search method have been designed. Effective operators have been adopted. Three experiments with totally 37 well-known benchmark problems are employed to evaluate the performance of the proposed method. Based on the results, the proposed algorithm outperforms the state-of-the-art methods and finds the new solutions (the best solutions found so far) for some problems. The proposed method has also been applied on a real-world case from a nonstandard equipment production workshop for the packaging machine of a machine tool company in China. The solution demonstrates that it can solve real-world cases very well.
Original languageEnglish
Pages (from-to)(In-press)
Number of pages13
JournalIEEE Transactions on Systems, Man, and Cybernetics: Systems
Volume(In-press)
DOIs
Publication statusPublished - 10 Dec 2018

Fingerprint

Packaging machines
Process planning
Genetic algorithms
Scheduling
Blueprints
Machine tools
Productivity
Industry
Experiments

Bibliographical note

© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.

Keywords

  • Hybrid algorithm
  • Integrated process planning and scheduling (IPPS)
  • Variable neighborhood search (VNS)

Cite this

An Effective Hybrid Genetic Algorithm and Variable Neighborhood Search for Integrated Process Planning and Scheduling in a Packaging Machine Workshop. / Li, Xinyu; Gao, Liang; Pan, Quanke ; Wan, Liang ; Chao, Kuo-Ming.

In: IEEE Transactions on Systems, Man, and Cybernetics: Systems, Vol. (In-press), 10.12.2018, p. (In-press).

Research output: Contribution to journalArticle

@article{1a7c4caee27b459a88c13e4b3f7078a1,
title = "An Effective Hybrid Genetic Algorithm and Variable Neighborhood Search for Integrated Process Planning and Scheduling in a Packaging Machine Workshop",
abstract = "Process planning and scheduling are modeled sequentially in the traditional manufacturing system. However, because of their complementarity, the increasing need to integrate them has emerged to enhance the manufacturing productivity significantly. Therefore, the integrated process planning and scheduling (IPPS) is becoming a hotspot in providing a blueprint for efficient manufacturing system. This paper proposes a novel algorithm hybridizing the genetic algorithm with strong global searching ability and variable neighborhood search with strong local searching ability for the IPPS problem. To improve the searching ability, a novel procedure, encoding method, and local search method have been designed. Effective operators have been adopted. Three experiments with totally 37 well-known benchmark problems are employed to evaluate the performance of the proposed method. Based on the results, the proposed algorithm outperforms the state-of-the-art methods and finds the new solutions (the best solutions found so far) for some problems. The proposed method has also been applied on a real-world case from a nonstandard equipment production workshop for the packaging machine of a machine tool company in China. The solution demonstrates that it can solve real-world cases very well.",
keywords = "Hybrid algorithm, Integrated process planning and scheduling (IPPS), Variable neighborhood search (VNS)",
author = "Xinyu Li and Liang Gao and Quanke Pan and Liang Wan and Kuo-Ming Chao",
note = "{\circledC} 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Copyright {\circledC} and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.",
year = "2018",
month = "12",
day = "10",
doi = "10.1109/TSMC.2018.2881686",
language = "English",
volume = "(In-press)",
pages = "(In--press)",
journal = "IEEE Transactions on Systems, Man, and Cybernetics: Systems",
issn = "2168-2216",
publisher = "Institute of Electrical and Electronics Engineers",

}

TY - JOUR

T1 - An Effective Hybrid Genetic Algorithm and Variable Neighborhood Search for Integrated Process Planning and Scheduling in a Packaging Machine Workshop

AU - Li, Xinyu

AU - Gao, Liang

AU - Pan, Quanke

AU - Wan, Liang

AU - Chao, Kuo-Ming

N1 - © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.

PY - 2018/12/10

Y1 - 2018/12/10

N2 - Process planning and scheduling are modeled sequentially in the traditional manufacturing system. However, because of their complementarity, the increasing need to integrate them has emerged to enhance the manufacturing productivity significantly. Therefore, the integrated process planning and scheduling (IPPS) is becoming a hotspot in providing a blueprint for efficient manufacturing system. This paper proposes a novel algorithm hybridizing the genetic algorithm with strong global searching ability and variable neighborhood search with strong local searching ability for the IPPS problem. To improve the searching ability, a novel procedure, encoding method, and local search method have been designed. Effective operators have been adopted. Three experiments with totally 37 well-known benchmark problems are employed to evaluate the performance of the proposed method. Based on the results, the proposed algorithm outperforms the state-of-the-art methods and finds the new solutions (the best solutions found so far) for some problems. The proposed method has also been applied on a real-world case from a nonstandard equipment production workshop for the packaging machine of a machine tool company in China. The solution demonstrates that it can solve real-world cases very well.

AB - Process planning and scheduling are modeled sequentially in the traditional manufacturing system. However, because of their complementarity, the increasing need to integrate them has emerged to enhance the manufacturing productivity significantly. Therefore, the integrated process planning and scheduling (IPPS) is becoming a hotspot in providing a blueprint for efficient manufacturing system. This paper proposes a novel algorithm hybridizing the genetic algorithm with strong global searching ability and variable neighborhood search with strong local searching ability for the IPPS problem. To improve the searching ability, a novel procedure, encoding method, and local search method have been designed. Effective operators have been adopted. Three experiments with totally 37 well-known benchmark problems are employed to evaluate the performance of the proposed method. Based on the results, the proposed algorithm outperforms the state-of-the-art methods and finds the new solutions (the best solutions found so far) for some problems. The proposed method has also been applied on a real-world case from a nonstandard equipment production workshop for the packaging machine of a machine tool company in China. The solution demonstrates that it can solve real-world cases very well.

KW - Hybrid algorithm

KW - Integrated process planning and scheduling (IPPS)

KW - Variable neighborhood search (VNS)

U2 - 10.1109/TSMC.2018.2881686

DO - 10.1109/TSMC.2018.2881686

M3 - Article

VL - (In-press)

SP - (In-press)

JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems

JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems

SN - 2168-2216

ER -