國立虎尾科技大學 |

Efficient Solution of Minimum Cost Flow Problems for Large-scale Transportation Networks.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Efficient Solution of Minimum Cost Flow Problems for Large-scale Transportation Networks./
Author:	Zhou, Yuan.
Description:	1 online resource (140 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Contained By:	Dissertation Abstracts International79-10B(E).
Subject:	Civil engineering. -
Online resource:	click for full text (PQDT)
ISBN:	9780355983623

Efficient Solution of Minimum Cost Flow Problems for Large-scale Transportation Networks.
Zhou, Yuan.

Efficient Solution of Minimum Cost Flow Problems for Large-scale Transportation Networks. - 1 online resource (140 pages)

Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.

Thesis (Ph.D.)--The University of Memphis, 2018.

Includes bibliographical references

With the rapid advance of information technology in the transportation industry, of which intermodal transportation is one of the most important subfields, the scale and dimension of problem sizes and datasets is rising significantly. This trend raises the need for study on improving the efficiency, profitability and level of competitiveness of intermodal transportation networks while exploiting the rich information of big data related to these networks. Therefore, this dissertation aims to investigate intermodal transportation network design problems, especially practical optimization problems, and to develop more realistic and effective models and solution approaches that will assist network operators and/or decision makers of the intermodal transportation system.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355983623Subjects--Topical Terms:

561339
Civil engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Efficient Solution of Minimum Cost Flow Problems for Large-scale Transportation Networks.
LDR:03400ntm a2200361Ki 4500 001 918362
005 20181114145236.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780355983623
035 $a (MiAaPQ)AAI10748791
035 $a (MiAaPQ)memphis:10002
035 $a AAI10748791
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Zhou, Yuan. $3 1182229
245 1 0 $a Efficient Solution of Minimum Cost Flow Problems for Large-scale Transportation Networks.
264 0 $c 2018
300 $a 1 online resource (140 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
500 $a Adviser: Stephanie S. Ivey.
502 $a Thesis (Ph.D.)--The University of Memphis, 2018.
504 $a Includes bibliographical references
520 $a With the rapid advance of information technology in the transportation industry, of which intermodal transportation is one of the most important subfields, the scale and dimension of problem sizes and datasets is rising significantly. This trend raises the need for study on improving the efficiency, profitability and level of competitiveness of intermodal transportation networks while exploiting the rich information of big data related to these networks. Therefore, this dissertation aims to investigate intermodal transportation network design problems, especially practical optimization problems, and to develop more realistic and effective models and solution approaches that will assist network operators and/or decision makers of the intermodal transportation system.
520 $a This dissertation focuses on developing a novel strategy for solving the Minimum Cost Flow (MCF) problem for large-scale network design problems by adopting a divide-and-conquer policy during the optimization process. The main contribution is the development of an agglomerative clustering based tiling strategy to significantly reduce the computational and peak memory consumption of the MCF model for large-scale networks. The tiling strategy is supported by the regional-division theorem and ?-approximation regional-division theorem that are proposed and proved in this dissertation. The region-division theorem is a sufficient condition to exactly guarantee the consistency between the local MCF solution of each sub-network obtained by the aforementioned tiling strategy and the global MCF solution of the whole network. Furthermore, the alpha-approximation region-division theorem provides worst-case bounds, so that the practical approximation MCF solution closely approximates the optimal solution in terms of its "optimal value".
520 $a A series of experiments are performed to evaluate the utility of the proposed approach of solving the large-scale MCF problem. The results indicate that the proposed approach is beneficial to save the execution time and peak memory consumption in large-scale MCF problems under different circumstances.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Civil engineering. $3 561339
650 4 $a Engineering. $3 561152
655 7 $a Electronic books. $2 local $3 554714
690 $a 0543
690 $a 0537
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a The University of Memphis. $b Civil Engineering. $3 1192665
773 0 $t Dissertation Abstracts International $g 79-10B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10748791 $z click for full text (PQDT)