An integrated approach for collection network design, capacity planning and vehicle routing in reverse logistics
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Ji-Su | - |
dc.contributor.author | Lee, Dong-Ho | - |
dc.date.accessioned | 2021-06-22T20:42:36Z | - |
dc.date.available | 2021-06-22T20:42:36Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2015-01 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/19241 | - |
dc.description.abstract | This study considers network design, capacity planning and vehicle routing for collection systems in reverse logistics. The network design and capacity planning problems are to determine the static locations and capacities of collection points as well as the dynamic allocations of demand points to the opened collection points over a planning horizon, and the vehicle routing problem is to determine the number and routes of vehicles in such a way that each collection point must be visited exactly once by one vehicle starting and terminating at the depot while satisfying the return demands at collection points and the vehicle capacity. The objective is to minimize the sum of fixed costs to open collection points and to acquire vehicles as well as variable costs to transport returns at demand points to the opened collection points and travel the opened collection points by vehicles. Unlike the location-routing problems, the integrated problem considered in this study has several features: multi-period dynamic model, capacity planning for collection points, maximum allowable collection distances, etc. To solve the integrated problem, two types of tabu search algorithms, hierarchical and integrated ones, are suggested, and their test results are reported. In particular, the efficiency of the integrated approach is shown by comparing the two algorithm types. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.title | An integrated approach for collection network design, capacity planning and vehicle routing in reverse logistics | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.doi | 10.1057/jors.2013.168 | - |
dc.identifier.scopusid | 2-s2.0-84924405949 | - |
dc.identifier.wosid | 000346281800007 | - |
dc.identifier.bibliographicCitation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.66, no.1, pp.76 - 85 | - |
dc.relation.isPartOf | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.citation.title | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.citation.volume | 66 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 76 | - |
dc.citation.endPage | 85 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | ssci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | DISTRIBUTION ISSUES | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | reverse logistics | - |
dc.subject.keywordAuthor | collection network design | - |
dc.subject.keywordAuthor | capacity planning | - |
dc.subject.keywordAuthor | vehicle routing | - |
dc.subject.keywordAuthor | tabu search | - |
dc.identifier.url | https://www.tandfonline.com/doi/full/10.1057/jors.2013.168 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.