Median shortest path problems in the design of transportation networks | |
| Author | Nepal, Kali Prasad |
| Call Number | AIT Thesis no.TE-01-03 |
| Subject(s) | Transportation Transportation problems (Programming) |
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Civil Engineering |
| Publisher | Asian Institute of Technology |
| Series Statement | School of Civil Engineering |
| Abstract | The emergence of better design of transportation networks has initiated a new wave of approaches to develop efficient algorithms for multiobjective shortest path problems. Earlier efforts to such problems are limited and most of them are not efficient and realistic for designing real transportation networks. This study proposes efficient algorithms for three types of median shortest path problems. The vector labeling algorithm is proposed for median shortest path problem (Problem I), which minimizes route and access costs. The proposed approach deletes cyclic paths, infeasible paths and dominated paths in criteria space imposing cyclic break, route cost constraint and access cost parameter respectively. The labeling with search algorithm is proposed for improved median shortest path problem (Problem II) in order to minimize route cost and overall travel time of entire network. The labeling algorithm is used to generate feasible paths, and the exhaustive search is carried out for those feasible paths in order to obtain a set of nondominated paths. The same algorithm of Problem II with some modification is proposed to improved median shortest path problem (Problem III), which minimizes route cost and overall travel time of the entire network and maximizes total toll revenue of the path. All three algorithms identify noninferior solution set of Pareto optimal paths based on objectives considered and leave the ultimate decision to decision makers. The algorithms are analyzed and validated using Current at el.'s (1987) transportation network. The sensitivity analysis and comparison with the existing algorithms have shown that the proposed algorithms are advantageous over existing algorithm to median shortest path problems. |
| Year | 2002 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. TE-01-03 |
| Type | Thesis |
| School | School of Civil Engineering |
| Department | Department of Civil and Infrastucture Engineering (DCIE) |
| Academic Program/FoS | Transportation Engineering (TE) |
| Chairperson(s) | Park, Dongjoo; |
| Examination Committee(s) | Yordphol Tanaboriboon ;Sano, Kazushi ;Pannapa Herabat; |
| Scholarship Donor(s) | Japan-Asian Development Bank; |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 2002 |