<?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-06-07T02:50:03Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/6915" metadataPrefix="marc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/6915</identifier><datestamp>2024-05-20T06:54:00Z</datestamp><setSpec>com_10259.4_104</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_6848</setSpec></header><metadata><record xmlns="http://www.loc.gov/MARC21/slim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dcterms="http://purl.org/dc/terms/" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
<leader>00925njm 22002777a 4500</leader>
<datafield tag="042" ind1=" " ind2=" ">
<subfield code="a">dc</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Cortínez, Víctor H.</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Dominguez, Patricia N.</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="260" ind1=" " ind2=" ">
<subfield code="c">2021-07</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a">Traffic assignment problem (TAP) in static equilibrium conditions is based on the Wardrop´s&#xd;
first principle. The mathematical solution of this problem involves significant computation&#xd;
times for the analysis of large transportation networks, especially in the context of design.&#xd;
Thus, the development of efficient computational methodologies is of the greatest concern.&#xd;
In this article, a reduced order model for TAP, based on a Finite Element Approach (FEA),&#xd;
is proposed. Such methodology involves four main ideas: a) the TAP formulation including&#xd;
as variables the travel times from any node of the network to the corresponding destination&#xd;
points, b) the solution of the governing algebraic equation system by means of an efficient&#xd;
iterative approach, known as “Physarum”, that takes the travel times as the main unknowns,&#xd;
c) the interpolation of travel times in certain urban subdomains, denominated “finite&#xd;
elements”, in terms of the values corresponding to some main nodes previously selected&#xd;
(reduced unknowns), d) the use of the Galerkin’s method to express the TAP in terms of the&#xd;
reduced unknowns. The model formulation is presented and a numerical example is given&#xd;
to show its efficiency.</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">978-84-18465-12-3</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">http://hdl.handle.net/10259/6915</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">10.36443/10259/6915</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Modelización</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Simulación</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Modelling</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Simulation</subfield>
</datafield>
<datafield tag="245" ind1="0" ind2="0">
<subfield code="a">A finite element approach for the traffic assignment problem</subfield>
</datafield>
</record></metadata></record></GetRecord></OAI-PMH>