File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A simulated annealing based heuristic for the multi-source single-path multi-commodity network flow problem

TitleA simulated annealing based heuristic for the multi-source single-path multi-commodity network flow problem
Authors
Wei, KaiLi, XiangyongLin, ShaochongYue, ChongfangLi, Shuqin
Keywordsbandwidth allocation
network flow problem
path selection
simulated annealing
Issue Date2014
Citation
11th International Conference on Service Systems and Service Management, ICSSSM 2014 - Proceeding, 2014, article no. 6874123 How to Cite?
DOI: http://dx.doi.org/10.1109/ICSSSM.2014.6874123
AbstractIn this paper, we introduce the multi-source single-path multi-commodity network flow problem (MSMCF), which arises in the telecommunication system. For each commodity, the MSMCF is to determine its source node, to choose a single path linking this chosen source and destination nodes, and to allocate bandwidth such that the total transportation cost is minimized. Since the MSMCF is NP-hard, we develop a simulated annealing based heuristic to solve it. We evaluate the performance of the proposed algorithm over 175 randomly generated instances. The experimental results show the proposed heuristic is an efficient and effective method for the MSMCF. © 2014 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/328718

 

DC FieldValueLanguage
dc.contributor.authorWei, Kai-
dc.contributor.authorLi, Xiangyong-
dc.contributor.authorLin, Shaochong-
dc.contributor.authorYue, Chongfang-
dc.contributor.authorLi, Shuqin-
dc.date.accessioned2023-07-22T06:23:22Z-
dc.date.available2023-07-22T06:23:22Z-
dc.date.issued2014-
dc.identifier.citation11th International Conference on Service Systems and Service Management, ICSSSM 2014 - Proceeding, 2014, article no. 6874123-
dc.identifier.urihttp://hdl.handle.net/10722/328718-
dc.description.abstractIn this paper, we introduce the multi-source single-path multi-commodity network flow problem (MSMCF), which arises in the telecommunication system. For each commodity, the MSMCF is to determine its source node, to choose a single path linking this chosen source and destination nodes, and to allocate bandwidth such that the total transportation cost is minimized. Since the MSMCF is NP-hard, we develop a simulated annealing based heuristic to solve it. We evaluate the performance of the proposed algorithm over 175 randomly generated instances. The experimental results show the proposed heuristic is an efficient and effective method for the MSMCF. © 2014 IEEE.-
dc.languageeng-
dc.relation.ispartof11th International Conference on Service Systems and Service Management, ICSSSM 2014 - Proceeding-
dc.subjectbandwidth allocation-
dc.subjectnetwork flow problem-
dc.subjectpath selection-
dc.subjectsimulated annealing-
dc.titleA simulated annealing based heuristic for the multi-source single-path multi-commodity network flow problem-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICSSSM.2014.6874123-
dc.identifier.scopuseid_2-s2.0-84906658347-
dc.identifier.spagearticle no. 6874123-
dc.identifier.epagearticle no. 6874123-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats