@inproceedings{Behrisch2008b,
	author = {Michael Behrisch and Daniel Krajzewicz and Peter Wagner and Yun-Pang Wang},
	booktitle = {DTA2008 International Symposium on Dynamic Traffic Assignment},
	title = {Comparison of Methods for Increasing the Performance of a DUA Computation},
	year = {2008},
	month = {Mai},
	abstract = {Computing realistic routes for a given road network and a known demand
	of vehicles is one of the most important steps when preparing a road
	traffic simulation. The approach developed by Christian Gawron in
	1998 which we use for this purpose computes a dynamic user equilibrium
	by iteratively performing the simulation and computing new vehicle
	routes. The results are valid, but the computation is very time consuming
	due to the need to perform both the complete simulation and rerouting
	of all vehicles within each iteration step. Herein, we want to discuss
	some approaches to reduce the needed time and memory consumption.
	The results show that this can be achieved without reducing the algorithm?s
	quality.},
	groups = {used, assignment, TS, assigned2groups},
	journal = {Proceedings of DTA2008},
	keywords = {microscopic simulation, traffic assignment, SUE, DUA},
	owner = {Daniel},
	timestamp = {2011.12.02},
	url = {http://elib.dlr.de/55173/}
}

{"_id":{"_str":"536d286d4c6bdacb2800035a"},"__v":0,"authorIDs":[],"author_short":["Behrisch, M.","Krajzewicz, D.","Wagner, P.","Wang, Y."],"bibbaseid":"behrisch-krajzewicz-wagner-wang-comparisonofmethodsforincreasingtheperformanceofaduacomputation-2008","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Michael"],"propositions":[],"lastnames":["Behrisch"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Krajzewicz"],"suffixes":[]},{"firstnames":["Peter"],"propositions":[],"lastnames":["Wagner"],"suffixes":[]},{"firstnames":["Yun-Pang"],"propositions":[],"lastnames":["Wang"],"suffixes":[]}],"booktitle":"DTA2008 International Symposium on Dynamic Traffic Assignment","title":"Comparison of Methods for Increasing the Performance of a DUA Computation","year":"2008","month":"Mai","abstract":"Computing realistic routes for a given road network and a known demand of vehicles is one of the most important steps when preparing a road traffic simulation. The approach developed by Christian Gawron in 1998 which we use for this purpose computes a dynamic user equilibrium by iteratively performing the simulation and computing new vehicle routes. The results are valid, but the computation is very time consuming due to the need to perform both the complete simulation and rerouting of all vehicles within each iteration step. Herein, we want to discuss some approaches to reduce the needed time and memory consumption. The results show that this can be achieved without reducing the algorithm?s quality.","groups":"used, assignment, TS, assigned2groups","journal":"Proceedings of DTA2008","keywords":"microscopic simulation, traffic assignment, SUE, DUA","owner":"Daniel","timestamp":"2011.12.02","url":"http://elib.dlr.de/55173/","bibtex":"@inproceedings{Behrisch2008b,\n\tauthor = {Michael Behrisch and Daniel Krajzewicz and Peter Wagner and Yun-Pang Wang},\n\tbooktitle = {DTA2008 International Symposium on Dynamic Traffic Assignment},\n\ttitle = {Comparison of Methods for Increasing the Performance of a DUA Computation},\n\tyear = {2008},\n\tmonth = {Mai},\n\tabstract = {Computing realistic routes for a given road network and a known demand\n\tof vehicles is one of the most important steps when preparing a road\n\ttraffic simulation. The approach developed by Christian Gawron in\n\t1998 which we use for this purpose computes a dynamic user equilibrium\n\tby iteratively performing the simulation and computing new vehicle\n\troutes. The results are valid, but the computation is very time consuming\n\tdue to the need to perform both the complete simulation and rerouting\n\tof all vehicles within each iteration step. Herein, we want to discuss\n\tsome approaches to reduce the needed time and memory consumption.\n\tThe results show that this can be achieved without reducing the algorithm?s\n\tquality.},\n\tgroups = {used, assignment, TS, assigned2groups},\n\tjournal = {Proceedings of DTA2008},\n\tkeywords = {microscopic simulation, traffic assignment, SUE, DUA},\n\towner = {Daniel},\n\ttimestamp = {2011.12.02},\n\turl = {http://elib.dlr.de/55173/}\n}\n\n\n","author_short":["Behrisch, M.","Krajzewicz, D.","Wagner, P.","Wang, Y."],"key":"Behrisch2008b","id":"Behrisch2008b","bibbaseid":"behrisch-krajzewicz-wagner-wang-comparisonofmethodsforincreasingtheperformanceofaduacomputation-2008","role":"author","urls":{"Paper":"http://elib.dlr.de/55173/"},"keyword":["microscopic simulation","traffic assignment","SUE","DUA"],"metadata":{"authorlinks":{}},"downloads":5},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/eclipse/sumo/main/docs/sumo.bib","downloads":5,"keywords":["microscopic simulation","traffic assignment","sue","dua"],"search_terms":["comparison","methods","increasing","performance","dua","computation","behrisch","krajzewicz","wagner","wang"],"title":"Comparison of Methods for Increasing the Performance of a DUA Computation","year":2008,"dataSources":["66NTXxZwo8WZwAFCa","n7xZzbjha4s6NhjNG"]}