Two phases algorithm of transport network design problem

Jianghua Zhang; Guangwen Kong; Daoli Zhu; Qiang Han

doi:10.1109/WICOM.2007.1603

Two phases algorithm of transport network design problem

Jianghua Zhang, Guangwen Kong, Daoli Zhu, Qiang Han

Industrial and Systems Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The transport network design problem deals with how to add or improve some edges on an existing transport network using quantitative analysis method. This paper put forward two phases algorithm of transport network design based on network optimization, which concludes enumerating all cut sets and resolving single-side domination set problem of weighted bipartite graph. Firstly, a single-side domination set problem of weighted bipartite graph is defined, along with the corresponding algorithm. Then two phases algorithm of transport network design is constructed by combining the algorithm mentioned above with the algorithm enumerating all cut sets. Further, the complexity of algorithm is analyzed, and it is proved that the algorithm could end in finite step. Finally, a numerical example is presented to show the efficiency of algorithm.

Original language	English (US)
Title of host publication	2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007
Publisher	IEEE Computer Society
Pages	6533-6536
Number of pages	4
ISBN (Print)	1424413125, 1424413125, 9781424413126, 9781424413126
DOIs	https://doi.org/10.1109/WICOM.2007.1603
State	Published - 2007
Event	2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007 - Shanghai, China Duration: Sep 21 2007 → Sep 25 2007

Publication series

Name	2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007

Other

Other	2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007
Country/Territory	China
City	Shanghai
Period	9/21/07 → 9/25/07

Keywords

Heuristic algorithm
Network optimization
Single-side domination set
Transport network design problem
Weighted bipartite graph

Access

10.1109/WICOM.2007.1603

OpenUrl availability

Full text

Cite this

Zhang, J., Kong, G., Zhu, D., & Han, Q. (2007). Two phases algorithm of transport network design problem. In 2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007 (pp. 6533-6536). Article 4341378 (2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007). IEEE Computer Society. https://doi.org/10.1109/WICOM.2007.1603

Two phases algorithm of transport network design problem. / Zhang, Jianghua; Kong, Guangwen; Zhu, Daoli et al.
2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007. IEEE Computer Society, 2007. p. 6533-6536 4341378 (2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zhang, J, Kong, G, Zhu, D & Han, Q 2007, Two phases algorithm of transport network design problem. in 2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007., 4341378, 2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007, IEEE Computer Society, pp. 6533-6536, 2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007, Shanghai, China, 9/21/07. https://doi.org/10.1109/WICOM.2007.1603

Zhang J, Kong G, Zhu D, Han Q. Two phases algorithm of transport network design problem. In 2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007. IEEE Computer Society. 2007. p. 6533-6536. 4341378. (2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007). doi: 10.1109/WICOM.2007.1603

@inproceedings{7a48a61a4554415c8fd33a74a72af982,

title = "Two phases algorithm of transport network design problem",

abstract = "The transport network design problem deals with how to add or improve some edges on an existing transport network using quantitative analysis method. This paper put forward two phases algorithm of transport network design based on network optimization, which concludes enumerating all cut sets and resolving single-side domination set problem of weighted bipartite graph. Firstly, a single-side domination set problem of weighted bipartite graph is defined, along with the corresponding algorithm. Then two phases algorithm of transport network design is constructed by combining the algorithm mentioned above with the algorithm enumerating all cut sets. Further, the complexity of algorithm is analyzed, and it is proved that the algorithm could end in finite step. Finally, a numerical example is presented to show the efficiency of algorithm.",

keywords = "Heuristic algorithm, Network optimization, Single-side domination set, Transport network design problem, Weighted bipartite graph",

author = "Jianghua Zhang and Guangwen Kong and Daoli Zhu and Qiang Han",

year = "2007",

doi = "10.1109/WICOM.2007.1603",

language = "English (US)",

isbn = "1424413125",

series = "2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007",

publisher = "IEEE Computer Society",

pages = "6533--6536",

booktitle = "2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007",

note = "2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007 ; Conference date: 21-09-2007 Through 25-09-2007",

}

TY - GEN

T1 - Two phases algorithm of transport network design problem

AU - Zhang, Jianghua

AU - Kong, Guangwen

AU - Zhu, Daoli

AU - Han, Qiang

PY - 2007

Y1 - 2007

N2 - The transport network design problem deals with how to add or improve some edges on an existing transport network using quantitative analysis method. This paper put forward two phases algorithm of transport network design based on network optimization, which concludes enumerating all cut sets and resolving single-side domination set problem of weighted bipartite graph. Firstly, a single-side domination set problem of weighted bipartite graph is defined, along with the corresponding algorithm. Then two phases algorithm of transport network design is constructed by combining the algorithm mentioned above with the algorithm enumerating all cut sets. Further, the complexity of algorithm is analyzed, and it is proved that the algorithm could end in finite step. Finally, a numerical example is presented to show the efficiency of algorithm.

AB - The transport network design problem deals with how to add or improve some edges on an existing transport network using quantitative analysis method. This paper put forward two phases algorithm of transport network design based on network optimization, which concludes enumerating all cut sets and resolving single-side domination set problem of weighted bipartite graph. Firstly, a single-side domination set problem of weighted bipartite graph is defined, along with the corresponding algorithm. Then two phases algorithm of transport network design is constructed by combining the algorithm mentioned above with the algorithm enumerating all cut sets. Further, the complexity of algorithm is analyzed, and it is proved that the algorithm could end in finite step. Finally, a numerical example is presented to show the efficiency of algorithm.

KW - Heuristic algorithm

KW - Network optimization

KW - Single-side domination set

KW - Transport network design problem

KW - Weighted bipartite graph

UR - http://www.scopus.com/inward/record.url?scp=38049048210&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049048210&partnerID=8YFLogxK

U2 - 10.1109/WICOM.2007.1603

DO - 10.1109/WICOM.2007.1603

M3 - Conference contribution

AN - SCOPUS:38049048210

SN - 1424413125

SN - 9781424413126

T3 - 2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007

SP - 6533

EP - 6536

BT - 2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007

PB - IEEE Computer Society

T2 - 2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007

Y2 - 21 September 2007 through 25 September 2007

ER -

Two phases algorithm of transport network design problem

Abstract

Publication series

Other

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this