Data Mining with Enhanced Neural Networks-CMMSE

Abstract This paper presents a new method to extract knowledge from existing data sets, that is, to extract symbolic rules using the weights of an Artificial Neural Network. The method has been applied to a neural network with special architecture named Enhanced Neural Network (ENN). This architecture improves the results that have been obtained with multilayer perceptron (MLP). The relationship among the knowledge stored in the weights, the performance of the network and the new implemented algorithm to acquire rules from the weights is explained. The method itself gives a model to follow in the knowledge acquisition with ENN.

Active Learning and Dynamic Pricing Policies

In this paper, we address the problem of dynamic pricing to optimize the revenue coming from the sales of a limited inventory in a finite time-horizon. A priori, the demand is assumed to be unknown. The seller must learn on the fly. We first deal with the simplest case, involving only one class of product for sale. Furthermore the general situation is considered with a finite number of product classes for sale. In particular, a case in point is the sale of tickets for events related to culture and leisure; in this case, typically the tickets are sold months before the event, thus, uncertainty over actual demand levels is a very a common occurrence. We propose a heuristic strategy of adaptive dynamic pricing, based on experience gained from the past, taking into account, for each time period, the available inventory, the time remaining to reach the horizon, and the profit made in previous periods. In the computational simulations performed, the demand is updated dynamically based on the prices being offered, as well as on the remaining time and inventory. The simulations show a significant profit over the fixed-price strategy, confirming the practical usefulness of the proposed strategy. We develop a tool allowing us to test different dynamic pricing strategies designed to fit market conditions and seller s objectives, which will facilitate data analysis and decision-making in the face of the problem of dynamic pricing.

Geometric Study of the Weak Equilibrium in a Weighted Case for a Two-Dimensional Competition Game

In this work, an improvement of the results presented by [1] Abellanas et al. (Weak Equilibrium in a Spatial Model. International Journal of Game Theory, 40(3), 449-459) is discussed. Concretely, this paper investigates an abstract game of competition between two players that want to earn the maximum number of points from a finite set of points in the plane. It is assumed that the distribution of these points is not uniform, so an appropriate weight to each position is assigned. A definition of equilibrium which is weaker than the classical one is included in order to avoid the uniqueness of the equilibrium position typical of the Nash equilibrium in these kinds of games. The existence of this approximated equilibrium in the game is analyzed by means of computational geometry techniques.

Discrete Multi-Criteria Methods for lands use and conservation planning on La Colacha in Arroyos Menores (R��o Cuarto, Province of C��rdoba, Argentina)

The study area is La Colacha sub-basins from Arroyos Menores basins, natural areas at West and South of R��o Cuarto in Province of C��rdoba of Argentina, fertile with loess soils and monsoon temperate climate, but with soil erosions including regressive gullies that degrade them progressively. Cultivated gently since some hundred sixty years, coordinated action planning became necessary to conserve lands while keeping good agro-production. The authors had improved data on soils and on hydrology for the study area, evaluated systems of soil uses and actions to be recommended and applied Decision Support Systems (DSS) tools for that, and were conducted to use discrete multi-criteria models (MCDM) for the more global views about soil conservation and hydraulic management actions and about main types of use of soils. For that they used weighted PROMETHEE, ELECTRE, and AHP methods with a system of criteria grouped as environmental, economic and social, and criteria from their data on effects of criteria. The alternatives resulting offer indication for planning depending somehow on sub basins and on selections of weights, but actions for conservation of soils and water management measures are recommended to conserve the basins conditions, actually sensibly degrading, mainly keeping actual uses of the lands.

Coordination mechanisms and software in industrial networks - a literature review

This paper groups recent supply chain management research focused on organizational design and its software support. The classification encompasses criteria related to research methodology and content. Empirical studies from management science focus on network types and organizational fit. Novel planning algorithms and innovative coordination schemes are developed mostly in the field of operations research in order to propose new software features. Operations and production management realize cost-benefit analysis of IT software implementations. The success of software solutions for network coordination depends strongly on the fit of three dimensions: network configuration, coordination scheme and software functionality. This paper concludes with proposals for future research on unaddressed issues within and among the identified research streams.

An Ant Colony System adaptation to deal with accessibility issues after a disaster

One of the main problems relief teams face after a natural or man-made disaster is how to plan rural road repair work tasks to take maximum advantage of the limited available financial and human resources. Previous research focused on speeding up repair work or on selecting the location of health centers to minimize transport times for injured citizens. In spite of the good results, this research does not take into account another key factor: survivor accessibility to resources. In this paper we account for the accessibility issue, that is, we maximize the number of survivors that reach the nearest regional center (cities where economic and social activity is concentrated) in a minimum time by planning which rural roads should be repaired given the available financial and human resources. This is a combinatorial problem since the number of connections between cities and regional centers grows exponentially with the problem size, and exact methods are no good for achieving an optimum solution. In order to solve the problem we propose using an Ant Colony System adaptation, which is based on ants? foraging behavior. Ants stochastically build minimal paths to regional centers and decide if damaged roads are repaired on the basis of pheromone levels, accessibility heuristic information and the available budget. The proposed algorithm is illustrated by means of an example regarding the 2010 Haiti earthquake, and its performance is compared with another metaheuristic, GRASP.

A Fuzzy approach based on dynamic programming and metaheuristics for selecting safeguards for risk management for information systems

In this paper we focus on the selection of safeguards in a fuzzy risk analysis and management methodology for information systems (IS). Assets are connected by dependency relationships, and a failure of one asset may affect other assets. After computing impact and risk indicators associated with previously identified threats, we identify and apply safeguards to reduce risks in the IS by minimizing the transmission probabilities of failures throughout the asset network. However, as safeguards have associated costs, the aim is to select the safeguards that minimize costs while keeping the risk within acceptable levels. To do this, we propose a dynamic programming-based method that incorporates simulated annealing to tackle optimizations problems.

Veto values in Group Decision Making within MAUT: aggregating complete rankings derived from dominance intensity measures

We consider a groupdecision-making problem within multi-attribute utility theory, in which the relative importance of decisionmakers (DMs) is known and their preferences are represented by means of an additive function. We allow DMs to provide veto values for the attribute under consideration and build veto and adjust functions that are incorporated into the additive model. Veto functions check whether alternative performances are within the respective veto intervals, making the overall utility of the alternative equal to 0, where as adjust functions reduce the utilty of the alternative performance to match the preferences of other DMs. Dominance measuring methods are used to account for imprecise information in the decision-making scenario and to derive a ranking of alternatives for each DM. Specifically, ordinal information about the relative importance of criteria is provided by each DM. Finally, an extension of Kemeny's method is used to aggregate the alternative rankings from the DMs accounting for the irrelative importance.

Evaluation of configurations of supply networks supported by it systems

Los sistemas transaccionales tales como los programas inform��ticos para la planificaci��n de recursos empresariales (ERP software) se han implementado ampliamente mientras que los sistemas anal��ticos para la gesti��n de la cadena de suministro (SCM software) no han tenido el ��xito deseado por la industria de tecnolog��a de informaci��n (TI). Aunque se documentan beneficios importantes derivados de las implantaciones de SCM software, las empresas industriales son reacias a invertir en este tipo de sistemas. Por una parte esto es debido a la falta de m��todos que son capaces de detectar los beneficios por emplear esos sistemas, y por otra parte porque el coste asociado no est�� identificado, detallado y cuantificado suficientemente. Los esquemas de coordinaci��n basados ��nicamente en sistemas ERP son alternativas v��lidas en la pr��ctica industrial siempre que la relaci��n coste-beneficio esta favorable. Por lo tanto, la evaluaci��n de formas organizativas teniendo en cuenta expl��citamente el coste debido a procesos administrativos, en particular por ciclos iterativos, es de gran inter��s para la toma de decisiones en el ��mbito de inversiones en TI. Con el fin de cerrar la brecha, el prop��sito de esta investigaci��n es proporcionar m��todos de evaluaci��n que permitan la comparaci��n de diferentes formas de organizaci��n y niveles de soporte por sistemas inform��ticos. La tesis proporciona una amplia introducci��n, analizando los retos a los que se enfrenta la industria. Concluye con las necesidades de la industria de SCM software: unas herramientas que facilitan la evaluaci��n integral de diferentes propuestas de organizaci��n. A continuaci��n, la terminolog��a clave se detalla centr��ndose en la teor��a de la organizaci��n, las peculiaridades de inversi��n en TI y la tipolog��a de software de gesti��n de la cadena de suministro. La revisi��n de la literatura clasifica las contribuciones recientes sobre la gesti��n de la cadena de suministro, tratando ambos conceptos, el dise��o de la organizaci��n y su soporte por las TI. La clasificaci��n incluye criterios relacionados con la metodolog��a de la investigaci��n y su contenido. Los estudios emp��ricos en el ��mbito de la administraci��n de empresas se centran en tipolog��as de redes industriales. Nuevos algoritmos de planificaci��n y esquemas de coordinaci��n innovadoras se desarrollan principalmente en el campo de la investigaci��n de operaciones con el fin de proponer nuevas funciones de software. Art��culos procedentes del ��rea de la gesti��n de la producci��n se centran en el an��lisis de coste y beneficio de las implantaciones de sistemas. La revisi��n de la literatura revela que el ��xito de las TI para la coordinaci��n de redes industriales depende en gran medida de caracter��sticas de tres dimensiones: la configuraci��n de la red industrial, los esquemas de coordinaci��n y las funcionalidades del software. La literatura disponible est�� enfocada sobre todo en los beneficios de las implantaciones de SCM software. Sin embargo, la coordinaci��n de la cadena de suministro, bas��ndose en el sistema ERP, sigue siendo la pr��ctica industrial generalizada, pero el coste de coordinaci��n asociado no ha sido abordado por los investigadores. Los fundamentos de dise��o organizativo eficiente se explican en detalle en la medida necesaria para la comprensi��n de la s��ntesis de las diferentes formas de organizaci��n. Se han generado varios esquemas de coordinaci��n variando los siguientes par��metros de dise��o: la estructura organizativa, los mecanismos de coordinaci��n y el soporte por TI. Las diferentes propuestas de organizaci��n desarrolladas son evaluadas por un m��todo heur��stico y otro basado en la simulaci��n por eventos discretos. Para ambos m��todos, se tienen en cuenta los principios de la teor��a de la organizaci��n. La falta de rendimiento empresarial se debe a las dependencias entre actividades que no se gestionan adecuadamente. Dentro del m��todo heur��stico, se clasifican las dependencias y se mide su intensidad bas��ndose en factores contextuales. A continuaci��n, se valora la idoneidad de cada elemento de dise��o organizativo para cada dependencia espec��fica. Por ��ltimo, cada forma de organizaci��n se eval��a bas��ndose en la contribuci��n de los elementos de dise��o tanto al beneficio como al coste. El beneficio de coordinaci��n se refiere a la mejora en el rendimiento log��stico - este concepto es el objeto central en la mayor��a de modelos de evaluaci��n de la gesti��n de la cadena de suministro. Por el contrario, el coste de coordinaci��n que se debe incurrir para lograr beneficios no se suele considerar en detalle. Procesos iterativos son costosos si se ejecutan manualmente. Este es el caso cuando SCM software no est�� implementada y el sistema ERP es el ��nico instrumento de coordinaci��n disponible. El modelo heur��stico proporciona un procedimiento simplificado para la clasificaci��n sistem��tica de las dependencias, la cuantificaci��n de los factores de influencia y la identificaci��n de configuraciones que indican el uso de formas organizativas y de soporte de TI m��s o menos complejas. La simulaci��n de eventos discretos se aplica en el segundo modelo de evaluaci��n utilizando el paquete de software ���Plant Simulation���. Con respecto al rendimiento log��stico, por un lado se mide el coste de fabricaci��n, de inventario y de transporte y las penalizaciones por p��rdida de ventas. Por otro lado, se cuantifica expl��citamente el coste de la coordinaci��n teniendo en cuenta los ciclos de coordinaci��n iterativos. El m��todo se aplica a una configuraci��n de cadena de suministro ejemplar considerando diversos par��metros. Los resultados de la simulaci��n confirman que, en la mayor��a de los casos, el beneficio aumenta cuando se intensifica la coordinaci��n. Sin embargo, en ciertas situaciones en las que se aplican ciclos de planificaci��n manuales e iterativos el coste de coordinaci��n adicional no siempre conduce a mejor rendimiento log��stico. Estos resultados inesperados no se pueden atribuir a ning��n par��metro particular. La investigaci��n confirma la gran importancia de nuevas dimensiones hasta ahora ignoradas en la evaluaci��n de propuestas organizativas y herramientas de TI. A trav��s del m��todo heur��stico se puede comparar de forma r��pida, pero s��lo aproximada, la eficiencia de diferentes formas de organizaci��n. Por el contrario, el m��todo de simulaci��n es m��s complejo pero da resultados m��s detallados, teniendo en cuenta par��metros espec��ficos del contexto del caso concreto y del dise��o organizativo. ABSTRACT Transactional systems such as Enterprise Resource Planning (ERP) systems have been implemented widely while analytical software like Supply Chain Management (SCM) add-ons are adopted less by manufacturing companies. Although significant benefits are reported stemming from SCM software implementations, companies are reluctant to invest in such systems. On the one hand this is due to the lack of methods that are able to detect benefits from the use of SCM software and on the other hand associated costs are not identified, detailed and quantified sufficiently. Coordination schemes based only on ERP systems are valid alternatives in industrial practice because significant investment in IT can be avoided. Therefore, the evaluation of these coordination procedures, in particular the cost due to iterations, is of high managerial interest and corresponding methods are comprehensive tools for strategic IT decision making. The purpose of this research is to provide evaluation methods that allow the comparison of different organizational forms and software support levels. The research begins with a comprehensive introduction dealing with the business environment that industrial networks are facing and concludes highlighting the challenges for the supply chain software industry. Afterwards, the central terminology is addressed, focusing on organization theory, IT investment peculiarities and supply chain management software typology. The literature review classifies recent supply chain management research referring to organizational design and its software support. The classification encompasses criteria related to research methodology and content. Empirical studies from management science focus on network types and organizational fit. Novel planning algorithms and innovative coordination schemes are developed mostly in the field of operations research in order to propose new software features. Operations and production management researchers realize cost-benefit analysis of IT software implementations. The literature review reveals that the success of software solutions for network coordination depends strongly on the fit of three dimensions: network configuration, coordination scheme and software functionality. Reviewed literature is mostly centered on the benefits of SCM software implementations. However, ERP system based supply chain coordination is still widespread industrial practice but the associated coordination cost has not been addressed by researchers. Fundamentals of efficient organizational design are explained in detail as far as required for the understanding of the synthesis of different organizational forms. Several coordination schemes have been shaped through the variation of the following design parameters: organizational structuring, coordination mechanisms and software support. The different organizational proposals are evaluated using a heuristic approach and a simulation-based method. For both cases, the principles of organization theory are respected. A lack of performance is due to dependencies between activities which are not managed properly. Therefore, within the heuristic method, dependencies are classified and their intensity is measured based on contextual factors. Afterwards the suitability of each organizational design element for the management of a specific dependency is determined. Finally, each organizational form is evaluated based on the contribution of the sum of design elements to coordination benefit and to coordination cost. Coordination benefit refers to improvement in logistic performance ��� this is the core concept of most supply chain evaluation models. Unfortunately, coordination cost which must be incurred to achieve benefits is usually not considered in detail. Iterative processes are costly when manually executed. This is the case when SCM software is not implemented and the ERP system is the only available coordination instrument. The heuristic model provides a simplified procedure for the classification of dependencies, quantification of influence factors and systematic search for adequate organizational forms and IT support. Discrete event simulation is applied in the second evaluation model using the software package ���Plant Simulation���. On the one hand logistic performance is measured by manufacturing, inventory and transportation cost and penalties for lost sales. On the other hand coordination cost is explicitly considered taking into account iterative coordination cycles. The method is applied to an exemplary supply chain configuration considering various parameter settings. The simulation results confirm that, in most cases, benefit increases when coordination is intensified. However, in some situations when manual, iterative planning cycles are applied, additional coordination cost does not always lead to improved logistic performance. These unexpected results cannot be attributed to any particular parameter. The research confirms the great importance of up to now disregarded dimensions when evaluating SCM concepts and IT tools. The heuristic method provides a quick, but only approximate comparison of coordination efficiency for different organizational forms. In contrast, the more complex simulation method delivers detailed results taking into consideration specific parameter settings of network context and organizational design.

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.

Metodolog��a para la optimizaci��n y an��lisis de la respuesta de medios e infraestructuras en el sistema aeroportuario en operaciones invernales mediante modelos basados en algor��tmos gen��ticos

En este estudio, englobado dentro del campo de la investigaci��n operacional en aeropuertos, se considera el problema de la optimizaci��n de la secuencia de descontaminaci��n de nieve de los tramos que componen el ��rea de maniobras de un aeropuerto, denominado RM-AM. Este problema se enfrenta a la optimizaci��n de recursos limitados para retirar la nieve de las calles de rodadura y pistas, dej��ndolas en un estado aceptable para la operaci��n de aeronaves. El campo de vuelos se divide en subconjuntos de tramos significativos para la operaci��n y se establecen tiempos objetivo de apertura al tr��fico de aeronaves. Se desarrollan varios algoritmos matem��ticos en los que se proponen distintas funciones objetivo, como son la hora de finalizaci��n del proceso, la suma de las horas de finalizaci��n de cada tramo, o el retraso entre la hora estimada y la hora de finalizaci��n. Durante este proceso, se van introduciendo restricciones operativas relativas al cumplimiento de objetivos operativos parciales aplicados a las zonas de especial inter��s, o relativas a la operaci��n de los equipos de descontaminaci��n. El problema se resuelve mediante optimizaci��n basada en programaci��n lineal. Los resultados de las pruebas computacionales se hacen sobre cinco modelos de ��rea de maniobras en los que va creciendo la complejidad y el tama��o. Se comparan las prestaciones de los distintos algoritmos. Una vez definido el modelo matem��tico para la optiamizaci��n, se propone una metodolog��a estructurada para abordar dicho problema para cualquier ��rea de manobras. Se define una estrategia en la operaci��n. Se acomete el ��rea de maniobras por zonas, con la condici��n de que los subconjuntos de tramos significativos queden englobados dentro de una sola de estas zonas. El problema se resuelve mediante un proceso iterativo de optimizaci��n aplicado sucesivamente a las zonas que componen el ��rea de maniobras durante cada iteraci��n. Se analiza la repercusi��n de los resultados en los procesos DMAN, AMAN y TP, para la integraci��n de los resultados en el c��lculo de TSAT y EBIT. El m��todo se particulariza para el caso del ��rea de maniobras del Aeropuerto Adolfo Su��rez Madrid Barajas. ABSTRACT This study, which lies within the field of operations research in airports, considers the optimisation of the sequence for clearing snow from stretches of the manoeuvring area of an airport, known as RM-AM. This issue involves the optimisation of limited resources to remove snow from taxiways and runways thereby leaving them in an acceptable condition for operating aircraft. The airfield is divided into subsets of significant stretches for the purpose of operations and target times are established during which these are open to aircraft traffic. The study contains several mathematical models each with different functions, such as the end time of the process, the sum of the end times of each stretch, and gap between the estimated and the real end times. During this process, we introduce different operating restrictions on partial fulfilment of the operational targets as applied to zones of special interest, or relating to the operation of the snow-clearing machines. The problem is solved by optimisation based on linear programming. Computational tests are carried out on five distinct models of the manoeuvring area, which cover increasingly complex situations and larger areas. The different algorithms are then compared to one other. Having defined the mathematical model for the optimisation, we then set out a structured methodology to deal with any type of manoeuvring area. In other words, we define an operational strategy. The airfield is divided into subsets of significant stretches for the purpose of operations and target times are set at which these are to be open to aircraft traffic. The manoeuvring area is also divided into zones, with the condition that the subsets of significant stretches lie within just one of these zones. The problem is solved by an iterative optimisation process based on linear programming applied successively to the zones that make up the manoeuvring area during each iteration. The impact of the results on DMAN, AMAN and TP processes is analysed for their integration into the calculation of TSAT and EBIT. The method is particularized for the case of the manoeuvring area of Adolfo Suarez Madrid - Barajas Airport.

UMA AN��LISE DA RELA����O ENTRE VARI��VEIS MACROECON��MICAS E O COMPORTAMENTO DAS A����ES DE MAIOR LIQUIDEZ DO ��NDICE IBOVESPA

As a����es de maior liquidez do ��ndice IBOVESPA, refletem o comportamento das a����es de um modo geral, bem como a rela����o das vari��veis macroecon��micas em seu comportamento e est��o entre as mais negociadas no mercado de capitais brasileiro. Desta forma, pode-se entender que h�� reflexos de fatores que impactam as empresas de maior liquidez que definem o comportamento das vari��veis macroecon��micas e que o inverso tamb��m �� uma verdade, oscila����es nos fatores macroecon��micos tamb��m afetam as a����es de maior liquidez, como IPCA, PIB, SELIC e Taxa de C��mbio. O estudo prop��e uma an��lise da rela����o existente entre vari��veis macroecon��micas e o comportamento das a����es de maior liquidez do ��ndice IBOVESPA, corroborando com estudos que buscam entender a influ��ncia de fatores macroecon��micos sobre o pre��o de a����es e contribuindo empiricamente com a forma����o de portf��lios de investimento. O trabalho abrangeu o per��odo de 2008 a 2014. Os resultados conclu��ram que a forma����o de carteiras, visando a prote����o do capital investido, deve conter ativos com correla����o negativa em rela����o ��s vari��veis estudadas, o que torna poss��vel a composi����o de uma carteira com risco reduzido.

Log��stica operacional: aloca����o de bases operacionais em distribui����o de energia el��trica.

Ser eficiente �� um requisito para a sustentabilidade das empresas concession��rias de distribui����o de energia el��trica no Brasil. A busca pela efici��ncia deve estar em harmonia com a melhoria cont��nua da qualidade, da seguran��a e da satisfa����o dos consumidores e das partes envolvidas. O desafio de atender m��ltiplos objetivos requer que as empresas do setor desenvolvam solu����es inovadoras, com a mudan��a de processos, tecnologia, estrutura e a capacita����o das pessoas. Desenvolver um modelo operacional eficiente e uma gest��o rigorosa dos custos s��o fatores-chave para o sucesso das empresas, considerando o contexto regulat��rio de revis��o tarif��ria que incentiva a melhoria do desempenho. O modelo operacional �� definido a partir da organiza����o log��stica dos recursos para atendimento da demanda de servi��os, que define tamb��m os custos fixos e vari��veis de pessoal (sal��rio, horas extras, refei����es), infraestrutura (manuten����o de pr��dios, ferramentas e equipamentos) e deslocamentos (manuten����o de ve��culos, combust��vel), por exemplo. A melhor aloca����o e o melhor dimensionamento de bases operacionais possibilitam a redu����o dos custos com deslocamento e infraestrutura, favorecendo o aproveitamento da for��a de trabalho em campo, a melhoria do atendimento dos clientes e da seguran��a dos colaboradores. Este trabalho apresenta uma metodologia de otimiza����o de custos atrav��s da aloca����o de bases e equipes operacionais, com o modelamento matem��tico dos objetivos e restri����es do neg��cio e a aplica����o de algoritmo evolutivo para busca das melhores solu����es, sendo uma aplica����o de Pesquisa Operacional, no campo da Localiza����o de Instala����es, em distribui����o de energia el��trica. O modelo de otimiza����o desenvolvido possibilita a busca pelo ponto de equil��brio ��timo que minimiza o custo total formado pelos custos de infraestrutura, frota (ve��culos e deslocamentos) e pessoal. O algoritmo evolutivo aplicado no modelo oferece solu����es otimizadas pelo melhoramento de conjuntos de vari��veis bin��rias com base em conceitos da evolu����o gen��tica. O modelo de otimiza����o fornece o detalhamento de toda a estrutura operacional e de custos para uma determinada solu����o do problema, utilizando premissas de produtividade e deslocamentos (velocidades e dist��ncias) para definir as abrang��ncias de atua����o das bases operacionais, recursos (equipes, pessoas, ve��culos) necess��rios para atendimento da demanda de servi��os, e projetar todos os custos fixos e vari��veis associados. A metodologia desenvolvida neste trabalho considera tamb��m a proje����o de demanda futura para a aplica����o no estudo de caso, que evidenciou a efetividade da metodologia como ferramenta para a melhoria da efici��ncia operacional em empresas de distribui����o de energia el��trica.

Coordena����o da entrega de ajuda a v��timas de desastre: uma abordagem multicrit��rio com pensamento focado em valor.

Este trabalho trata da log��stica envolvida em opera����es de resposta a desastres, com foco na entrega final de suprimentos destinados a ajudar v��timas. Seu prop��sito �� investigar os objetivos pertinentes ao planejamento do transporte da carga e encontrar uma metodologia para definir estrat��gia que sirva �� tomada de decis��o em campo. Para tanto, primeiramente identifica-se os objetivos adotados em modelos de Pesquisa Operacional para a tarefa em quest��o, atrav��s da an��lise de conte��do das publica����es pertinentes. Ent��o, a abordagem do Pensamento Focado em Valores �� utilizada para estruturar o problema. Finalmente, o m��todo Simple Multi-Attribute Rating Technique Exploiting Ranks (SMARTER) �� empregado na constru����o de um modelo de An��lise da Decis��o Multicrit��rio (ADM), com consulta a um profissional experiente da ��rea humanit��ria e aproveitando a an��lise da literatura previamente realizada. Neste processo, s��o elaboradas e avaliadas seis alternativas para a tomada de decis��o condizentes com os valores da comunidade humanit��ria. Os resultados obtidos mostram que existe incompatibilidade entre os crit��rios de desempenho identificados nas publica����es existentes e os objetivos perseguidos pelo Tomador da Decis��o (TD) real. De acordo com o modelo constru��do, o atendimento de prioridades e a manuten����o da sustentabilidade da opera����o s��o os objetivos que devem ser levados em conta para planejar a entrega de carga em p��s-desastre, sendo que o custo e a equidade da distribui����o n��o devem ser considerados. Conclui-se que o m��todo adotado �� ��til �� defini����o destes crit��rios e tamb��m ao desenvolvimento de estrat��gias que resultem em distribui����es de ajuda melhores, aos olhos do pr��prio TD. Desta forma, ressalta-se que este trabalho contribui �� ��rea da Log��stica Humanit��ria com a investiga����o dos objetivos, assim como ao campo da ADM pela formaliza����o dos processos de elabora����o de alternativas, al��m da adi����o de mais uma aplica����o poss��vel ao repert��rio do m��todo SMARTER.

TravTek evaluation task C3 - camera car study. Final report.

Federal Highway Administration, Office of Safety and Traffic Operations Research and Development, McLean, Va.