International Conference on Transportation Engineering 2007 2007
DOI: 10.1061/40932(246)65
|View full text |Cite
|
Sign up to set email alerts
|

Bi-Level Programming Model for Urban Bus Lanes' Layout

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…ABSTRACT The public transportation system of cities including subway and public transportation is becoming more and more perfect With the rapid development of urban public transport the path selection considering multiple factors has become a new problem Based on the optimization model we take urban public transport operators and travelers as the objects and use the entropy weight TOPSIS method to comprehensively evaluate the feasible lines and paths between multiple OD pairs Besides the optimal path to traverse all nodes was solved by Hamilton cycle problem algorithm which can also provide reference for both operators and travelers According to the latest urban public transport data in 2021 we select Beijing China as the empirical research object This paper chooses the existing public transport network of Beijing to verify and selects the optimal path of 5 nodes and 10 paths to traverse all nodes INDEX TERMS Optimal path Entropy weight TOPSIS method Hamilton cycle Cost and service quality IINTRODUCTION Nowadays with the rapid development of urban public transportation system there are many complicated lines in the city People's modes of transportation have changed from single choice to multiple choices Although people's travel needs have been met the choice of travel mode is not only to meet the purpose of travel but also to gradually enjoy the process of travel On the other hand traffic congestion is becoming more and more serious in large and mediumsized cities and people often spend a lot of time on the road At the same time vehicles emit a lot of pollution gases and people begin to pay attention to emission reduction Accordingly large cities are constantly limiting the number of trips and encouraging public transport As a result the selection and combination of existing lines and the optimal path selection under multiple nodes become an interesting research Yang Hai put forward the suggestion of optimizing bus line allocation and passenger traffic allocation at the same time They considered using the minimum spanning tree to analyze the impact of different demands on the line and took the Hong Kong Metro Line as an example to get the optimization results of minimizing the operation cost and maximizing the service quality [1] Canca D considered service providers and users at the same time in order to minimize operating costs and select the most convenient frequency and capacity and transport passengers from origin to destination while minimizing the average travel time [2] Wang L proposed a twolevel optimization model The design of the top layer minimized the total operating cost and unserviced passengers And the design of the bottom layer made the weighted passengers flow allocation a mixed integer program so as to maximize the service passengers and minimize the total travel time of all passengers The model had been illustrated and verified in Taiwan Highspeed Railway and BeijingShanghai Highspeed Railway[3] Chen Qun established a twotier model which designed the upper layer to minimize the total travel time the total length of the rail transit network and the number of changes and the lower layer to optimize the layout of the urban rail transit network [4] Xu Jinxing studied the relationship between the Hamilton cycle problem in graph theory and the traveling salesperson problem and used the Hamilton cycle t shortest path algorithm in graph theory to obtain an approximate solution to the traveling salesperson problem [5] Jun F used a fluorescent labeling strategy to solve the NP problem By fixing the DNA molecule in the solution space of the problem on a carrier a method for solving the DNA surface calculation model of the Hamilton cycle problem was given And the ...…”
Section: Evaluation and Selection Of Urban Public Transport Paths Based On Entropy Weight Topsis And Hamilton Cyclementioning
confidence: 99%
“…ABSTRACT The public transportation system of cities including subway and public transportation is becoming more and more perfect With the rapid development of urban public transport the path selection considering multiple factors has become a new problem Based on the optimization model we take urban public transport operators and travelers as the objects and use the entropy weight TOPSIS method to comprehensively evaluate the feasible lines and paths between multiple OD pairs Besides the optimal path to traverse all nodes was solved by Hamilton cycle problem algorithm which can also provide reference for both operators and travelers According to the latest urban public transport data in 2021 we select Beijing China as the empirical research object This paper chooses the existing public transport network of Beijing to verify and selects the optimal path of 5 nodes and 10 paths to traverse all nodes INDEX TERMS Optimal path Entropy weight TOPSIS method Hamilton cycle Cost and service quality IINTRODUCTION Nowadays with the rapid development of urban public transportation system there are many complicated lines in the city People's modes of transportation have changed from single choice to multiple choices Although people's travel needs have been met the choice of travel mode is not only to meet the purpose of travel but also to gradually enjoy the process of travel On the other hand traffic congestion is becoming more and more serious in large and mediumsized cities and people often spend a lot of time on the road At the same time vehicles emit a lot of pollution gases and people begin to pay attention to emission reduction Accordingly large cities are constantly limiting the number of trips and encouraging public transport As a result the selection and combination of existing lines and the optimal path selection under multiple nodes become an interesting research Yang Hai put forward the suggestion of optimizing bus line allocation and passenger traffic allocation at the same time They considered using the minimum spanning tree to analyze the impact of different demands on the line and took the Hong Kong Metro Line as an example to get the optimization results of minimizing the operation cost and maximizing the service quality [1] Canca D considered service providers and users at the same time in order to minimize operating costs and select the most convenient frequency and capacity and transport passengers from origin to destination while minimizing the average travel time [2] Wang L proposed a twolevel optimization model The design of the top layer minimized the total operating cost and unserviced passengers And the design of the bottom layer made the weighted passengers flow allocation a mixed integer program so as to maximize the service passengers and minimize the total travel time of all passengers The model had been illustrated and verified in Taiwan Highspeed Railway and BeijingShanghai Highspeed Railway[3] Chen Qun established a twotier model which designed the upper layer to minimize the total travel time the total length of the rail transit network and the number of changes and the lower layer to optimize the layout of the urban rail transit network [4] Xu Jinxing studied the relationship between the Hamilton cycle problem in graph theory and the traveling salesperson problem and used the Hamilton cycle t shortest path algorithm in graph theory to obtain an approximate solution to the traveling salesperson problem [5] Jun F used a fluorescent labeling strategy to solve the NP problem By fixing the DNA molecule in the solution space of the problem on a carrier a method for solving the DNA surface calculation model of the Hamilton cycle problem was given And the ...…”
Section: Evaluation and Selection Of Urban Public Transport Paths Based On Entropy Weight Topsis And Hamilton Cyclementioning
confidence: 99%