File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A genetic algorithm based approach to route selection and capacity flow assignment

TitleA genetic algorithm based approach to route selection and capacity flow assignment
Authors
KeywordsCapacity flow assignment
Combinatorial optimization
Genetic algorithms
Network design problems
Routing
Issue Date2003
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcom
Citation
Computer Communications, 2003, v. 26 n. 9, p. 961-974 How to Cite?
AbstractIn large-scale computer communication networks (e.g. the nowadays Internet), the assignment of link capacity and the selection of routes (or the assignment of flows) are extremely complex network optimization problems. Efficient solutions to these problems are much sought after because such solutions could lead to considerable monetary savings and better utilization of the networks. Unfortunately, as indicated by much prior theoretical research, these problems belong to the class of nonlinear combinatorial optimization problems, which are mostly (if not all) NP-hard problems. Although the traditional Lagrange relaxation and sub-gradient optimization methods can be used for tackling these problems, the results generated by these algorithms are locally optimal instead of globally optimal. In this paper, we propose a genetic algorithm based approach to providing optimized integrated solutions to the route selection and capacity flow assignment problems. With our novel formulation and genetic modeling, the proposed algorithm generates much better solutions than two well known efficient methods in our simulation studies. © 2002 Elsevier Science B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/73896
ISSN
2015 Impact Factor: 2.099
2015 SCImago Journal Rankings: 0.889
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLin, XHen_HK
dc.contributor.authorKwok, YKen_HK
dc.contributor.authorLau, VKNen_HK
dc.date.accessioned2010-09-06T06:55:49Z-
dc.date.available2010-09-06T06:55:49Z-
dc.date.issued2003en_HK
dc.identifier.citationComputer Communications, 2003, v. 26 n. 9, p. 961-974en_HK
dc.identifier.issn0140-3664en_HK
dc.identifier.urihttp://hdl.handle.net/10722/73896-
dc.description.abstractIn large-scale computer communication networks (e.g. the nowadays Internet), the assignment of link capacity and the selection of routes (or the assignment of flows) are extremely complex network optimization problems. Efficient solutions to these problems are much sought after because such solutions could lead to considerable monetary savings and better utilization of the networks. Unfortunately, as indicated by much prior theoretical research, these problems belong to the class of nonlinear combinatorial optimization problems, which are mostly (if not all) NP-hard problems. Although the traditional Lagrange relaxation and sub-gradient optimization methods can be used for tackling these problems, the results generated by these algorithms are locally optimal instead of globally optimal. In this paper, we propose a genetic algorithm based approach to providing optimized integrated solutions to the route selection and capacity flow assignment problems. With our novel formulation and genetic modeling, the proposed algorithm generates much better solutions than two well known efficient methods in our simulation studies. © 2002 Elsevier Science B.V. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comcomen_HK
dc.relation.ispartofComputer Communicationsen_HK
dc.rightsComputer Communications. Copyright © Elsevier BV.en_HK
dc.subjectCapacity flow assignmenten_HK
dc.subjectCombinatorial optimizationen_HK
dc.subjectGenetic algorithmsen_HK
dc.subjectNetwork design problemsen_HK
dc.subjectRoutingen_HK
dc.titleA genetic algorithm based approach to route selection and capacity flow assignmenten_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0140-3664&volume=26&issue=9&spage=961&epage=974&date=2003&atitle=A+Genetic+Algorithm+Based+Approach+to+Route+Selection+and+Capacity+Flow+Assignmenten_HK
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_HK
dc.identifier.authorityKwok, YK=rp00128en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/S0140-3664(02)00240-2en_HK
dc.identifier.scopuseid_2-s2.0-0038756070en_HK
dc.identifier.hkuros82091en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0038756070&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume26en_HK
dc.identifier.issue9en_HK
dc.identifier.spage961en_HK
dc.identifier.epage974en_HK
dc.identifier.isiWOS:000182813400004-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridLin, XH=50961503200en_HK
dc.identifier.scopusauthoridKwok, YK=7101857718en_HK
dc.identifier.scopusauthoridLau, VKN=7005811464en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats