標題: A genetic algorithm for the maximum edge-disjoint paths problem
作者: Hsu, Chia-Chun
Cho, Hsun-Jung
運輸與物流管理系 註:原交通所+運管所
Department of Transportation and Logistics Management
公開日期: 19-Jan-2015
摘要: Optimization problems concerning edge-disjoint paths have attracted considerable attention for decades. These problems have a lot of applications in the areas of call admission control, real-time communication, VLSI (Very-large-scale integration) layout and reconfiguration, packing, etc. The maximum edge-disjoint paths problem (MEDP) seems to lie in the heart of these problems. Given an undirected graph G and a set of I connection requests, each request consists of a pair of nodes, MEDP is an NP-hard problem which determines the maximum number of accepted requests that can be routed by mutually edge-disjoint (s(i),t(i)) paths. We propose a genetic algorithm (GA) to solve the problem. In comparison to the multi-start simple greedy algorithm (MSGA) and the ant colony optimization method (ACO), the proposed GA method performs better in most of the instances in terms of solution quality and time. (C) 2014 Elsevier B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/j.neucom.2012.10.046
http://hdl.handle.net/11536/25301
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2012.10.046
期刊: NEUROCOMPUTING
Volume: 148
Issue: 
起始頁: 17
結束頁: 22
Appears in Collections:Articles