<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T17:35:34Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/5374" metadataPrefix="dim">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/5374</identifier><datestamp>2024-05-20T06:50:11Z</datestamp><setSpec>com_10259_4204</setSpec><setSpec>com_10259_5086</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_5373</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
<dim:field mdschema="dc" element="contributor" qualifier="author" authority="484" confidence="500" orcid_id="0000-0003-4747-4433">Rojo Arce, Marta</dim:field>
<dim:field mdschema="dc" element="date" qualifier="accessioned">2020-07-13T10:29:13Z</dim:field>
<dim:field mdschema="dc" element="date" qualifier="available">2020-07-13T10:29:13Z</dim:field>
<dim:field mdschema="dc" element="date" qualifier="issued">2020-07</dim:field>
<dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10259/5374</dim:field>
<dim:field mdschema="dc" element="identifier" qualifier="doi">10.3390/su12145536</dim:field>
<dim:field mdschema="dc" element="identifier" qualifier="essn">2071-1050</dim:field>
<dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Assignment methodologies attempt to determine the traffic flow over each network arc based on its characteristics and the total flow over the entire area. There are several methodologies—some fast and others that are more complex and require more time to complete the calculation. In this study, we evaluated different assignment methodologies using a computer simulation and tested the results in a specific case study. The results showed that the “all-or-nothing” methods and the incremental assignment methods generally yield results with an unacceptable level of error unless the traffic is divided into four or more equal parts. The method of successive averages (MSA) was valid starting from a relatively low number of iterations, while the user equilibrium methodologies (approximated using the Frank and Wolfe algorithm) were valid starting from an even lower number of iterations. These results may be useful to researchers in the field of computer simulation and planners who apply these methodologies in similar cases.</dim:field>
<dim:field mdschema="dc" element="description" qualifier="sponsorship" lang="en">Research Contract entitled “Simulación y Análisis de Tráfico dentro del Estudio Informativo de la Autovía Orbital B-40” (Simulation and Traffic Analysis within the Study Report of the B-40 Orbital Highway) between GPYO Innova, S.L. and the University of Burgos (Spain) with reference number W24T06.</dim:field>
<dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
<dim:field mdschema="dc" element="language" qualifier="iso" lang="es">eng</dim:field>
<dim:field mdschema="dc" element="publisher" lang="es">MDPI</dim:field>
<dim:field mdschema="dc" element="relation" qualifier="ispartof" lang="en">Sustainability. 2020, V. 12, n. 14, 5536</dim:field>
<dim:field mdschema="dc" element="relation" qualifier="publisherversion">https://doi.org/10.3390/su12145536</dim:field>
<dim:field mdschema="dc" element="rights" lang="*">Atribución 4.0 Internacional</dim:field>
<dim:field mdschema="dc" element="rights" qualifier="uri" lang="*">http://creativecommons.org/licenses/by/4.0/</dim:field>
<dim:field mdschema="dc" element="rights" qualifier="accessRights">info:eu-repo/semantics/openAccess</dim:field>
<dim:field mdschema="dc" element="subject" lang="en">assignment models</dim:field>
<dim:field mdschema="dc" element="subject" lang="en">Traffic</dim:field>
<dim:field mdschema="dc" element="subject" lang="en">Simulation</dim:field>
<dim:field mdschema="dc" element="subject" lang="en">Traffic studies</dim:field>
<dim:field mdschema="dc" element="subject" lang="en">Transport planning</dim:field>
<dim:field mdschema="dc" element="subject" qualifier="other" lang="es">Transportes</dim:field>
<dim:field mdschema="dc" element="subject" qualifier="other" lang="en">Transportation</dim:field>
<dim:field mdschema="dc" element="title" lang="en">Evaluation of traffic assignment models through simulation</dim:field>
<dim:field mdschema="dc" element="type">info:eu-repo/semantics/article</dim:field>
<dim:field mdschema="dc" element="type" qualifier="hasVersion">info:eu-repo/semantics/publishedVersion</dim:field>
<dim:field mdschema="dc" element="journal" qualifier="title" lang="en">Sustainability</dim:field>
<dim:field mdschema="dc" element="volume" qualifier="number" lang="es">12</dim:field>
<dim:field mdschema="dc" element="issue" qualifier="number" lang="es">14</dim:field>
<dim:field mdschema="dc" element="page" qualifier="initial" lang="es">5536</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>