Evolving ant colony system for large-sized integrated process planning and scheduling problem considering sequence-dependent setup times
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ha, Chunghun | - |
dc.date.available | 2021-03-17T06:50:25Z | - |
dc.date.created | 2021-02-26 | - |
dc.date.issued | 2020-09 | - |
dc.identifier.issn | 1936-6582 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/11580 | - |
dc.description.abstract | This paper proposes a new ant colony optimization (ACO) algorithm suitable for integrated process planning and scheduling (IPPS) that optimizes both process planning and scheduling simultaneously. The IPPS covered in this study, when compared to the conventional IPPS, is more flexible and complicated because sequence-dependent setups and tool-related capacity constraints are additionally considered. Traditional ACOs have limitations in improving the solution quality and computation time for IPPS. The high flexibility and complexity of IPPS requires a large size of repository for pheromone trails and it causes the long computation time for updating them, excessive evaporation of pheromones, and unbalancing between pheromones and desirability. In the proposed ACO, each ant agent improves their own incumbent solution or finds a new solution using the pheromone trails that is composed of the experience information of the colony. Therefore, the proposed ACO conducts individual and cooperative evolving at the same time. Furthermore, we propose a simplified updating rule for pheromone trails and standardization of the transition probability to increase efficiency of the algorithm. Experimental results show that the proposed ACO is superior to recently proposed meta-heuristics for benchmark problems of different sizes in terms of both solution quality and computation time. | - |
dc.publisher | SPRINGER | - |
dc.title | Evolving ant colony system for large-sized integrated process planning and scheduling problem considering sequence-dependent setup times | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Ha, Chunghun | - |
dc.identifier.doi | 10.1007/s10696-019-09360-9 | - |
dc.identifier.scopusid | 2-s2.0-85066780319 | - |
dc.identifier.wosid | 000560460600002 | - |
dc.identifier.bibliographicCitation | FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, v.32, no.3, pp.523 - 560 | - |
dc.relation.isPartOf | FLEXIBLE SERVICES AND MANUFACTURING JOURNAL | - |
dc.citation.title | FLEXIBLE SERVICES AND MANUFACTURING JOURNAL | - |
dc.citation.volume | 32 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 523 | - |
dc.citation.endPage | 560 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | PARTICLE SWARM OPTIMIZATION | - |
dc.subject.keywordPlus | GENETIC ALGORITHM | - |
dc.subject.keywordPlus | PROCESS PLANS | - |
dc.subject.keywordAuthor | Integrated process planning and scheduling problem | - |
dc.subject.keywordAuthor | Ant colony optimization | - |
dc.subject.keywordAuthor | Sequence-dependent setup | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.