A Benders decomposition algorithm for base station planning problem in WCDMA networks
This paper analyzes the integer programming model and its relaxations of WCDMA base station planning problem for Up-Link with integer and nonlinear constraints. Firstly, the base station planning problem is decomposed into several “sub-problems” for every set of activated base stations to optimally...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2007-06, Vol.34 (6), p.1674-1687 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1687 |
|---|---|
| container_issue | 6 |
| container_start_page | 1674 |
| container_title | Computers & operations research |
| container_volume | 34 |
| creator | Zhang, Hong-Yuan Gu, Han-Yu Xi, Yu-Geng |
| description | This paper analyzes the integer programming model and its relaxations of WCDMA base station planning problem for Up-Link with integer and nonlinear constraints. Firstly, the base station planning problem is decomposed into several “sub-problems” for every set of activated base stations to optimally assign test points to them. Subsequently, the relationship between the integer sub-problems and their linear relaxations is investigated, which leads to the equivalence of the integral optimal solutions to the original integer programming model and its relaxation. Finally the classic Benders decomposition algorithm is applied to solve WCDMA base station planning problem. Simulation results show that the computational efficiency of the proposed algorithm can meet the requirements in practical applications. |
| doi_str_mv | 10.1016/j.cor.2005.07.003 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29112692</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054805002091</els_id><sourcerecordid>29112692</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-67d05b5767131d69647c9c1c70d6dc50ec704306239487403d20081c3d2fa52e3</originalsourceid><addsrcrecordid>eNp9kEFr3DAQhUVoINu0P6A3UUhvdkeWJdnktN02aSAhl4T2JrTSONXWlraSN6H_vtpuoJBDhWAE8-bpzUfIOwY1AyY_bmobU90AiBpUDcCPyIJ1ildKiu-vyAI4iApE252Q1zlvoBzVsAW5X9JPGBymTB3aOG1j9rOPgZrxISY__5joEBNdm4w0z-ZvazuaEHx4oNsU1yNO1Af6bfX5ZkkDzk8x_cxvyPFgxoxvn-spub_4crf6Wl3fXl6tlteV5Z2YK6kciLVQUjHOnOxlq2xvmVXgpLMCsLxaDrLhfdupFrgrC3bMljoY0SA_JR8OviXJrx3mWU8-WxxLQIy7rJuesUb2TRG-fyHcxF0KJZtmveg4lFtE7CCyKeaccNDb5CeTfmsGek9Zb3ShrPeUNShdKJeZs2djk60Zh2SC9fnfYNdCo9je-_ygw4Lj0WPS2XoMFp1PaGftov_PL38AKVSQEA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195830830</pqid></control><display><type>article</type><title>A Benders decomposition algorithm for base station planning problem in WCDMA networks</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Zhang, Hong-Yuan ; Gu, Han-Yu ; Xi, Yu-Geng</creator><creatorcontrib>Zhang, Hong-Yuan ; Gu, Han-Yu ; Xi, Yu-Geng</creatorcontrib><description>This paper analyzes the integer programming model and its relaxations of WCDMA base station planning problem for Up-Link with integer and nonlinear constraints. Firstly, the base station planning problem is decomposed into several “sub-problems” for every set of activated base stations to optimally assign test points to them. Subsequently, the relationship between the integer sub-problems and their linear relaxations is investigated, which leads to the equivalence of the integral optimal solutions to the original integer programming model and its relaxation. Finally the classic Benders decomposition algorithm is applied to solve WCDMA base station planning problem. Simulation results show that the computational efficiency of the proposed algorithm can meet the requirements in practical applications.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2005.07.003</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>Algorithms ; Applied sciences ; Decomposition ; Exact sciences and technology ; Facilities planning ; Integer programming ; Operational research. Management science ; Studies ; Wireless networks</subject><ispartof>Computers & operations research, 2007-06, Vol.34 (6), p.1674-1687</ispartof><rights>2005 Elsevier Ltd</rights><rights>2007 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Jun 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-67d05b5767131d69647c9c1c70d6dc50ec704306239487403d20081c3d2fa52e3</citedby><cites>FETCH-LOGICAL-c385t-67d05b5767131d69647c9c1c70d6dc50ec704306239487403d20081c3d2fa52e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cor.2005.07.003$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>315,781,785,3551,27929,27930,46000</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18402710$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Zhang, Hong-Yuan</creatorcontrib><creatorcontrib>Gu, Han-Yu</creatorcontrib><creatorcontrib>Xi, Yu-Geng</creatorcontrib><title>A Benders decomposition algorithm for base station planning problem in WCDMA networks</title><title>Computers & operations research</title><description>This paper analyzes the integer programming model and its relaxations of WCDMA base station planning problem for Up-Link with integer and nonlinear constraints. Firstly, the base station planning problem is decomposed into several “sub-problems” for every set of activated base stations to optimally assign test points to them. Subsequently, the relationship between the integer sub-problems and their linear relaxations is investigated, which leads to the equivalence of the integral optimal solutions to the original integer programming model and its relaxation. Finally the classic Benders decomposition algorithm is applied to solve WCDMA base station planning problem. Simulation results show that the computational efficiency of the proposed algorithm can meet the requirements in practical applications.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Decomposition</subject><subject>Exact sciences and technology</subject><subject>Facilities planning</subject><subject>Integer programming</subject><subject>Operational research. Management science</subject><subject>Studies</subject><subject>Wireless networks</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNp9kEFr3DAQhUVoINu0P6A3UUhvdkeWJdnktN02aSAhl4T2JrTSONXWlraSN6H_vtpuoJBDhWAE8-bpzUfIOwY1AyY_bmobU90AiBpUDcCPyIJ1ildKiu-vyAI4iApE252Q1zlvoBzVsAW5X9JPGBymTB3aOG1j9rOPgZrxISY__5joEBNdm4w0z-ZvazuaEHx4oNsU1yNO1Af6bfX5ZkkDzk8x_cxvyPFgxoxvn-spub_4crf6Wl3fXl6tlteV5Z2YK6kciLVQUjHOnOxlq2xvmVXgpLMCsLxaDrLhfdupFrgrC3bMljoY0SA_JR8OviXJrx3mWU8-WxxLQIy7rJuesUb2TRG-fyHcxF0KJZtmveg4lFtE7CCyKeaccNDb5CeTfmsGek9Zb3ShrPeUNShdKJeZs2djk60Zh2SC9fnfYNdCo9je-_ygw4Lj0WPS2XoMFp1PaGftov_PL38AKVSQEA</recordid><startdate>20070601</startdate><enddate>20070601</enddate><creator>Zhang, Hong-Yuan</creator><creator>Gu, Han-Yu</creator><creator>Xi, Yu-Geng</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>20070601</creationdate><title>A Benders decomposition algorithm for base station planning problem in WCDMA networks</title><author>Zhang, Hong-Yuan ; Gu, Han-Yu ; Xi, Yu-Geng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-67d05b5767131d69647c9c1c70d6dc50ec704306239487403d20081c3d2fa52e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Decomposition</topic><topic>Exact sciences and technology</topic><topic>Facilities planning</topic><topic>Integer programming</topic><topic>Operational research. Management science</topic><topic>Studies</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Hong-Yuan</creatorcontrib><creatorcontrib>Gu, Han-Yu</creatorcontrib><creatorcontrib>Xi, Yu-Geng</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 & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Hong-Yuan</au><au>Gu, Han-Yu</au><au>Xi, Yu-Geng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Benders decomposition algorithm for base station planning problem in WCDMA networks</atitle><jtitle>Computers & operations research</jtitle><date>2007-06-01</date><risdate>2007</risdate><volume>34</volume><issue>6</issue><spage>1674</spage><epage>1687</epage><pages>1674-1687</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>This paper analyzes the integer programming model and its relaxations of WCDMA base station planning problem for Up-Link with integer and nonlinear constraints. Firstly, the base station planning problem is decomposed into several “sub-problems” for every set of activated base stations to optimally assign test points to them. Subsequently, the relationship between the integer sub-problems and their linear relaxations is investigated, which leads to the equivalence of the integral optimal solutions to the original integer programming model and its relaxation. Finally the classic Benders decomposition algorithm is applied to solve WCDMA base station planning problem. Simulation results show that the computational efficiency of the proposed algorithm can meet the requirements in practical applications.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2005.07.003</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2007-06, Vol.34 (6), p.1674-1687 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29112692 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Algorithms Applied sciences Decomposition Exact sciences and technology Facilities planning Integer programming Operational research. Management science Studies Wireless networks |
| title | A Benders decomposition algorithm for base station planning problem in WCDMA networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T10%3A57%3A00IST&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%20Benders%20decomposition%20algorithm%20for%20base%20station%20planning%20problem%20in%20WCDMA%20networks&rft.jtitle=Computers%20&%20operations%20research&rft.au=Zhang,%20Hong-Yuan&rft.date=2007-06-01&rft.volume=34&rft.issue=6&rft.spage=1674&rft.epage=1687&rft.pages=1674-1687&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2005.07.003&rft_dat=%3Cproquest_cross%3E29112692%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195830830&rft_id=info:pmid/&rft_els_id=S0305054805002091&rfr_iscdi=true |