A ring-mesh topology design problem for optical transport networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Youngjin | - |
dc.contributor.author | Lee, Youngho | - |
dc.contributor.author | Han, Junghee | - |
dc.date.accessioned | 2021-09-09T09:40:30Z | - |
dc.date.available | 2021-09-09T09:40:30Z | - |
dc.date.created | 2021-06-10 | - |
dc.date.issued | 2008-04 | - |
dc.identifier.issn | 1381-1231 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/123797 | - |
dc.description.abstract | This paper deals with a ring-mesh network design problem arising from the deployment of an optical transport network. The problem seeks to find an optimal clustering of traffic demands in the network such that the total cost of optical add-drop multiplexer (OADM) and optical cross-connect (OXC) is minimized, while satisfying the OADM ring capacity constraint, the node cardinality constraint, and the OXC capacity constraint. We formulate the problem as an integer programming model and propose several alternative modeling techniques designed to improve the mathematical representation of the problem. We then develop various classes of valid inequalities to tighten the mathematical formulation of the problem and describe an algorithmic approach that coordinates tailored routines with a commercial solver CPLEX. We also propose an effective tabu search procedure for finding a good feasible solution as well as for providing a good incumbent solution for the column generation based heuristic procedure that enhances the solvability of the problem. Computational results exhibit the viability of the proposed method. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.subject | CUT ALGORITHM | - |
dc.subject | ASSIGNMENT | - |
dc.subject | BRANCH | - |
dc.title | A ring-mesh topology design problem for optical transport networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Youngho | - |
dc.identifier.doi | 10.1007/s10732-007-9034-2 | - |
dc.identifier.scopusid | 2-s2.0-41149134901 | - |
dc.identifier.wosid | 000254202000004 | - |
dc.identifier.bibliographicCitation | JOURNAL OF HEURISTICS, v.14, no.2, pp.183 - 202 | - |
dc.relation.isPartOf | JOURNAL OF HEURISTICS | - |
dc.citation.title | JOURNAL OF HEURISTICS | - |
dc.citation.volume | 14 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 183 | - |
dc.citation.endPage | 202 | - |
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.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | CUT ALGORITHM | - |
dc.subject.keywordPlus | ASSIGNMENT | - |
dc.subject.keywordPlus | BRANCH | - |
dc.subject.keywordAuthor | optical transport network | - |
dc.subject.keywordAuthor | ring-mesh topology | - |
dc.subject.keywordAuthor | integer programming | - |
dc.subject.keywordAuthor | tabu search | - |
dc.subject.keywordAuthor | column generation | - |
dc.subject.keywordAuthor | valid inequality | - |
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.