東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Optimal transit route network design...

Fan, Wei.

Linked to FindBook

Google Book

Amazon

博客來

Optimal transit route network design problem: Algorithms, implementations, and numerical results.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Optimal transit route network design problem: Algorithms, implementations, and numerical results./
Author:	Fan, Wei.
Description:	327 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4165.
Contained By:	Dissertation Abstracts International65-08B.
Subject:	Engineering, Civil. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3143741
ISBN:	0496016806

Optimal transit route network design problem: Algorithms, implementations, and numerical results.
Fan, Wei.

Optimal transit route network design problem: Algorithms, implementations, and numerical results. - 327 p.

Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4165.

Thesis (Ph.D.)--The University of Texas at Austin, 2004.

Previous approaches used to solve the transit route network design problem (TRNDP) can be classified into three categories: (1) Practical guidelines and ad hoc procedures; (2) Analytical optimization models for idealized situations; and (3) Meta-heuristic approaches for more practical problems. When the TRNDP is solved for a network of realistic size in which many parameters need to be determined, it is a combinatorial and NP-hard problem in nature and several sources of non-linearities and non-convexities involved preclude guaranteed globally optimal solution algorithms. As a result, the meta-heuristic approaches, which are able to pursue reasonably good local (possibly global) optimal solutions and deal with simultaneous design of the transit route network and determination of its associated service frequencies, become necessary. The objective of this dissertation is to systematically study the optimal TRNDP using hybrid heuristic algorithms at the distribution node level without aggregating the travel demand zones into a single node. A multi-objective nonlinear mixed integer model is formulated for the TRNDP. The proposed solution framework consists of three main components: an Initial Candidate Route Set Generation Procedure (ICRSGP) that generates all feasible routes incorporating practical bus transit industry guidelines; a Network Analysis Procedure (NAP) that determines transit trips for the TRNDP with variable demand, assigns these transit trips, determines service frequencies and computes performance measures; and a Heuristic Search Procedure (HSP) that guides the search techniques. Five heuristic algorithms, including the genetic algorithm, local search, simulated annealing, random search and tabu search, are employed as the solution methods for finding an optimal set of routes from the huge solution space. For the TRNDP with small network, the exhaustive search method is also used as a benchmark to examine the efficiency and measure the quality of the solutions obtained by using these heuristic algorithms. Several C++ program codes are developed to implement these algorithms for the TRNDP both with fixed and variable transit demand. Comprehensive experimental networks are used and successfully tested. Sensitivity analyses for each algorithm are conducted and model comparisons are performed. Numerical results are presented and the multi-objective decision making nature of the TRNDP is explored. Related characteristics underlying the TRNDP are identified, inherent tradeoffs are described and the redesign of the existing transit network is also discussed.

ISBN: 0496016806Subjects--Topical Terms:

783781
Engineering, Civil.

Optimal transit route network design problem: Algorithms, implementations, and numerical results.
LDR:03515nmm 2200265 4500 001 1841254
005 20050825081238.5
008 130614s2004 eng d
020 $a 0496016806
035 $a (UnM)AAI3143741
035 $a AAI3143741
040 $a UnM $c UnM
100 1 $a Fan, Wei. $3 1929561
245 1 0 $a Optimal transit route network design problem: Algorithms, implementations, and numerical results.
300 $a 327 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-08, Section: B, page: 4165.
500 $a Supervisor: Randy B. Machemehl.
502 $a Thesis (Ph.D.)--The University of Texas at Austin, 2004.
520 $a Previous approaches used to solve the transit route network design problem (TRNDP) can be classified into three categories: (1) Practical guidelines and ad hoc procedures; (2) Analytical optimization models for idealized situations; and (3) Meta-heuristic approaches for more practical problems. When the TRNDP is solved for a network of realistic size in which many parameters need to be determined, it is a combinatorial and NP-hard problem in nature and several sources of non-linearities and non-convexities involved preclude guaranteed globally optimal solution algorithms. As a result, the meta-heuristic approaches, which are able to pursue reasonably good local (possibly global) optimal solutions and deal with simultaneous design of the transit route network and determination of its associated service frequencies, become necessary. The objective of this dissertation is to systematically study the optimal TRNDP using hybrid heuristic algorithms at the distribution node level without aggregating the travel demand zones into a single node. A multi-objective nonlinear mixed integer model is formulated for the TRNDP. The proposed solution framework consists of three main components: an Initial Candidate Route Set Generation Procedure (ICRSGP) that generates all feasible routes incorporating practical bus transit industry guidelines; a Network Analysis Procedure (NAP) that determines transit trips for the TRNDP with variable demand, assigns these transit trips, determines service frequencies and computes performance measures; and a Heuristic Search Procedure (HSP) that guides the search techniques. Five heuristic algorithms, including the genetic algorithm, local search, simulated annealing, random search and tabu search, are employed as the solution methods for finding an optimal set of routes from the huge solution space. For the TRNDP with small network, the exhaustive search method is also used as a benchmark to examine the efficiency and measure the quality of the solutions obtained by using these heuristic algorithms. Several C++ program codes are developed to implement these algorithms for the TRNDP both with fixed and variable transit demand. Comprehensive experimental networks are used and successfully tested. Sensitivity analyses for each algorithm are conducted and model comparisons are performed. Numerical results are presented and the multi-objective decision making nature of the TRNDP is explored. Related characteristics underlying the TRNDP are identified, inherent tradeoffs are described and the redesign of the existing transit network is also discussed.
590 $a School code: 0227.
650 4 $a Engineering, Civil. $3 783781
690 $a 0543
710 2 0 $a The University of Texas at Austin. $3 718984
773 0 $t Dissertation Abstracts International $g 65-08B.
790 1 0 $a Machemehl, Randy B., $e advisor
790 $a 0227
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3143741