Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data

To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as t...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Yiming Bie [verfasserIn] Ruru Tang [verfasserIn] Linhong Wang [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2020

Schlagwörter:	Bus route overlap scheduling method vehicle types optimization model

Übergeordnetes Werk:	In: IEEE Access - IEEE, 2014, 8(2020), Seite 1406-1415
Übergeordnetes Werk:	volume:8 ; year:2020 ; pages:1406-1415

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1109/ACCESS.2019.2961930

Katalog-ID:	DOAJ005077176

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ005077176
003	DE-627
005	20230309190737.0
007	cr uuu---uuuuu
008	230225s2020 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1109/ACCESS.2019.2961930 \|2 doi
035			\|a (DE-627)DOAJ005077176
035			\|a (DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK1-9971
100	0		\|a Yiming Bie \|e verfasserin \|4 aut
245	1	0	\|a Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data
264		1	\|c 2020
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively.
650		4	\|a Bus route overlap
650		4	\|a scheduling method
650		4	\|a vehicle types
650		4	\|a optimization model
653		0	\|a Electrical engineering. Electronics. Nuclear engineering
700	0		\|a Ruru Tang \|e verfasserin \|4 aut
700	0		\|a Linhong Wang \|e verfasserin \|4 aut
773	0	8	\|i In \|t IEEE Access \|d IEEE, 2014 \|g 8(2020), Seite 1406-1415 \|w (DE-627)728440385 \|w (DE-600)2687964-5 \|x 21693536 \|7 nnns
773	1	8	\|g volume:8 \|g year:2020 \|g pages:1406-1415
856	4	0	\|u https://doi.org/10.1109/ACCESS.2019.2961930 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3 \|z kostenfrei
856	4	0	\|u https://ieeexplore.ieee.org/document/8940987/ \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2169-3536 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 8 \|j 2020 \|h 1406-1415

Indexfelder

author_variant	y b yb r t rt l w lw
matchkey_str	article:21693536:2020----::ushdlnooelpigotsihutvhceyeb
hierarchy_sort_str	2020
callnumber-subject-code	TK
publishDate	2020
allfields	10.1109/ACCESS.2019.2961930 doi (DE-627)DOAJ005077176 (DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3 DE-627 ger DE-627 rakwb eng TK1-9971 Yiming Bie verfasserin aut Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively. Bus route overlap scheduling method vehicle types optimization model Electrical engineering. Electronics. Nuclear engineering Ruru Tang verfasserin aut Linhong Wang verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 1406-1415 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:1406-1415 https://doi.org/10.1109/ACCESS.2019.2961930 kostenfrei https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3 kostenfrei https://ieeexplore.ieee.org/document/8940987/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 1406-1415
spelling	10.1109/ACCESS.2019.2961930 doi (DE-627)DOAJ005077176 (DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3 DE-627 ger DE-627 rakwb eng TK1-9971 Yiming Bie verfasserin aut Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively. Bus route overlap scheduling method vehicle types optimization model Electrical engineering. Electronics. Nuclear engineering Ruru Tang verfasserin aut Linhong Wang verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 1406-1415 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:1406-1415 https://doi.org/10.1109/ACCESS.2019.2961930 kostenfrei https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3 kostenfrei https://ieeexplore.ieee.org/document/8940987/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 1406-1415
allfields_unstemmed	10.1109/ACCESS.2019.2961930 doi (DE-627)DOAJ005077176 (DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3 DE-627 ger DE-627 rakwb eng TK1-9971 Yiming Bie verfasserin aut Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively. Bus route overlap scheduling method vehicle types optimization model Electrical engineering. Electronics. Nuclear engineering Ruru Tang verfasserin aut Linhong Wang verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 1406-1415 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:1406-1415 https://doi.org/10.1109/ACCESS.2019.2961930 kostenfrei https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3 kostenfrei https://ieeexplore.ieee.org/document/8940987/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 1406-1415
allfieldsGer	10.1109/ACCESS.2019.2961930 doi (DE-627)DOAJ005077176 (DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3 DE-627 ger DE-627 rakwb eng TK1-9971 Yiming Bie verfasserin aut Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively. Bus route overlap scheduling method vehicle types optimization model Electrical engineering. Electronics. Nuclear engineering Ruru Tang verfasserin aut Linhong Wang verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 1406-1415 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:1406-1415 https://doi.org/10.1109/ACCESS.2019.2961930 kostenfrei https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3 kostenfrei https://ieeexplore.ieee.org/document/8940987/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 1406-1415
allfieldsSound	10.1109/ACCESS.2019.2961930 doi (DE-627)DOAJ005077176 (DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3 DE-627 ger DE-627 rakwb eng TK1-9971 Yiming Bie verfasserin aut Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively. Bus route overlap scheduling method vehicle types optimization model Electrical engineering. Electronics. Nuclear engineering Ruru Tang verfasserin aut Linhong Wang verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 1406-1415 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:1406-1415 https://doi.org/10.1109/ACCESS.2019.2961930 kostenfrei https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3 kostenfrei https://ieeexplore.ieee.org/document/8940987/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 1406-1415
language	English
source	In IEEE Access 8(2020), Seite 1406-1415 volume:8 year:2020 pages:1406-1415
sourceStr	In IEEE Access 8(2020), Seite 1406-1415 volume:8 year:2020 pages:1406-1415
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Bus route overlap scheduling method vehicle types optimization model Electrical engineering. Electronics. Nuclear engineering
isfreeaccess_bool	true
container_title	IEEE Access
authorswithroles_txt_mv	Yiming Bie @@aut@@ Ruru Tang @@aut@@ Linhong Wang @@aut@@
publishDateDaySort_date	2020-01-01T00:00:00Z
hierarchy_top_id	728440385
id	DOAJ005077176
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ005077176</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230309190737.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2020 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2019.2961930</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ005077176</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Yiming Bie</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bus route overlap</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">scheduling method</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">vehicle types</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">optimization model</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Ruru Tang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Linhong Wang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">8(2020), Seite 1406-1415</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2020</subfield><subfield code="g">pages:1406-1415</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2019.2961930</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/8940987/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2020</subfield><subfield code="h">1406-1415</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Yiming Bie
spellingShingle	Yiming Bie misc TK1-9971 misc Bus route overlap misc scheduling method misc vehicle types misc optimization model misc Electrical engineering. Electronics. Nuclear engineering Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data
authorStr	Yiming Bie
ppnlink_with_tag_str_mv	@@773@@(DE-627)728440385
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	TK1-9971
illustrated	Not Illustrated
issn	21693536
topic_title	TK1-9971 Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data Bus route overlap scheduling method vehicle types optimization model
topic	misc TK1-9971 misc Bus route overlap misc scheduling method misc vehicle types misc optimization model misc Electrical engineering. Electronics. Nuclear engineering
topic_unstemmed	misc TK1-9971 misc Bus route overlap misc scheduling method misc vehicle types misc optimization model misc Electrical engineering. Electronics. Nuclear engineering
topic_browse	misc TK1-9971 misc Bus route overlap misc scheduling method misc vehicle types misc optimization model misc Electrical engineering. Electronics. Nuclear engineering
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	IEEE Access
hierarchy_parent_id	728440385
hierarchy_top_title	IEEE Access
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)728440385 (DE-600)2687964-5
title	Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data
ctrlnum	(DE-627)DOAJ005077176 (DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3
title_full	Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data
author_sort	Yiming Bie
journal	IEEE Access
journalStr	IEEE Access
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2020
contenttype_str_mv	txt
container_start_page	1406
author_browse	Yiming Bie Ruru Tang Linhong Wang
container_volume	8
class	TK1-9971
format_se	Elektronische Aufsätze
author-letter	Yiming Bie
doi_str_mv	10.1109/ACCESS.2019.2961930
author2-role	verfasserin
title_sort	bus scheduling of overlapping routes with multi-vehicle types based on passenger od data
callnumber	TK1-9971
title_auth	Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data
abstract	To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively.
abstractGer	To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively.
abstract_unstemmed	To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
title_short	Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data
url	https://doi.org/10.1109/ACCESS.2019.2961930 https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3 https://ieeexplore.ieee.org/document/8940987/ https://doaj.org/toc/2169-3536
remote_bool	true
author2	Ruru Tang Linhong Wang
author2Str	Ruru Tang Linhong Wang
ppnlink	728440385
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1109/ACCESS.2019.2961930
callnumber-a	TK1-9971
up_date	2024-07-04T02:14:20.273Z
_version_	1803612858903166976
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ005077176</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230309190737.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2020 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2019.2961930</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ005077176</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJa1e9edc2f79743d5b5c500aa485618f3</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Yiming Bie</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">To mitigate the problems caused by bus route overlap in the transit network, this paper proposes a new scheduling method with both large and small vehicle types based on passenger OD (Origin-Destination) data. The minimum of total cost of passenger travel time and bus company operation is taken as the optimization objective, departure intervals and vehicle types are taken as the optimization variables. The impact of route overlap on passenger travel time is analyzed. A heuristic algorithm is developed to solve the optimization model to produce the departure time and vehicle type for each bus trip. Finally, three real bus routes in Harbin city are taken as an example to validate the proposed model using peak-hour data. Compared with the model without considering route overlap, the proposed model can reduce total passenger travel time and cost by 5.2% and 8.8% respectively.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bus route overlap</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">scheduling method</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">vehicle types</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">optimization model</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Ruru Tang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Linhong Wang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">8(2020), Seite 1406-1415</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2020</subfield><subfield code="g">pages:1406-1415</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2019.2961930</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/a1e9edc2f79743d5b5c500aa485618f3</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/8940987/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2020</subfield><subfield code="h">1406-1415</subfield></datafield></record></collection>
score	7.402852

Nicht das Richtige dabei?

Schreiben Sie uns!

Bus Scheduling of Overlapping Routes With Multi-Vehicle Types Based on Passenger OD Data

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?