2017
DOI: 10.1007/978-3-319-61297-3_8
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Visualization of Transit Information Using Genetic Algorithms for Path Schematization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…Almost all cities that have a metro system also provide their users with a schematic map of the network. For this reason, most of the research on schematization algorithms focused on transit networks [3,11,17,28,37,51,54]. Those methods were surveyed in [35].…”
Section: Route and Polygon Schematization Methodsmentioning
confidence: 99%
“…Almost all cities that have a metro system also provide their users with a schematic map of the network. For this reason, most of the research on schematization algorithms focused on transit networks [3,11,17,28,37,51,54]. Those methods were surveyed in [35].…”
Section: Route and Polygon Schematization Methodsmentioning
confidence: 99%
“…In the last two decades, researchers from multiple disciplines, such as cartography, GIS, computational geometry, transportation, and psychology, have carried out a large number of studies for schematic maps. The literature presents three primary themes: (1) effective design rules, principles, and/or frameworks for automated generation (e.g., Avelar & Hurni, 2006;Burch, Woods, Netzel, & Weiskopf, 2016;Li, 2015;Roberts, 2014b); (2) automated generation methods (e.g., Anand, Avelar, Ware, & Jackson, 2007;Brands, 2016;Galvao, Ramos, Lamar, & Taco, 2017;Hong, Merrick, & Nascimento, 2006;Lan, Li, & Ti, 2019;Li & Dong, 2010;Nöllenburg & Wolff, 2011;Stott, Rodgers, Martinez-Ovando, & Walker, 2011;Ti & Li, 2014;Ti, Li, & Xu, 2015;Ware, Taylor, Anand, & Thomas, 2006); and (3) usability and cognition issues (e.g., Burch, Kurzhals, Raschke, Blascheck, & Weiskopf, 2014;Delazari, Anand, Morley, 2014;Gallotti, Porter, & Barthelemy, 2016;Guo, 2011;Lloyd, Rodgers, & Roberts, 2018;Netzel et al, 2017;Roberts, 2014a;Roberts, Gray, & Lesnik, 2017;Roberts et al, 2013). This study focuses on the automated generation methods of schematic maps.…”
Section: Introductionmentioning
confidence: 99%
“…It is time-consuming to solve this optimization problem due to its NP-hard nature [11]. To achieve the optimal result within an acceptable time, various optimization algorithms (e.g., simulated annealing algorithms, genetic algorithms, and hill-climbing algorithms) are used with one or more constraints [2,[11][12][13][14][15]. On the other hand, the utility improvement of schematic maps has gained a great deal of attention.…”
mentioning
confidence: 99%