A simulated annealing algorithm with neighbourhood list for capacitated dynamic lot-sizing problem with returns and hybrid products
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Koken, Pakayse | - |
dc.contributor.author | Seok, Hyesung | - |
dc.contributor.author | Yoon, Sang Won | - |
dc.date.available | 2020-07-10T04:40:53Z | - |
dc.date.created | 2020-07-06 | - |
dc.date.issued | 2018 | - |
dc.identifier.issn | 0951-192X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/4814 | - |
dc.description.abstract | This research addresses the capacitated dynamic lot-sizing problem with returns and hybrid products (CLSPRH). The problem is to identify how many of each product type to produce during each period for a hybrid system with manufacturing capacity constraints. The objective of CLSPRH is to maximise total profit of the production system that consists of new, remanufactured and hybrid products. CLSPRH is a multi-period CLSP, which is modelled as a mixed-integer nonlinear programming problem. The traditional CLSP is NP-hard, and the nonlinearity of CLSPRH makes the problem even harder to solve. Therefore, a Simulated Annealing (SA) algorithm with a neighbourhood list (SA_NL) is proposed. By using a list of several neighbourhoods, the SA algorithm is improved. SA_NL is compared to SA, three variants of Genetic Algorithm (GA) and a Variable Neighbourhood Search (VNS) algorithm. The variants of GA are GA with one-point crossover (GA(OP)), GA with two-point crossover (GA(TP)) and GA with one-point period-based crossover (GA(OPPB)). Over all instances, the results show that the proposed SA_NL outperforms SA, VNS, GA(OP), GA(TP) and GA(OPPB) by 0.54%, 0.34%, 1.92%, 1.78% and 2.92%, respectively. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.subject | OVERTIME DECISIONS | - |
dc.subject | LOADING PROBLEM | - |
dc.subject | SUPPLY CHAIN | - |
dc.subject | SINGLE-ITEM | - |
dc.subject | TABU SEARCH | - |
dc.subject | SETUP TIMES | - |
dc.subject | HEURISTICS | - |
dc.subject | MODELS | - |
dc.subject | RECOVERY | - |
dc.title | A simulated annealing algorithm with neighbourhood list for capacitated dynamic lot-sizing problem with returns and hybrid products | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Seok, Hyesung | - |
dc.identifier.doi | 10.1080/0951192X.2017.1413250 | - |
dc.identifier.scopusid | 2-s2.0-85037732999 | - |
dc.identifier.wosid | 000436966300007 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, v.31, no.8, pp.739 - 747 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING | - |
dc.citation.title | INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING | - |
dc.citation.volume | 31 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 739 | - |
dc.citation.endPage | 747 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | OVERTIME DECISIONS | - |
dc.subject.keywordPlus | LOADING PROBLEM | - |
dc.subject.keywordPlus | SUPPLY CHAIN | - |
dc.subject.keywordPlus | SINGLE-ITEM | - |
dc.subject.keywordPlus | TABU SEARCH | - |
dc.subject.keywordPlus | SETUP TIMES | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordPlus | MODELS | - |
dc.subject.keywordPlus | RECOVERY | - |
dc.subject.keywordAuthor | Remanufacturing | - |
dc.subject.keywordAuthor | inventory and production control | - |
dc.subject.keywordAuthor | mixed-integer nonlinear programming | - |
dc.subject.keywordAuthor | metaheuristics | - |
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.