<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bar-Gera, Hillel</style></author><author><style face="normal" font="default" size="100%">Boyce, David</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Patriksson, Michael</style></author><author><style face="normal" font="default" size="100%">Labbé, Martine</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Origin-based Network Assignment</style></title><secondary-title><style face="normal" font="default" size="100%">Transportation Planning</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Applied Optimization</style></tertiary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">network optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">Origin-based traffic assignment</style></keyword><keyword><style  face="normal" font="default" size="100%">user equilibrium</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/0-306-48220-7_1</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer US</style></publisher><volume><style face="normal" font="default" size="100%">64</style></volume><pages><style face="normal" font="default" size="100%">1-17</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4020-0546-6</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Most solution methods for the traffic assignment problem can be categorized as either link-based or route-based. Only a few attempts have followed the intermediate, origin-base dapproach. This paper describes the main concepts of a new, origin-based method for the static user equilibrium traffic assignment problem. Computational efficiency in time and memory makes this method suitable for large-scale networks of practical interest. Experimental results show that the new method is especially efficient in finding highly accurate solutions.&lt;/p&gt;
</style></abstract></record></records></xml>