Now showing items 21-40 of 230

• #### A stochastic version of the strategy-based congested transit assignment model and a technique by smoothing approximations ﻿

(Springer, 2018)
Article
Restricted access - publisher's policy
This paper develops a stochastic version for the strategybased congested transit assignment problem stated by Cominetti and Correa (Trans. Sci. 35(3):250-267, 2001). As a distinctive approach, this stochastic version takes ...
• #### A submodular approach to the efficient placement of electric vehicle charging stations ﻿

(Universitat Politècnica de Catalunya, 2021-10)
Master thesis
Restricted access - author's decision
Covenantee:   Immense
Our contribution is an algorithm for the cardinality constrained placement of EV charge stations that achieves a $1-\frac{1}{e}-\epsilon$ (63\%) approximation guarantee with a computational complexity of \$\mathcal{O}(n ...
• #### A traffic simulation tool for assessing smart city policies (CitScale) ﻿

(2019-09-28)
Article
Open Access
Over the last century, cities have developed as a function of increased usage of automobiles as the standard transport mode. The number of cars increased along with the population as highways and parking spots became ...
• #### AAR-based decomposition algorithm for non-linear convex optimisation ﻿

(2014)
Conference lecture
Open Access

(2016-01-12)
Article
Open Access
O objetivo deste artigo é estudar a eficiência e a robustez de técnicas adaptativas e estimativas de erro orientadas por metas para um benchmark test. As técnicas utilizadas aqui são baseadas em um simples pós-processo das ...
• #### Affectation de véhicules aux routes dans un système de transport multi-école ﻿

(Universitat Politècnica de Catalunya. Centre de Càlcul, 1990)
Article
Open Access
Este artículo describe una parte del sistema TRESCA para la organización del transporte escolar en Andorra. Una vez determinadas las rutas a ofrecer, conviene asignarles los vehículos para minimizar los costes. El algoritmo ...
• #### Algebraic and parametric solvers for the power flow problem: towards real-time and accuracy-guaranteed simulation of electric systems ﻿

(2018-11)
Article
Open Access
The power flow model performs the analysis of electric distribution and transmission systems. With this statement at hand, in this work we present a summary of those solvers for the power flow equations, in both algebraic ...
• #### Algoritmo del elipsoide interior para programación lineal ﻿

(Universitat Politècnica de Catalunya. Centre de Càlcul, 1991)
Article
Open Access
En este artículo se desarrolla un algoritmo de puntos interiores para programación lineal a partir de consideraciones geométricas. En cada iteración del método se dispone de un punto interior al politopo. Con centro en ...
• #### Algoritmos heurísticos deterministas y aleatorios en secuenciación de proyectos con recursos limitados ﻿

(Universitat Politècnica de Catalunya. Centre de Càlcul, 1989)
Article
Open Access
En este trabajo se estudia la eficiencia relativa de un conjunto de algoritmos heurísticos, deterministas y aleatorizados, para el problema de la secuenciación de proyectos con limitación de recursos. Se presentan los ...
• #### Algoritmos para la asignación de pasajeros en redes de transporte público ﻿

(Universitat Politècnica de Catalunya, 2014-06)
Master thesis
Restricted access - author's decision
Los modelos para la asignación de pasajeros son una magnífica herramienta para facilitar la planificación de las redes de transporte público y ayudan en la predicción de la utilización de las diferentes líneas por parte ...
• #### Amplitude of weighted majority game strict representations ﻿

Article
Open Access
Some real situations which may be described as weighted majority games can be modified when some players increase or decrease their weights and/or the quota is modified. Nevertheless, some of these modifications do not ...
• #### An assigment free data driven approach to the dynamic origin destination matrix estimation problem ﻿

(2020-02-05)
Research report
Open Access
Dynamic traffic models require dynamic inputs, and one of the main inputs are the Dynamic Origin-Destinations (OD) matrices describing the variability over time of the trip patterns across the network. The Dynamic OD Matrix ...
• #### An atomistic-based foliation model for multilayer graphene materials and nanotubes ﻿

(2013-01)
Article
Open Access
We present a three-dimensional continuum model for layered crystalline materials made out of weakly interacting two-dimensional crystalline sheets. We specialize the model to multilayer graphene materials, including ...
• #### An augmented Lagrangian formulation to impose boundary conditions for distortion based mesh moving and curving ﻿

(Elsevier, 2017)
Conference report
Restricted access - publisher's policy
We formulate a mesh morphing technique as mesh distortion minimization problem constrained to weakly satisfy the imposed displacement of the boundary nodes. The method is devised to penalize the appearance of inverted ...
• #### An exact algorithm for the mixed-model level scheduling problem ﻿

(Taylor & Francis, 2015-02-05)
Article
Open Access
The Monden Problem, also known as the Output Rate Variation Problem, is one of the original formulations for mixed-model assembly line-level scheduling problems in a just-in-time system. In this paper, we develop a new ...

(International Federation of Automatic Control (IFAC), 1997-06-01)
Article
Open Access
This paper describes an heuristic procedure for the problem of determining the time evolution of traffic flows and routes on a road net work with the key requirement that its computational costs must be appealing so as to ...
• #### An improved heuristic for capacitated location problems: some theoretical considerations about its performance ﻿

(1984)
Research report
Open Access
This paper describes a dual greedy heuristic for capacitated plant location problems and studies its computational behaviour. The good computational results obtained are explained from a theoretical viewpoint by means of ...
• #### An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs ﻿

(2020-10)
Article
Open Access
We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can ...
• #### An introduction to multiprocessor scheduling ﻿

(Universitat Politècnica de Barcelona. Centre de Càlcul, 1981-03)
Article
Open Access
This is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides the framework in which these results are presented. They involve on one hand the development ...
• #### An iterated local search algorithm for the facility location problem ﻿

(Universitat Politècnica de Catalunya, 2014-11-26)
Master thesis
Open Access
Desenvolupar un Iterated Local Search amb tècniques d'aleatorització esbiaixada per solucionar el Uncapacitated Facility Location Problem.