Work zone scheduling problem in the urban traffic networks

A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Teodorović, Dušan - 1951- [verfasserIn] Nikolic, Milos - 1984- [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2023

Rechteinformationen:	Open Access Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International ; CC BY-NC-ND 4.0

Schlagwörter:	Work Zones Traffic Assignment CombinatorialOptimization Incremental algorithm

Übergeordnetes Werk:	Enthalten in: Ekonomske teme - Niš : Faculty of Economics Nis, 2009, 61(2023), 1 vom: März, Seite 1-18
Übergeordnetes Werk:	volume:61 ; year:2023 ; number:1 ; month:03 ; pages:1-18

Links:	Link aufrufen Link aufrufen

DOI / URN:	10.2478/ethemes-2023-0001

Katalog-ID:	1846272017

Internformat


LEADER	01000naa a2200265 4500
001	1846272017
003	DE-627
005	20230526130123.0
007	cr uuu---uuuuu
008	230526s2023 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.2478/ethemes-2023-0001 \|2 doi
035			\|a (DE-627)1846272017
035			\|a (DE-599)KXP1846272017
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
084			\|a L91 \|a R00 \|2 jelc
100	1		\|a Teodorović, Dušan \|d 1951- \|e verfasserin \|0 (DE-588)170770591 \|0 (DE-627)060902418 \|0 (DE-576)13162461X \|4 aut
245	1	0	\|a Work zone scheduling problem in the urban traffic networks \|c Dušan Teodorović, Miloš Nikolić
264		1	\|c 2023
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
506	0		\|q DE-206 \|a Open Access \|e Controlled Vocabulary for Access Rights \|u http://purl.org/coar/access_right/c_abf2
520			\|a A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances.
540			\|q DE-206 \|a Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International \|f CC BY-NC-ND 4.0 \|2 cc \|u https://creativecommons.org/licenses/by-nc-nd/4.0/
650		4	\|a Work Zones \|7 (dpeaa)DE-206
650		4	\|a Traffic Assignment \|7 (dpeaa)DE-206
650		4	\|a CombinatorialOptimization \|7 (dpeaa)DE-206
650		4	\|a Incremental algorithm \|7 (dpeaa)DE-206
700	1		\|a Nikolic, Milos \|d 1984- \|e verfasserin \|0 (DE-588)1139177621 \|0 (DE-627)896818667 \|0 (DE-576)492965358 \|4 aut
773	0	8	\|i Enthalten in \|t Ekonomske teme \|d Niš : Faculty of Economics Nis, 2009 \|g 61(2023), 1 vom: März, Seite 1-18 \|h Online-Ressource \|w (DE-627)618798846 \|w (DE-600)2539222-0 \|w (DE-576)322138027 \|x 2217-3668 \|7 nnns
773	1	8	\|g volume:61 \|g year:2023 \|g number:1 \|g month:03 \|g pages:1-18
856	4	0	\|u https://sciendo.com/pdf/10.2478/ethemes-2023-0001 \|x Verlag \|z kostenfrei
856	4	0	\|u https://doi.org/10.2478/ethemes-2023-0001 \|x Resolving-System \|z kostenfrei
912			\|a GBV_USEFLAG_U
912			\|a GBV_ILN_26
912			\|a ISIL_DE-206
912			\|a SYSFLAG_1
912			\|a GBV_KXP
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_152
912			\|a GBV_ILN_161
912			\|a GBV_ILN_206
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_2006
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4046
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_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
912			\|a GBV_ILN_2403
912			\|a GBV_ILN_2403
912			\|a ISIL_DE-LFER
936	u	w	\|d 61 \|j 2023 \|e 1 \|c 3 \|h 1-18
951			\|a AR
952			\|d 61 \|j 2023 \|e 1 \|c 3 \|h 1-18
980			\|2 26 \|1 01 \|x 0206 \|b 4325575987 \|y x1z \|z 26-05-23
980			\|2 2403 \|1 01 \|x DE-LFER \|b 4339969915 \|c 00 \|f --%%-- \|d --%%-- \|e n \|j --%%-- \|y l01 \|z 17-06-23
981			\|2 2403 \|1 01 \|x DE-LFER \|r https://doi.org/10.2478/ethemes-2023-0001
981			\|2 2403 \|1 01 \|x DE-LFER \|r https://sciendo.com/pdf/10.2478/ethemes-2023-0001

Indexfelder

author_variant	d t dt m n mn
matchkey_str	article:22173668:2023----::okoeceuigrbeiterat
hierarchy_sort_str	2023
publishDate	2023
allfields	10.2478/ethemes-2023-0001 doi (DE-627)1846272017 (DE-599)KXP1846272017 DE-627 ger DE-627 rda eng L91 R00 jelc Teodorović, Dušan 1951- verfasserin (DE-588)170770591 (DE-627)060902418 (DE-576)13162461X aut Work zone scheduling problem in the urban traffic networks Dušan Teodorović, Miloš Nikolić 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Work Zones (dpeaa)DE-206 Traffic Assignment (dpeaa)DE-206 CombinatorialOptimization (dpeaa)DE-206 Incremental algorithm (dpeaa)DE-206 Nikolic, Milos 1984- verfasserin (DE-588)1139177621 (DE-627)896818667 (DE-576)492965358 aut Enthalten in Ekonomske teme Niš : Faculty of Economics Nis, 2009 61(2023), 1 vom: März, Seite 1-18 Online-Ressource (DE-627)618798846 (DE-600)2539222-0 (DE-576)322138027 2217-3668 nnns volume:61 year:2023 number:1 month:03 pages:1-18 https://sciendo.com/pdf/10.2478/ethemes-2023-0001 Verlag kostenfrei https://doi.org/10.2478/ethemes-2023-0001 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_152 GBV_ILN_161 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2020 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 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_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER 61 2023 1 3 1-18 AR 61 2023 1 3 1-18 26 01 0206 4325575987 x1z 26-05-23 2403 01 DE-LFER 4339969915 00 --%%-- --%%-- n --%%-- l01 17-06-23 2403 01 DE-LFER https://doi.org/10.2478/ethemes-2023-0001 2403 01 DE-LFER https://sciendo.com/pdf/10.2478/ethemes-2023-0001
spelling	10.2478/ethemes-2023-0001 doi (DE-627)1846272017 (DE-599)KXP1846272017 DE-627 ger DE-627 rda eng L91 R00 jelc Teodorović, Dušan 1951- verfasserin (DE-588)170770591 (DE-627)060902418 (DE-576)13162461X aut Work zone scheduling problem in the urban traffic networks Dušan Teodorović, Miloš Nikolić 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Work Zones (dpeaa)DE-206 Traffic Assignment (dpeaa)DE-206 CombinatorialOptimization (dpeaa)DE-206 Incremental algorithm (dpeaa)DE-206 Nikolic, Milos 1984- verfasserin (DE-588)1139177621 (DE-627)896818667 (DE-576)492965358 aut Enthalten in Ekonomske teme Niš : Faculty of Economics Nis, 2009 61(2023), 1 vom: März, Seite 1-18 Online-Ressource (DE-627)618798846 (DE-600)2539222-0 (DE-576)322138027 2217-3668 nnns volume:61 year:2023 number:1 month:03 pages:1-18 https://sciendo.com/pdf/10.2478/ethemes-2023-0001 Verlag kostenfrei https://doi.org/10.2478/ethemes-2023-0001 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_152 GBV_ILN_161 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2020 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 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_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER 61 2023 1 3 1-18 AR 61 2023 1 3 1-18 26 01 0206 4325575987 x1z 26-05-23 2403 01 DE-LFER 4339969915 00 --%%-- --%%-- n --%%-- l01 17-06-23 2403 01 DE-LFER https://doi.org/10.2478/ethemes-2023-0001 2403 01 DE-LFER https://sciendo.com/pdf/10.2478/ethemes-2023-0001
allfields_unstemmed	10.2478/ethemes-2023-0001 doi (DE-627)1846272017 (DE-599)KXP1846272017 DE-627 ger DE-627 rda eng L91 R00 jelc Teodorović, Dušan 1951- verfasserin (DE-588)170770591 (DE-627)060902418 (DE-576)13162461X aut Work zone scheduling problem in the urban traffic networks Dušan Teodorović, Miloš Nikolić 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Work Zones (dpeaa)DE-206 Traffic Assignment (dpeaa)DE-206 CombinatorialOptimization (dpeaa)DE-206 Incremental algorithm (dpeaa)DE-206 Nikolic, Milos 1984- verfasserin (DE-588)1139177621 (DE-627)896818667 (DE-576)492965358 aut Enthalten in Ekonomske teme Niš : Faculty of Economics Nis, 2009 61(2023), 1 vom: März, Seite 1-18 Online-Ressource (DE-627)618798846 (DE-600)2539222-0 (DE-576)322138027 2217-3668 nnns volume:61 year:2023 number:1 month:03 pages:1-18 https://sciendo.com/pdf/10.2478/ethemes-2023-0001 Verlag kostenfrei https://doi.org/10.2478/ethemes-2023-0001 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_152 GBV_ILN_161 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2020 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 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_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER 61 2023 1 3 1-18 AR 61 2023 1 3 1-18 26 01 0206 4325575987 x1z 26-05-23 2403 01 DE-LFER 4339969915 00 --%%-- --%%-- n --%%-- l01 17-06-23 2403 01 DE-LFER https://doi.org/10.2478/ethemes-2023-0001 2403 01 DE-LFER https://sciendo.com/pdf/10.2478/ethemes-2023-0001
allfieldsGer	10.2478/ethemes-2023-0001 doi (DE-627)1846272017 (DE-599)KXP1846272017 DE-627 ger DE-627 rda eng L91 R00 jelc Teodorović, Dušan 1951- verfasserin (DE-588)170770591 (DE-627)060902418 (DE-576)13162461X aut Work zone scheduling problem in the urban traffic networks Dušan Teodorović, Miloš Nikolić 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Work Zones (dpeaa)DE-206 Traffic Assignment (dpeaa)DE-206 CombinatorialOptimization (dpeaa)DE-206 Incremental algorithm (dpeaa)DE-206 Nikolic, Milos 1984- verfasserin (DE-588)1139177621 (DE-627)896818667 (DE-576)492965358 aut Enthalten in Ekonomske teme Niš : Faculty of Economics Nis, 2009 61(2023), 1 vom: März, Seite 1-18 Online-Ressource (DE-627)618798846 (DE-600)2539222-0 (DE-576)322138027 2217-3668 nnns volume:61 year:2023 number:1 month:03 pages:1-18 https://sciendo.com/pdf/10.2478/ethemes-2023-0001 Verlag kostenfrei https://doi.org/10.2478/ethemes-2023-0001 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_152 GBV_ILN_161 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2020 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 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_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER 61 2023 1 3 1-18 AR 61 2023 1 3 1-18 26 01 0206 4325575987 x1z 26-05-23 2403 01 DE-LFER 4339969915 00 --%%-- --%%-- n --%%-- l01 17-06-23 2403 01 DE-LFER https://doi.org/10.2478/ethemes-2023-0001 2403 01 DE-LFER https://sciendo.com/pdf/10.2478/ethemes-2023-0001
allfieldsSound	10.2478/ethemes-2023-0001 doi (DE-627)1846272017 (DE-599)KXP1846272017 DE-627 ger DE-627 rda eng L91 R00 jelc Teodorović, Dušan 1951- verfasserin (DE-588)170770591 (DE-627)060902418 (DE-576)13162461X aut Work zone scheduling problem in the urban traffic networks Dušan Teodorović, Miloš Nikolić 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Work Zones (dpeaa)DE-206 Traffic Assignment (dpeaa)DE-206 CombinatorialOptimization (dpeaa)DE-206 Incremental algorithm (dpeaa)DE-206 Nikolic, Milos 1984- verfasserin (DE-588)1139177621 (DE-627)896818667 (DE-576)492965358 aut Enthalten in Ekonomske teme Niš : Faculty of Economics Nis, 2009 61(2023), 1 vom: März, Seite 1-18 Online-Ressource (DE-627)618798846 (DE-600)2539222-0 (DE-576)322138027 2217-3668 nnns volume:61 year:2023 number:1 month:03 pages:1-18 https://sciendo.com/pdf/10.2478/ethemes-2023-0001 Verlag kostenfrei https://doi.org/10.2478/ethemes-2023-0001 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_152 GBV_ILN_161 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2020 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 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_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER 61 2023 1 3 1-18 AR 61 2023 1 3 1-18 26 01 0206 4325575987 x1z 26-05-23 2403 01 DE-LFER 4339969915 00 --%%-- --%%-- n --%%-- l01 17-06-23 2403 01 DE-LFER https://doi.org/10.2478/ethemes-2023-0001 2403 01 DE-LFER https://sciendo.com/pdf/10.2478/ethemes-2023-0001
language	English
source	Enthalten in Ekonomske teme 61(2023), 1 vom: März, Seite 1-18 volume:61 year:2023 number:1 month:03 pages:1-18
sourceStr	Enthalten in Ekonomske teme 61(2023), 1 vom: März, Seite 1-18 volume:61 year:2023 number:1 month:03 pages:1-18
format_phy_str_mv	Article
building	26:1 2403:0
institution	findex.gbv.de
selectbib_iln_str_mv	26@1z 2403@01
topic_facet	Work Zones Traffic Assignment CombinatorialOptimization Incremental algorithm
isfreeaccess_bool	true
container_title	Ekonomske teme
authorswithroles_txt_mv	Teodorović, Dušan @@aut@@ Nikolic, Milos @@aut@@
publishDateDaySort_date	2023-03-01T00:00:00Z
hierarchy_top_id	618798846
id	1846272017
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a2200265 4500</leader><controlfield tag="001">1846272017</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230526130123.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230526s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2478/ethemes-2023-0001</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1846272017</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1846272017</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">L91</subfield><subfield code="a">R00</subfield><subfield code="2">jelc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Teodorović, Dušan</subfield><subfield code="d">1951-</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)170770591</subfield><subfield code="0">(DE-627)060902418</subfield><subfield code="0">(DE-576)13162461X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Work zone scheduling problem in the urban traffic networks</subfield><subfield code="c">Dušan Teodorović, Miloš Nikolić</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</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="506" ind1="0" ind2=" "><subfield code="q">DE-206</subfield><subfield code="a">Open Access</subfield><subfield code="e">Controlled Vocabulary for Access Rights</subfield><subfield code="u">http://purl.org/coar/access_right/c_abf2</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="q">DE-206</subfield><subfield code="a">Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International</subfield><subfield code="f">CC BY-NC-ND 4.0</subfield><subfield code="2">cc</subfield><subfield code="u">https://creativecommons.org/licenses/by-nc-nd/4.0/</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Work Zones</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Traffic Assignment</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CombinatorialOptimization</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Incremental algorithm</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nikolic, Milos</subfield><subfield code="d">1984-</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1139177621</subfield><subfield code="0">(DE-627)896818667</subfield><subfield code="0">(DE-576)492965358</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Ekonomske teme</subfield><subfield code="d">Niš : Faculty of Economics Nis, 2009</subfield><subfield code="g">61(2023), 1 vom: März, Seite 1-18</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)618798846</subfield><subfield code="w">(DE-600)2539222-0</subfield><subfield code="w">(DE-576)322138027</subfield><subfield code="x">2217-3668</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:61</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:1</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:1-18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://sciendo.com/pdf/10.2478/ethemes-2023-0001</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.2478/ethemes-2023-0001</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</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_152</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_206</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_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</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_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</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_4046</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_4326</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2403</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2403</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-LFER</subfield></datafield><datafield tag="936" ind1="u" ind2="w"><subfield code="d">61</subfield><subfield code="j">2023</subfield><subfield code="e">1</subfield><subfield code="c">3</subfield><subfield code="h">1-18</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">61</subfield><subfield code="j">2023</subfield><subfield code="e">1</subfield><subfield code="c">3</subfield><subfield code="h">1-18</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">4325575987</subfield><subfield code="y">x1z</subfield><subfield code="z">26-05-23</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="b">4339969915</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">--%%--</subfield><subfield code="e">n</subfield><subfield code="j">--%%--</subfield><subfield code="y">l01</subfield><subfield code="z">17-06-23</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="r">https://doi.org/10.2478/ethemes-2023-0001</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="r">https://sciendo.com/pdf/10.2478/ethemes-2023-0001</subfield></datafield></record></collection>
standort_str_mv	--%%--
standort_iln_str_mv	2403:--%%-- DE-LFER:--%%--
author	Teodorović, Dušan 1951-
spellingShingle	Teodorović, Dušan 1951- jelc L91 misc Work Zones misc Traffic Assignment misc CombinatorialOptimization misc Incremental algorithm Work zone scheduling problem in the urban traffic networks
authorStr	Teodorović, Dušan 1951-
ppnlink_with_tag_str_mv	@@773@@(DE-627)618798846
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
typewithnormlink_str_mv	Person@(DE-588)170770591 DifferentiatedPerson@(DE-588)170770591 Person@(DE-588)1139177621 DifferentiatedPerson@(DE-588)1139177621
collection	KXP GVK SWB
remote_str	true
last_changed_iln_str_mv	26@26-05-23 2403@17-06-23
illustrated	Not Illustrated
issn	2217-3668
topic_title	L91 R00 jelc Work zone scheduling problem in the urban traffic networks Dušan Teodorović, Miloš Nikolić Work Zones (dpeaa)DE-206 Traffic Assignment (dpeaa)DE-206 CombinatorialOptimization (dpeaa)DE-206 Incremental algorithm (dpeaa)DE-206
topic	jelc L91 misc Work Zones misc Traffic Assignment misc CombinatorialOptimization misc Incremental algorithm
topic_unstemmed	jelc L91 misc Work Zones misc Traffic Assignment misc CombinatorialOptimization misc Incremental algorithm
topic_browse	jelc L91 misc Work Zones misc Traffic Assignment misc CombinatorialOptimization misc Incremental algorithm
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
standort_txtP_mv	--%%--
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Ekonomske teme
normlinkwithtype_str_mv	(DE-588)170770591@Person (DE-588)170770591@DifferentiatedPerson (DE-588)1139177621@Person (DE-588)1139177621@DifferentiatedPerson
hierarchy_parent_id	618798846
signature	--%%--
signature_str_mv	--%%--
hierarchy_top_title	Ekonomske teme
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)618798846 (DE-600)2539222-0 (DE-576)322138027
normlinkwithrole_str_mv	(DE-588)170770591@@aut@@ (DE-588)1139177621@@aut@@
title	Work zone scheduling problem in the urban traffic networks
ctrlnum	(DE-627)1846272017 (DE-599)KXP1846272017
title_full	Work zone scheduling problem in the urban traffic networks Dušan Teodorović, Miloš Nikolić
author_sort	Teodorović, Dušan 1951-
journal	Ekonomske teme
journalStr	Ekonomske teme
callnumber-first-code	-
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2023
contenttype_str_mv	txt
container_start_page	1
author_browse	Teodorović, Dušan Nikolic, Milos
selectkey	26:x 2403:l
container_volume	61
class	L91 R00 jelc
format_se	Elektronische Aufsätze
author-letter	Teodorović, Dušan
doi_str_mv	10.2478/ethemes-2023-0001
normlink	170770591 060902418 13162461X 1139177621 896818667 492965358
normlink_prefix_str_mv	(DE-588)170770591 (DE-627)060902418 (DE-576)13162461X (DE-588)1139177621 (DE-627)896818667 (DE-576)492965358
author2-role	verfasserin
title_sort	work zone scheduling problem in the urban traffic networks
title_auth	Work zone scheduling problem in the urban traffic networks
abstract	A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances.
abstractGer	A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances.
abstract_unstemmed	A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances.
collection_details	GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_152 GBV_ILN_161 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2014 GBV_ILN_2020 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 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_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 ISIL_DE-LFER
container_issue	1
title_short	Work zone scheduling problem in the urban traffic networks
url	https://sciendo.com/pdf/10.2478/ethemes-2023-0001 https://doi.org/10.2478/ethemes-2023-0001
ausleihindikator_str_mv	26 2403:n
rolewithnormlink_str_mv	@@aut@@(DE-588)170770591 @@aut@@(DE-588)1139177621
remote_bool	true
author2	Nikolic, Milos 1984-
author2Str	Nikolic, Milos 1984-
ppnlink	618798846
GND_str_mv	Teodorović, Dušan Nikolić, Miloš Nikolic, Milos
GND_txt_mv	Teodorović, Dušan Nikolić, Miloš Nikolic, Milos
GND_txtF_mv	Teodorović, Dušan Nikolić, Miloš Nikolic, Milos
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.2478/ethemes-2023-0001
callnumber-a	--%%--
up_date	2024-07-19T08:07:41.378Z
_version_	1804994044373237760
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a2200265 4500</leader><controlfield tag="001">1846272017</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230526130123.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230526s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2478/ethemes-2023-0001</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1846272017</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1846272017</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">L91</subfield><subfield code="a">R00</subfield><subfield code="2">jelc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Teodorović, Dušan</subfield><subfield code="d">1951-</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)170770591</subfield><subfield code="0">(DE-627)060902418</subfield><subfield code="0">(DE-576)13162461X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Work zone scheduling problem in the urban traffic networks</subfield><subfield code="c">Dušan Teodorović, Miloš Nikolić</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</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="506" ind1="0" ind2=" "><subfield code="q">DE-206</subfield><subfield code="a">Open Access</subfield><subfield code="e">Controlled Vocabulary for Access Rights</subfield><subfield code="u">http://purl.org/coar/access_right/c_abf2</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A significant part of highway and street congestion is produced by work zones. Depending on the type of construction and/or rehabilitation activity, street capacity could be significantly decreased, or the street could be completely closed. The work zone generates traffic delays in the street where maintenance is performed. Additionally, the work zone generates additional traffic on the neighboring streets, since many drivers change their routes. There are numerous possible work zone schedules. The total travel time of all network users highly depends on the chosen work zones schedule. Work zones scheduling problem has a natural nested structure that requires to be modeled as a bi-level problem. We considered the bi-level work zones scheduling problem. The objective function in the upper level, which we try to minimize, represents the total travel time of all network users. Relations in the lower level, help us to compute User Equilibrium flows. The proposed solution to the problem is based on the combination of Integer Programming and a heuristic traffic assignment algorithm. The output of the developed model consists of the start time of each work zone. The Sioux Falls benchmark network is used to illustrate the proposed procedures and the achieved performances.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="q">DE-206</subfield><subfield code="a">Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International</subfield><subfield code="f">CC BY-NC-ND 4.0</subfield><subfield code="2">cc</subfield><subfield code="u">https://creativecommons.org/licenses/by-nc-nd/4.0/</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Work Zones</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Traffic Assignment</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CombinatorialOptimization</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Incremental algorithm</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nikolic, Milos</subfield><subfield code="d">1984-</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1139177621</subfield><subfield code="0">(DE-627)896818667</subfield><subfield code="0">(DE-576)492965358</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Ekonomske teme</subfield><subfield code="d">Niš : Faculty of Economics Nis, 2009</subfield><subfield code="g">61(2023), 1 vom: März, Seite 1-18</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)618798846</subfield><subfield code="w">(DE-600)2539222-0</subfield><subfield code="w">(DE-576)322138027</subfield><subfield code="x">2217-3668</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:61</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:1</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:1-18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://sciendo.com/pdf/10.2478/ethemes-2023-0001</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.2478/ethemes-2023-0001</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</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_152</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_206</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_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</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_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</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_4046</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_4326</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2403</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2403</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-LFER</subfield></datafield><datafield tag="936" ind1="u" ind2="w"><subfield code="d">61</subfield><subfield code="j">2023</subfield><subfield code="e">1</subfield><subfield code="c">3</subfield><subfield code="h">1-18</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">61</subfield><subfield code="j">2023</subfield><subfield code="e">1</subfield><subfield code="c">3</subfield><subfield code="h">1-18</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">4325575987</subfield><subfield code="y">x1z</subfield><subfield code="z">26-05-23</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="b">4339969915</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">--%%--</subfield><subfield code="e">n</subfield><subfield code="j">--%%--</subfield><subfield code="y">l01</subfield><subfield code="z">17-06-23</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="r">https://doi.org/10.2478/ethemes-2023-0001</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="r">https://sciendo.com/pdf/10.2478/ethemes-2023-0001</subfield></datafield></record></collection>
score	7.4016027

Nicht das Richtige dabei?

Schreiben Sie uns!

Work zone scheduling problem in the urban traffic networks

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?