2016
DOI: 10.1109/tits.2015.2480885
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Objective Transit Route Network Design as Set Covering Problem

Abstract: Many past researchers have ignored the multiobjective nature of the transit route network design problem (TrNDP), recognizing user or operator cost as their sole objective. The main purpose of this study is to identify the inherent conflict among TrNDP objectives in the design process. The conventional scheme for transit route design is addressed. A route constructive genetic algorithm is proposed to produce a vast pool of candidate routes that reflect the objectives of design, and then, a set covering problem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1
1

Relationship

1
9

Authors

Journals

citations
Cited by 59 publications
(18 citation statements)
references
References 37 publications
0
18
0
Order By: Relevance
“…e formation of the rail corrugation is the result of coaction of the wheel-rail interaction, rolling contact mechanics, and the wear properties of wheel-rail materials. e source of complexity often prevents finding the optimal solution [13][14][15][16][17][18]. Due to the complex and diverse causes of rail corrugation, there is currently no appropriate theoretical system that can give a reasonable explanation for all the rail corrugation observed on railway tracks [19].…”
Section: Literature Reviewmentioning
confidence: 99%
“…e formation of the rail corrugation is the result of coaction of the wheel-rail interaction, rolling contact mechanics, and the wear properties of wheel-rail materials. e source of complexity often prevents finding the optimal solution [13][14][15][16][17][18]. Due to the complex and diverse causes of rail corrugation, there is currently no appropriate theoretical system that can give a reasonable explanation for all the rail corrugation observed on railway tracks [19].…”
Section: Literature Reviewmentioning
confidence: 99%
“…This problem has a complexity of O(2 n ), which expresses the number of possible combinations of n service centres in the final solution. Currently, there are few practical applications of set covering problems, e.g., the problem of Wireless Ad Hoc Network (WANET) to select nodes to forward a message to the next nodes/consumers [11] or designing the transit route network [12] which expresses the cost of the route network deviation from the shortest path. Although these papers are dealing with the same theoretical problem, the real-world use case brings different challenges that need to be addressed.…”
Section: A Covering Servicesmentioning
confidence: 99%
“…In [15], four location rules are stated as a rule of thumb to judge the quality of a number of counting sensors set if used to estimate the O/D matrix. To find the optimum sensors number and locations that achieve these rules, different metaheuristics are used such as genetic algorithms [16], greedy algorithms [17], distancebased genetic algorithm [18], compressed sensing [19], and randomized priority search [20][21][22][23][24][25].…”
Section: State-of-the-artmentioning
confidence: 99%