Ant colony algorithm for rational transit network design of urban passenger transport; Mechanical Engineering, Automation and Control Systems (MEACS)
| Parent link: | Mechanical Engineering, Automation and Control Systems (MEACS).— 2014.— [5 p.] |
|---|---|
| Korporativní autor: | |
| Další autoři: | , , , |
| Shrnutí: | Title screen This study presents an optimization model for a transit network design of urban passenger transport. It aims to maximize the number of direct travelers per unit length, that is direct traveler density, subject to route length and nonlinear rate constraints (ratio of the length of a route to the shortest road distance between the origin and destination). Ant colony optimization algorithm is one of the possible meta-heuristic approaches, which are used to find an optimal route by using the graphs. The essence of this method is that its model derived from the study of the real ants behavior as the creation of the algorithm was inspired by these invertebrates. Data collected in Tomsk, Russia, are used to test the model and the algorithm. The results show that the optimized transit network has significantly reduced transfers and travel time. They also reveal that the proposed algorithm is effective and efficient compared to some existing meta-heuristic algorithm. Режим доступа: по договору с организацией-держателем ресурса |
| Jazyk: | angličtina |
| Vydáno: |
2014
|
| Témata: | |
| On-line přístup: | http://dx.doi.org/10.1109/MEACS.2014.6986883 |
| Médium: | Elektronický zdroj Kapitola |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=639007 |
MARC
| LEADER | 00000nla2a2200000 4500 | ||
|---|---|---|---|
| 001 | 639007 | ||
| 005 | 20260714160643.0 | ||
| 035 | |a (RuTPU)RU\TPU\network\3404 | ||
| 035 | |a RU\TPU\network\3397 | ||
| 090 | |a 639007 | ||
| 100 | |a 20150218a2014 k y0engy50 ba | ||
| 101 | 0 | |a eng | |
| 105 | |a a z 101zy | ||
| 135 | |a drcn ---uucaa | ||
| 181 | 0 | |a i | |
| 182 | 0 | |a b | |
| 200 | 1 | |a Ant colony algorithm for rational transit network design of urban passenger transport |f Yu. A. Martynova [et al.] | |
| 203 | |a Text |c electronic | ||
| 300 | |a Title screen | ||
| 320 | |a [References: 6 tit.] | ||
| 330 | |a This study presents an optimization model for a transit network design of urban passenger transport. It aims to maximize the number of direct travelers per unit length, that is direct traveler density, subject to route length and nonlinear rate constraints (ratio of the length of a route to the shortest road distance between the origin and destination). Ant colony optimization algorithm is one of the possible meta-heuristic approaches, which are used to find an optimal route by using the graphs. The essence of this method is that its model derived from the study of the real ants behavior as the creation of the algorithm was inspired by these invertebrates. Data collected in Tomsk, Russia, are used to test the model and the algorithm. The results show that the optimized transit network has significantly reduced transfers and travel time. They also reveal that the proposed algorithm is effective and efficient compared to some existing meta-heuristic algorithm. | ||
| 333 | |a Режим доступа: по договору с организацией-держателем ресурса | ||
| 463 | 0 | |0 (RuTPU)RU\TPU\network\3200 |t Mechanical Engineering, Automation and Control Systems (MEACS) |o proceedings of the International Conference, Tomsk, 16-18 October, 2014 |f National Research Tomsk Polytechnic University (TPU) ; Institute of Electrical and Electronics Engineers (IEEE) |v [5 p.] |d 2014 | |
| 610 | 1 | |a электронный ресурс | |
| 610 | 1 | |a труды учёных ТПУ | |
| 610 | 1 | |a public (urban) transport | |
| 610 | 1 | |a transit (route) network | |
| 610 | 1 | |a designing | |
| 610 | 1 | |a optimization | |
| 610 | 1 | |a optimization model | |
| 610 | 1 | |a meta-heuristic algorithm | |
| 610 | 1 | |a ant colony algorithm | |
| 610 | 1 | |a алгоритмы | |
| 610 | 1 | |a транспортные сети | |
| 610 | 1 | |a городской транспорт | |
| 701 | 1 | |a Martynova |b Yu. A. |c specialist in the field of Informatics and computer engineering |c programmer, assistant Professor of Tomsk Polytechnic University |f 1988- |g Yulia Alekseevna |3 (RuTPU)RU\TPU\pers\33441 | |
| 701 | 1 | |a Martynov |b Ya. A |c specialist in the field of Automation and Computer Systems |c Training master of Tomsk Polytechnic University, assistant |f 1989- |g Yaroslav Andreevich |3 (RuTPU)RU\TPU\pers\31779 | |
| 701 | 1 | |a Mustafina |b D. B. | |
| 701 | 1 | |a Asmolovskiy |b V. V. | |
| 712 | 0 | 2 | |a Томский политехнический университет |b Институт кибернетики, ИК |c 2010-2017 |9 27025 |
| 801 | 2 | |a RU |b 63413507 |c 20161226 |g RCR | |
| 856 | 4 | |u http://dx.doi.org/10.1109/MEACS.2014.6986883 | |
| 942 | |c CF | ||