patrimonio intelectual

Actas de congresoLas VI Jornadas se realizaron con la exposición de ponencias que se incluyeron en cuatro ejes temáticos, que se desarrollaron de modo sucesivo para facilitar la asistencia, el intercambio y el debate, distribuidos en tres jornadas. Los ejes temáticos abordados fueron: 1. La enseñanza como proyecto de investigación. Recursos de enseñanza-aprendizaje como mejoras de la calidad educativa. 2. La experimentación como proyecto de investigación. Del ensayo a la aplicabilidad territorial, urbana, arquitectónica y de diseño industrial. 3. Tiempo y espacio como proyecto de investigación. Sentido, destino y usos del patrimonio construido y simbólico. 4. Idea constructiva, formulación y ejecución como proyecto de investigación. Búsqueda y elaboración de resultados que conforman los proyectos de la arquitectura y el diseño

On Nash equilibria of a competitive location problem

The location-quality decision of a facility for two competing suppliers in a new market is described by a Huff-like attraction model where the profit that can be reached by each supplier depends on the actions of its competitor. We study the profit maximization problem of the suppliers under binary and proportional customer choice rules, assuming that they make their decisions simultaneously. The main questions are: what are the possible Nash equilibria in such a situation, how are they characterised and by which computational methods can they be determined? We report on finding

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum Capacity Shortest Path problem. For this latter problem, an effective implementation is devised for an algorithm to determine desired sets of efficient solutions which in turn facilitates the search for a “best” compromise solution. Numerical experience with the algorithm is reported

On the location of new facilities for chain expansion under delivered pricing

We study the problem of locating new facilities for one expanding chain which competes for demand in spatially separated markets where all competing chains use delivered pricing. A new network location model is formulated for profit maximization of the expanding chain assuming that equilibrium prices are set in each market. The cannibalization effect caused by the entrance of the new facilities is integrated in the objective function as a cost to be paid by the expanding chain to the cannibalized facilities. It is shown that the profit of the chain is maximized by locating the new facilities in a set of points which are nodes or iso-marginal delivered cost points (points on the network from which the marginal delivered cost equals the minimum marginal delivered cost from the existing facilities owned by the expanding chain). Then the location problem is reduced to a discrete optimization problem which is formulated as a mixed integer linear program. A sensitivity analysis respect to both the number of new facilities and the cannibalization cost is shown by using an illustrative example with data of the region of Murcia (Spain). Some conclusions are presented. © 2011 Elsevier Ltd