A tabu search algorithm for the routing and capacity assignment problem in computer networks

A tabu search metaheuristic algorithm for a classical routing and capacity assignment (CFA) problem in computer networks is presented in this paper. Computational experiments across a variety of networks are reported. The results show that the proposed tabu search algorithm is both effective and eff...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2005-11, Vol.32 (11), p.2785-2800
Main Authors: Shen, Jian, Xu, Fuyong, Zheng, Peng
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Combinatorial optimization
Computer networks
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Optimization techniques
Routing
Routing and capacity assignment
Searches
Studies
Tabu search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c385t-49754b053487cfcb960cd6d069f768da11a26e828c4105a7ac63cc6b8e2f863f3
cites cdi_FETCH-LOGICAL-c385t-49754b053487cfcb960cd6d069f768da11a26e828c4105a7ac63cc6b8e2f863f3
container_end_page 2800
container_issue 11
container_start_page 2785
container_title Computers & operations research
container_volume 32
creator Shen, Jian
Xu, Fuyong
Zheng, Peng
description A tabu search metaheuristic algorithm for a classical routing and capacity assignment (CFA) problem in computer networks is presented in this paper. Computational experiments across a variety of networks are reported. The results show that the proposed tabu search algorithm is both effective and efficient in finding good solutions of the CFA problem compared with the traditional Lagrangean relaxation and subgradient optimization technique. Extensive tests are made in order to choose the best values of the parameters for tabu search algorithm.
doi_str_mv 10.1016/j.cor.2004.04.004
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29694122</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054804000784</els_id><sourcerecordid>801606061</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-49754b053487cfcb960cd6d069f768da11a26e828c4105a7ac63cc6b8e2f863f3</originalsourceid><addsrcrecordid>eNp9kUGLFDEQhYMoOI7-AG9B0FuPSTpJp_G0LKu7sOBFwYMQ0tXVMxm7kzFJK_vvzTALggeLgrp871XxipDXnO044_r9cQcx7QRjcnduJp-QDTdd23RafXtKNqxlqmFKmufkRc5HVqsTfEO-X9HihpVmdAkO1M37mHw5LHSKiZYD0hTX4sOeujBScCcHvjxQl7PfhwVDoacUhxkX6gOFuJzWgokGLL9j-pFfkmeTmzO-epxb8vXjzZfr2-b-86e766v7BlqjSiP7TsmBqVaaDiYYes1g1CPT_dRpMzrOndBohAHJmXKdA90C6MGgmIxup3ZL3l186zE_V8zFLj4DzrMLGNdsRa97yYWo4Jt_wGNcU6i3Wd4rI3krVYX4BYIUc0442VPyi0sPljN7DtsebQ3bnsO252ayat4-GrsMbp6SC-DzX6E2XIr6ji35cOGwxvHLY7IZPAbA0SeEYsfo_7PlD9pblI8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195841345</pqid></control><display><type>article</type><title>A tabu search algorithm for the routing and capacity assignment problem in computer networks</title><source>ScienceDirect Freedom Collection</source><creator>Shen, Jian ; Xu, Fuyong ; Zheng, Peng</creator><creatorcontrib>Shen, Jian ; Xu, Fuyong ; Zheng, Peng</creatorcontrib><description>A tabu search metaheuristic algorithm for a classical routing and capacity assignment (CFA) problem in computer networks is presented in this paper. Computational experiments across a variety of networks are reported. The results show that the proposed tabu search algorithm is both effective and efficient in finding good solutions of the CFA problem compared with the traditional Lagrangean relaxation and subgradient optimization technique. Extensive tests are made in order to choose the best values of the parameters for tabu search algorithm.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2004.04.004</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>Algorithms ; Applied sciences ; Combinatorial optimization ; Computer networks ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimization ; Optimization techniques ; Routing ; Routing and capacity assignment ; Searches ; Studies ; Tabu search</subject><ispartof>Computers &amp; operations research, 2005-11, Vol.32 (11), p.2785-2800</ispartof><rights>2004 Elsevier Ltd</rights><rights>2005 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Nov 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-49754b053487cfcb960cd6d069f768da11a26e828c4105a7ac63cc6b8e2f863f3</citedby><cites>FETCH-LOGICAL-c385t-49754b053487cfcb960cd6d069f768da11a26e828c4105a7ac63cc6b8e2f863f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16814287$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Shen, Jian</creatorcontrib><creatorcontrib>Xu, Fuyong</creatorcontrib><creatorcontrib>Zheng, Peng</creatorcontrib><title>A tabu search algorithm for the routing and capacity assignment problem in computer networks</title><title>Computers &amp; operations research</title><description>A tabu search metaheuristic algorithm for a classical routing and capacity assignment (CFA) problem in computer networks is presented in this paper. Computational experiments across a variety of networks are reported. The results show that the proposed tabu search algorithm is both effective and efficient in finding good solutions of the CFA problem compared with the traditional Lagrangean relaxation and subgradient optimization technique. Extensive tests are made in order to choose the best values of the parameters for tabu search algorithm.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Combinatorial optimization</subject><subject>Computer networks</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Optimization techniques</subject><subject>Routing</subject><subject>Routing and capacity assignment</subject><subject>Searches</subject><subject>Studies</subject><subject>Tabu search</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp9kUGLFDEQhYMoOI7-AG9B0FuPSTpJp_G0LKu7sOBFwYMQ0tXVMxm7kzFJK_vvzTALggeLgrp871XxipDXnO044_r9cQcx7QRjcnduJp-QDTdd23RafXtKNqxlqmFKmufkRc5HVqsTfEO-X9HihpVmdAkO1M37mHw5LHSKiZYD0hTX4sOeujBScCcHvjxQl7PfhwVDoacUhxkX6gOFuJzWgokGLL9j-pFfkmeTmzO-epxb8vXjzZfr2-b-86e766v7BlqjSiP7TsmBqVaaDiYYes1g1CPT_dRpMzrOndBohAHJmXKdA90C6MGgmIxup3ZL3l186zE_V8zFLj4DzrMLGNdsRa97yYWo4Jt_wGNcU6i3Wd4rI3krVYX4BYIUc0442VPyi0sPljN7DtsebQ3bnsO252ayat4-GrsMbp6SC-DzX6E2XIr6ji35cOGwxvHLY7IZPAbA0SeEYsfo_7PlD9pblI8</recordid><startdate>20051101</startdate><enddate>20051101</enddate><creator>Shen, Jian</creator><creator>Xu, Fuyong</creator><creator>Zheng, Peng</creator><general>Elsevier Ltd</general><general>Elsevier Science</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20051101</creationdate><title>A tabu search algorithm for the routing and capacity assignment problem in computer networks</title><author>Shen, Jian ; Xu, Fuyong ; Zheng, Peng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-49754b053487cfcb960cd6d069f768da11a26e828c4105a7ac63cc6b8e2f863f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Combinatorial optimization</topic><topic>Computer networks</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Optimization techniques</topic><topic>Routing</topic><topic>Routing and capacity assignment</topic><topic>Searches</topic><topic>Studies</topic><topic>Tabu search</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shen, Jian</creatorcontrib><creatorcontrib>Xu, Fuyong</creatorcontrib><creatorcontrib>Zheng, Peng</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers &amp; operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shen, Jian</au><au>Xu, Fuyong</au><au>Zheng, Peng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A tabu search algorithm for the routing and capacity assignment problem in computer networks</atitle><jtitle>Computers &amp; operations research</jtitle><date>2005-11-01</date><risdate>2005</risdate><volume>32</volume><issue>11</issue><spage>2785</spage><epage>2800</epage><pages>2785-2800</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>A tabu search metaheuristic algorithm for a classical routing and capacity assignment (CFA) problem in computer networks is presented in this paper. Computational experiments across a variety of networks are reported. The results show that the proposed tabu search algorithm is both effective and efficient in finding good solutions of the CFA problem compared with the traditional Lagrangean relaxation and subgradient optimization technique. Extensive tests are made in order to choose the best values of the parameters for tabu search algorithm.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2004.04.004</doi><tpages>16</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0305-0548
ispartof Computers & operations research, 2005-11, Vol.32 (11), p.2785-2800
issn 0305-0548
1873-765X
0305-0548
language eng
recordid cdi_proquest_miscellaneous_29694122
source ScienceDirect Freedom Collection
subjects Algorithms
Applied sciences
Combinatorial optimization
Computer networks
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Optimization techniques
Routing
Routing and capacity assignment
Searches
Studies
Tabu search
title A tabu search algorithm for the routing and capacity assignment problem in computer networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T13%3A42%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20tabu%20search%20algorithm%20for%20the%20routing%20and%20capacity%20assignment%20problem%20in%20computer%20networks&rft.jtitle=Computers%20&%20operations%20research&rft.au=Shen,%20Jian&rft.date=2005-11-01&rft.volume=32&rft.issue=11&rft.spage=2785&rft.epage=2800&rft.pages=2785-2800&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2004.04.004&rft_dat=%3Cproquest_cross%3E801606061%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c385t-49754b053487cfcb960cd6d069f768da11a26e828c4105a7ac63cc6b8e2f863f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=195841345&rft_id=info:pmid/&rfr_iscdi=true