Integration of Timetable Planning and Rolling Stock in Rapid Transit Networks

The aim of this paper is to propose an integrated planning model to adequate the offered capacity and system frequencies to attend the increased passenger demand and traffic congestion around urban and suburban areas. The railway capacity is studied in line planning, however, these planned frequencies were obtained without accounting for rolling stock flows through the rapid transit network. In order to provide the problem more freedom to decide rolling stock flows and therefore better adjusting these flows to passenger demand, a new integrated model is proposed, where frequencies are readjusted. Then, the railway timetable and rolling stock assignment are also calculated, where shunting operations are taken into account. These operations may sometimes malfunction, causing localized incidents that could propagate throughout the entire network due to cascading effects. This type of operations will be penalized with the goal of selectively avoiding them and ameliorating their high malfunction probabilities. Swapping operations will also be ensured using homogeneous rolling stock material and ensuring parkings in strategic stations. We illustrate our model using computational experiments drawn from RENFE (the main Spanish operator of suburban passenger trains) in Madrid, Spain. The results show that through this integrated approach a greater robustness degree can be obtained

Planning and projects: three visionaires Friedmann, J., Trueba, I. and Ramos, A.

It is impossible to talk about planning as a scientific meta-discipline without mentioning one of the most influential worldwide figures in the second half of the twentieth century: John Friedmann. His contribution to the planning concept on his "Planning as Social Learning" theory is still very relevant. This paper shows the intellectual connection between Friedmann and Angel Ramos and Ignacio Trueba, two of the Spanish intellectual drivers in the engineering project knowledge area, who contributed to founding the Engineering Projects Spanish Association. The three of them share a broad vision of the project and abandon the "blue print" planning model. They also see the project as a transformational tool that requires a different planning style to the one which prevailed in the 70s - both in public and private domains. They were pioneers in structuring Knowledge / Action in a different way, both in academic institutions where disciples helped to bring about change- and with direct action via projects.

Arquitectura de supercomputación en la nube para la resolución de problemas de optimización combinatoria

La tesis está focalizada en la resolución de problemas de optimización combinatoria, haciendo uso de las opciones tecnológicas actuales que ofrecen las tecnologías de la información y las comunicaciones, y la investigación operativa. Los problemas de optimización combinatoria se resuelven en general mediante programación lineal y metaheurísticas. La aplicación de las técnicas de resolución de los problemas de optimización combinatoria requiere de una elevada carga computacional, y los algoritmos deben diseñarse, por un lado pensando en la efectividad para encontrar buenas soluciones del problema, y por otro lado, pensando en un uso adecuado de los recursos informáticos disponibles. La programación lineal y las metaheurísticas son técnicas de resolución genéricas, que se pueden aplicar a diferentes problemas, partiendo de una base común que se particulariza para cada problema concreto. En el campo del desarrollo de software, los frameworks cumplen esa función de comenzar un proyecto con el trabajo general ya disponible, con la opción de cambiar o extender ese comportamiento base o genérico, para construir el sistema concreto, lo que permite reducir el tiempo de desarrollo, y amplía las posibilidades de éxito del proyecto. En esta tesis se han desarrollado dos frameworks de desarrollo. El framework ILP permite modelar y resolver problemas de programación lineal, de forma independiente al software de resolución de programación lineal que se utilice. El framework LME permite resolver problemas de optimización combinatoria mediante metaheurísticas. Tradicionalmente, las aplicaciones de resolución de problemas de optimización combinatoria son aplicaciones de escritorio que permiten gestionar toda la información de entrada del problema y resuelven el problema en local, con los recursos hardware disponibles. Recientemente ha aparecido un nuevo paradigma de despliegue y uso de aplicaciones que permite compartir recursos informáticos especializados por Internet. Esta nueva forma de uso de recursos informáticos es la computación en la nube, que presenta el modelo de software como servicio (SaaS). En esta tesis se ha construido una plataforma SaaS, para la resolución de problemas de optimización combinatoria, que se despliega sobre arquitecturas compuestas por procesadores multi-núcleo y tarjetas gráficas, y dispone de algoritmos de resolución basados en frameworks de programación lineal y metaheurísticas. Toda la infraestructura es independiente del problema de optimización combinatoria a resolver, y se han desarrollado tres problemas que están totalmente integrados en la plataforma SaaS. Estos problemas se han seleccionado por su importancia práctica. Uno de los problemas tratados en la tesis, es el problema de rutas de vehículos (VRP), que consiste en calcular las rutas de menor coste de una flota de vehículos, que reparte mercancías a todos los clientes. Se ha partido de la versión más clásica del problema y se han hecho estudios en dos direcciones. Por un lado se ha cuantificado el aumento en la velocidad de ejecución de la resolución del problema en tarjetas gráficas. Por otro lado, se ha estudiado el impacto en la velocidad de ejecución y en la calidad de soluciones, en la resolución por la metaheurística de colonias de hormigas (ACO), cuando se introduce la programación lineal para optimizar las rutas individuales de cada vehículo. Este problema se ha desarrollado con los frameworks ILP y LME, y está disponible en la plataforma SaaS. Otro de los problemas tratados en la tesis, es el problema de asignación de flotas (FAP), que consiste en crear las rutas de menor coste para la flota de vehículos de una empresa de transporte de viajeros. Se ha definido un nuevo modelo de problema, que engloba características de problemas presentados en la literatura, y añade nuevas características, lo que permite modelar los requerimientos de las empresas de transporte de viajeros actuales. Este nuevo modelo resuelve de forma integrada el problema de definir los horarios de los trayectos, el problema de asignación del tipo de vehículo, y el problema de crear las rotaciones de los vehículos. Se ha creado un modelo de programación lineal para el problema, y se ha resuelto por programación lineal y por colonias de hormigas (ACO). Este problema se ha desarrollado con los frameworks ILP y LME, y está disponible en la plataforma SaaS. El último problema tratado en la tesis es el problema de planificación táctica de personal (TWFP), que consiste en definir la configuración de una plantilla de trabajadores de menor coste, para cubrir una demanda de carga de trabajo variable. Se ha definido un modelo de problema muy flexible en la definición de contratos, que permite el uso del modelo en diversos sectores productivos. Se ha definido un modelo matemático de programación lineal para representar el problema. Se han definido una serie de casos de uso, que muestran la versatilidad del modelo de problema, y permiten simular el proceso de toma de decisiones de la configuración de una plantilla de trabajadores, cuantificando económicamente cada decisión que se toma. Este problema se ha desarrollado con el framework ILP, y está disponible en la plataforma SaaS. ABSTRACT The thesis is focused on solving combinatorial optimization problems, using current technology options offered by information technology and communications, and operations research. Combinatorial optimization problems are solved in general by linear programming and metaheuristics. The application of these techniques for solving combinatorial optimization problems requires a high computational load, and algorithms are designed, on the one hand thinking to find good solutions to the problem, and on the other hand, thinking about proper use of the available computing resources. Linear programming and metaheuristic are generic resolution techniques, which can be applied to different problems, beginning with a common base that is particularized for each specific problem. In the field of software development, frameworks fulfill this function that allows you to start a project with the overall work already available, with the option to change or extend the behavior or generic basis, to build the concrete system, thus reducing the time development, and expanding the possibilities of success of the project. In this thesis, two development frameworks have been designed and developed. The ILP framework allows to modeling and solving linear programming problems, regardless of the linear programming solver used. The LME framework is designed for solving combinatorial optimization problems using metaheuristics. Traditionally, applications for solving combinatorial optimization problems are desktop applications that allow the user to manage all the information input of the problem and solve the problem locally, using the available hardware resources. Recently, a new deployment paradigm has appeared, that lets to share hardware and software resources by the Internet. This new use of computer resources is cloud computing, which presents the model of software as a service (SaaS). In this thesis, a SaaS platform has been built for solving combinatorial optimization problems, which is deployed on architectures, composed of multi-core processors and graphics cards, and has algorithms based on metaheuristics and linear programming frameworks. The SaaS infrastructure is independent of the combinatorial optimization problem to solve, and three problems are fully integrated into the SaaS platform. These problems have been selected for their practical importance. One of the problems discussed in the thesis, is the vehicle routing problem (VRP), which goal is to calculate the least cost of a fleet of vehicles, which distributes goods to all customers. The VRP has been studied in two directions. On one hand, it has been quantified the increase in execution speed when the problem is solved on graphics cards. On the other hand, it has been studied the impact on execution speed and quality of solutions, when the problem is solved by ant colony optimization (ACO) metaheuristic, and linear programming is introduced to optimize the individual routes of each vehicle. This problem has been developed with the ILP and LME frameworks, and is available in the SaaS platform. Another problem addressed in the thesis, is the fleet assignment problem (FAP), which goal is to create lower cost routes for a fleet of a passenger transport company. It has been defined a new model of problem, which includes features of problems presented in the literature, and adds new features, allowing modeling the business requirements of today's transport companies. This new integrated model solves the problem of defining the flights timetable, the problem of assigning the type of vehicle, and the problem of creating aircraft rotations. The problem has been solved by linear programming and ACO. This problem has been developed with the ILP and LME frameworks, and is available in the SaaS platform. The last problem discussed in the thesis is the tactical planning staff problem (TWFP), which is to define the staff of lower cost, to cover a given work load. It has been defined a very rich problem model in the definition of contracts, allowing the use of the model in various productive sectors. It has been defined a linear programming mathematical model to represent the problem. Some use cases has been defined, to show the versatility of the model problem, and to simulate the decision making process of setting up a staff, economically quantifying every decision that is made. This problem has been developed with the ILP framework, and is available in the SaaS platform.

Productivity analysis and measurement

The state of the art in productivity measurement and analysis shows a gap between simple methods having little relevance in practice and sophisticated mathematical theory which is unwieldy for strategic and tactical planning purposes, -particularly at company level. An extension is made in this thesis to the method of productivity measurement and analysis based on the concept of added value, appropriate to those companies in which the materials, bought-in parts and services change substantially and a number of plants and inter-related units are involved in providing components for final assembly. Reviews and comparisons of productivity measurement dealing with alternative indices and their problems have been made and appropriate solutions put forward to productivity analysis in general and the added value method in particular. Based on this concept and method, three kinds of computerised models two of them deterministic, called sensitivity analysis and deterministic appraisal, and the third one, stochastic, called risk simulation, have been developed to cope with the planning of productivity and productivity growth with reference to the changes in their component variables, ranging from a single value 'to• a class interval of values of a productivity distribution. The models are designed to be flexible and can be adjusted according to the available computer capacity expected accuracy and 'presentation of the output. The stochastic model is based on the assumption of statistical independence between individual variables and the existence of normality in their probability distributions. The component variables have been forecasted using polynomials of degree four. This model is tested by comparisons of its behaviour with that of mathematical model using real historical data from British Leyland, and the results were satisfactory within acceptable levels of accuracy. Modifications to the model and its statistical treatment have been made as required. The results of applying these measurements and planning models to the British motor vehicle manufacturing companies are presented and discussed.

The need for and improvement of budgetary planning in a multinational corporation

The aim of this research is to improve the planning methodology of Dunlop via an analysis of their annual planning system. This was approached via an investigation of how the plans were developed; extensive interviews, which analysed divisional attitudes and approaches to planning; an analysis of forecast accuracy; and participation in the planning system itself. These investigations revealed certain deficiencies in the operating of the system. In particular, little evidence of formal planning could be found, and some divisions were reacting ex post to the market, rather than planning ex ante. The resulting plans tended to lack resilience and were generally unrealistic, partly because of imposed targets. Similarly, because the links between the elements of the system were often inefficient, previously agreed strategies were not always implemented. The analysis of forecast accuracy in the plans revealed divisions to be poor at most aspects of forecasting. Simple naive models often outperformed divisional forecasts, and much of the error was attributed to systematic, and therefore eliminable factors. These analyses suggested the need for a new system which is proposed in the form of Budgetary Planning. This system involves conceptual changes within the current planning framework. Such changes aim to revise tactical planning in order to meet the needs placed on it by. in particular, strategic planning. Budgetary Planning is an innovation in terms of the current planning literature. It is a total system of annual planning aimed at implementing and controlling the iteratively agreed strategies within the current environment. This is achieved by the generation of tactical alternatives, variable funding and concentration of forecast credibility, all of which aid both the realism and the resilience of planning.

Petroleum pipeline construction planning:a conceptual framework

A cross-country pipeline construction project is exposed to an uncertain environment due to its enormous size (physical, manpower requirement and financial value), complexity in design technology and involvement of external factors. These uncertainties can lead to several changes in project scope during the process of project execution. Unless the changes are properly controlled, the time, cost and quality goals of the project may never be achieved. A methodology is proposed for project control through risk analysis, contingency allocation and hierarchical planning models. Risk analysis is carried out through the analytic hierarchy process (AHP) due to the subjective nature of risks in construction projects. The results of risk analysis are used to determine the logical contingency for project control with the application of probability theory. Ultimate project control is carried out by hierarchical planning model which enables decision makers to take vital decisions during the changing environment of the construction period. Goal programming (GP), a multiple criteria decision-making technique, is proposed for model formulation because of its flexibility and priority-base structure. The project is planned hierarchically in three levels—project, work package and activity. GP is applied separately at each level. Decision variables of each model are different planning parameters of the project. In this study, models are formulated from the owner's perspective and its effectiveness in project control is demonstrated.

Hatékonyság növelése tervezéssel - avagy: aggregált tervezés alkalmazása egy magyar vállalatnál = Improving efficiency with production planning - Applying aggregate planning at a Hungarian company

A cikk alapvető kérdése, hogy miképpen használható a tervezés a termelési folyamatok, s ezzel a vállalati m}uködés egészének hatékonyságnövelése érdekében. A termeléstervezés szintjei és eszközei közül a középtávú aggregált tervezésre koncentrálunk. Ennek oka elsősorban az, hogy tapasztalatunk szerinte tervezési szint gyakorlati alkalmazása még nem tekinthető elterjedtnek, s ebből következően az eszköz alaposabb ismerete és alkalmazásának elterjedése jelentős tartalékokat tárhat fel a m}uködési hatékonyság növelése terén. A dolgozat a termeléstervezés klasszikusnak tekinthető modelljét alkalmazza egy hazai vállalat esetében. Az elemzés során vizsgáljuk a modell alkalmazhatóságát és a különböző tervezési alternatívák hatását a hatékonyság növelésére. A modell számítógépes megoldását a Microsoft Excel Solver programjával végeztük. _______ The article demonstrates how production planning, especially aggregate production planning can positively influence the competitiveness of production firms. First the structure of production planning, different, but interconnected levels of it are introduced than the aggregate planning is elaborated in more details. Reason for focusing on aggregate planning lies in the fact that according to our experience aggregate planning is an operation planning method applied least of all production planning methods in Hungary. Due to this we are convinced that demonstrating a real case study in this area can help managers to realize that adopting it can significantly influence e±ciency in operation and represent important source of development. We applied a classic aggregate planning model for a Hungarian producing company. We have tested the adaptability of the model and also the effect of different concrete planning scenarios on efficiency. Solution of the mathematical model is calculated using the program of Microsoft Excel Solver.

Improving Analytical Travel Time Estimation for Transportation Planning Models

This dissertation aimed to improve travel time estimation for the purpose of transportation planning by developing a travel time estimation method that incorporates the effects of signal timing plans, which were difficult to consider in planning models. For this purpose, an analytical model has been developed. The model parameters were calibrated based on data from CORSIM microscopic simulation, with signal timing plans optimized using the TRANSYT-7F software. Independent variables in the model are link length, free-flow speed, and traffic volumes from the competing turning movements. The developed model has three advantages compared to traditional link-based or node-based models. First, the model considers the influence of signal timing plans for a variety of traffic volume combinations without requiring signal timing information as input. Second, the model describes the non-uniform spatial distribution of delay along a link, this being able to estimate the impacts of queues at different upstream locations of an intersection and attribute delays to a subject link and upstream link. Third, the model shows promise of improving the accuracy of travel time prediction. The mean absolute percentage error (MAPE) of the model is 13% for a set of field data from Minnesota Department of Transportation (MDOT); this is close to the MAPE of uniform delay in the HCM 2000 method (11%). The HCM is the industrial accepted analytical model in the existing literature, but it requires signal timing information as input for calculating delays. The developed model also outperforms the HCM 2000 method for a set of Miami-Dade County data that represent congested traffic conditions, with a MAPE of 29%, compared to 31% of the HCM 2000 method. The advantages of the proposed model make it feasible for application to a large network without the burden of signal timing input, while improving the accuracy of travel time estimation. An assignment model with the developed travel time estimation method has been implemented in a South Florida planning model, which improved assignment results.

Planning and flexible operation of storage systems in power grids: from transmission to distribution networks

The first part of the thesis has been devoted to the transmission planning with high penetration of renewable energy sources. Both stationary and transportable battery energy storage (BES, BEST) systems have been considered in the planning model, so to obtain the optimal set of BES, BEST and transmission lines that minimizes the total cost in a power network. First, a coordinated expansion planning model with fixed transportation cost for BEST devices has been presented; then, the model has been extended to a planning formulation with a distance-dependent transportation cost for the BEST units, and its tractability has been proved through a case study based on a 190-bus test system. The second part of this thesis is then devoted to the analysis of planning and management of renewable energy communities (RECs). Initially, the planning of photovoltaic and BES systems in a REC with an incentive-based remuneration scheme according to the Italian regulatory framework has been analysed, and two planning models, according to a single-stage, or a multi-stage approach, have been proposed in order to provide the optimal set of BES and PV systems allowing to achieve the minimum energy procurement cost in a given REC. Further, the second part of this thesis is devoted to the study of the day-ahead scheduling of resources in renewable energy communities, by considering two types of REC. The first one, which we will refer to as “cooperative community”, allows direct energy transactions between members of the REC; the second type of REC considered, which we shall refer to as “incentive-based”, does not allow direct transactions between members but includes economic revenues for the community shared energy, according to the Italian regulation framework. Moreover, dispatchable renewable energy generation has been considered by including producers equipped with biogas power plants in the community.

The bubbles or the boiling pot?: an ecosystemic approach to culture, environment and quality of life

For the diagnosis and prognosis of the problems of quality of life, a multidisciplinary ecosystemic approach encompasses four dimensions of being-in-the-world, as donors and recipients: intimate, interactive, social and biophysical. Social, cultural and environmental vulnerabilities are understood and dealt with, in different circumstances of space and time, as the conjugated effect of all dimensions of being-in-the-world, as they induce the events (deficits and assets), cope with consequences (desired or undesired) and contribute for change. Instead of fragmented and reduced representations of reality, diagnosis and prognosis of cultural, educational, environmental and health problems considers the connections (assets) and ruptures (deficits) between the different dimensions, providing a planning model to develop and evaluate research, teaching programmes, public policies and field projects. The methodology is participatory, experiential and reflexive; heuristic-hermeneutic processes unveil cultural and epistemic paradigms that orient subject-object relationships; giving people the opportunity to reflect on their own realities, engage in new experiences and find new ways to live better in a better world. The proposal is a creative model for thought and practice, providing many opportunities for discussion, debate and development of holistic projects integrating different scientific domains (social sciences, psychology, education, philosophy, etc.)

Projecto de conceito e estrutura de website: para sensibilizar jovens para uma dieta alimentar saudável

O marketing social veio teorizar a forma como as entidades, públicas ou privadas, tentam alterar comportamentos e hábitos de saúde. A eficácia das campanhas de saúde pública aumentou em grande parte devido ao uso das técnicas de marketing social. A finalidade deste projecto de investigação é elaborar uma proposta de estrutura de website, cujo objectivo consiste em sensibilizar jovens para a necessidade de seguir hábitos alimentares saudáveis, considerando que este pode vir a ser parte de uma estratégia de comunicação de marketing social integrada, criada por um organismo, com ou sem fins lucrativos, ou simplesmente existir enquanto portal de informação online independente. O público-alvo definido para este projecto são os jovens com idades compreendidas entre os 18 e os 34 anos, a frequentar o ensino superior ou que já possuam habilitação superior. Com o intuito de atingir os objectivos propostos elaborou-se um inquérito por questionário, o qual foi analisado quantitativamente. A amostra para esta investigação é constituída por 272 inquiridos. Concluiu-se com este projecto que o processo de planeamento de um website deve ser meticulosamente delineado, quer seja parte integrante de uma campanha, quer actue de forma isolada; e que, quanto melhor se investigarem as disposições do público-alvo, a alteração de comportamentos dos utilizadores, induzida pelo website, será tanto mais possível.

O futuro da liderança de topo na administração pública portuguesa. Forças motrizes e cenários possíveis.

Dissertação de mestrado em Administração Pública, orientada pelo Professor Doutor J. A. Oliveira Rocha apresentada na Escola de Economia e Gestão da Universidade do Minho, em 2006.

Planeamento de redes de distribuição de energia

O planeamento de redes de distribuição tem como objetivo assegurar a existência de capacidade nas redes para a fornecimento de energia elétrica com bons níveis de qualidade de serviço tendo em conta os fatores económicos associados. No âmbito do trabalho apresentado na presente dissertação, foi elaborado um modelo de planeamento que determina a configuração de rede resultante da minimização de custos associados a: 1) perdas por efeito de joule; 2) investimento em novos componentes; 3) energia não entregue. A incerteza associada ao valor do consumo de cada carga é modelada através de lógica difusa. O problema de otimização definido é resolvido pelo método de decomposição de benders que contempla dois trânsitos de potências ótimos (modelo DC e modelo AC) no problema mestre e escravo respectivamente para validação de restrições. Foram também definidos critérios de paragem do método de decomposição de benders. O modelo proposto classifica-se como programação não linear inteira mista e foi implementado na ferramenta de otimização General Algebraic Modeling System (GAMS). O modelo desenvolvido tem em conta todos componentes das redes para a otimização do planeamento, conforme podemos analisar nos casos de estudo implementados. Cada caso de estudo é definido pela variação da importância que cada uma das variáveis do problema toma, tendo em vista cobrir de alguma todos os cenários de operação expetáveis. Através destes casos de estudo verifica-se as várias configurações que a rede pode tomar, tendo em conta as importâncias atribuídas a cada uma das variáveis, bem como os respetivos custos associados a cada solução. Este trabalho oferece um considerável contributo no âmbito do planeamento de redes de distribuição, pois comporta diferentes variáveis para a execução do mesmo. É também um modelo bastante robusto não perdendo o ‘norte’ no encontro de solução para redes de grande dimensão, com maior número de componentes.

Smart machines in day-to-day financial management:

Starting from Novabase’s challenge to launch in the UK Millennials a personal financial advisor mobile application, this work project aims to build a planning model to frame a business side of a launch strategy for mobile application in similar market and category. This study culminates on the design of SPOSTAC planning model. The created framework is intended to effectively and efficiently plan a launch strategy, being structured based on seven sequential elements: Situation, Product, Objectives, Strategy, Tactics, Action, and Control.

O plano de Kenzo Tange para a reconstrução de Skopje: contexto, desenho e evolução

Dissertação de mestrado integrado em Arquitectura (área de especialização de Cultura Arquitectónica)