A two-level location-allocation problem in designing local access fiber optic networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, Gigyoung | - |
dc.contributor.author | Lee, Youngho | - |
dc.contributor.author | Han, Junghee | - |
dc.date.accessioned | 2021-09-05T03:25:58Z | - |
dc.date.available | 2021-09-05T03:25:58Z | - |
dc.date.created | 2021-06-15 | - |
dc.date.issued | 2014-11 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/96903 | - |
dc.description.abstract | This paper deals with a two-level facility location-allocation problem on tree topology arising from the design of access networks. The access network design problem seeks to find an optimal location of switch and allocation of demands such that the total cost of switch and fiber cable is minimized, while satisfying switch port constraint, switch capacity constraint, and no-split routing constraint. The problem is formulated as a mixed-integer programming model and alternative formulations are developed by the reformulation-linearization technique (RLT) for improving computational effectiveness. By exploiting the tree structure of the problem, we develop some valid inequalities that have complementary strength and devise separation problems for finding effective valid inequalities that cut off fractional LP solutions. Also, we develop an effective MIP-based tree partitioning heuristic for finding good quality solutions for large size problems. Computational results demonstrate the efficacy of the valid inequalities and the proposed heuristic. (C) 2014 Elsevier Ltd. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | RELAXATIONS | - |
dc.subject | FORMULATIONS | - |
dc.subject | HIERARCHY | - |
dc.subject | SINGLE | - |
dc.title | A two-level location-allocation problem in designing local access fiber optic networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Youngho | - |
dc.identifier.doi | 10.1016/j.cor.2014.05.005 | - |
dc.identifier.scopusid | 2-s2.0-84902181823 | - |
dc.identifier.wosid | 000341473200006 | - |
dc.identifier.bibliographicCitation | COMPUTERS & OPERATIONS RESEARCH, v.51, pp.52 - 63 | - |
dc.relation.isPartOf | COMPUTERS & OPERATIONS RESEARCH | - |
dc.citation.title | COMPUTERS & OPERATIONS RESEARCH | - |
dc.citation.volume | 51 | - |
dc.citation.startPage | 52 | - |
dc.citation.endPage | 63 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
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, Industrial | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | RELAXATIONS | - |
dc.subject.keywordPlus | FORMULATIONS | - |
dc.subject.keywordPlus | HIERARCHY | - |
dc.subject.keywordPlus | SINGLE | - |
dc.subject.keywordAuthor | Access networks | - |
dc.subject.keywordAuthor | Fiber optic access networks | - |
dc.subject.keywordAuthor | MIP-based tree partitioning heuristic | - |
dc.subject.keywordAuthor | Mixed integer programming | - |
dc.subject.keywordAuthor | Reformulation- linearization technique (RLT) | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea 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.