完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHsu, Chia-Chunen_US
dc.contributor.authorCho, Hsun-Jungen_US
dc.contributor.authorFang, Shu-Cherngen_US
dc.date.accessioned2018-08-21T05:53:55Z-
dc.date.available2018-08-21T05:53:55Z-
dc.date.issued2017-04-01en_US
dc.identifier.issn1547-5816en_US
dc.identifier.urihttp://dx.doi.org/10.3934/jimo.2016062en_US
dc.identifier.urihttp://hdl.handle.net/11536/145329-
dc.description.abstractThe routing and wavelength assignment (RWA) problem in wavelength-division multiplexing optical networks is critically important for increasing the efficiency of wavelength-routed all-optical networks. Given the physical network structure and a set of connection requests, the problem aims to establishing routes for the requests and assigning a wavelength to each of them, subject to the wavelength continuous and wavelength clash constraints. The objective is to minimize he number of required wavelengths to satisfy all requests. The RWA problem was proven to be NP-hard and has been investigated for decades. In this paper, an algorithm based on the maximum edge-disjoint paths is proposed to tackle the RWA problem. Its performance is verified by experiments on some realistic network topologies. Compared with the state-of-the-art bin-packing based methods and the particle swarm optimization al- gorithm, the proposed method can find the best solution among all testing instances in reasonable computing time.en_US
dc.language.isoen_USen_US
dc.subjectEdge-disjoint pathsen_US
dc.subjectMEDPen_US
dc.subjectrouting and wavelength assignment problemen_US
dc.subjectRWAen_US
dc.titleSOLVING ROUTING AND WAVELENGTH ASSIGNMENT PROBLEM WITH MAXIMUM EDGE-DISJOINT PATHSen_US
dc.typeArticleen_US
dc.identifier.doi10.3934/jimo.2016062en_US
dc.identifier.journalJOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATIONen_US
dc.citation.volume13en_US
dc.citation.spage1065en_US
dc.citation.epage1084en_US
dc.contributor.department運輸與物流管理系 註:原交通所+運管所zh_TW
dc.contributor.departmentDepartment of Transportation and Logistics Managementen_US
dc.identifier.wosnumberWOS:000398815200033en_US
顯示於類別:期刊論文