A fuzzy approach for the network congestion problem

In the recent years, the unpredictable growth of the Internet has moreover pointed out the congestion problem, one of the problems that historicallyha ve affected the network. This paper deals with the design and the evaluation of a congestion control algorithm which adopts a FuzzyCon troller. The analogyb etween Proportional Integral (PI) regulators and Fuzzycon trollers is discussed and a method to determine the scaling factors of the Fuzzycon troller is presented. It is shown that the Fuzzycon troller outperforms the PI under traffic conditions which are different from those related to the operating point considered in the design.

The Commons and anti-commons problems in the tourism economy

Countries specialised in tourism tend to face two problems with contradictory effects: the commons and the anti-commons, which lead to tourism over- and under-production, respectively. This paper develops a two-period model to analyse the joint effects of both problems on a small and remote tourism economy. Congestion and the complementariness between foreign transport and local tourism services are key features in this type of markets. As a result, direct selling and the presence of foreign tour-operators emerge as possible market arrangements with different implications in terms of welfare and public intervention. Four main results are obtained. First, in the direct selling situation the optimal policy depends on the relative importance of the problems. Second, the existence of tour-operators always leads to tourism over-production. Third, the presence of a single tour-operator does not solve the congestion problem. Lastly, the switch from several tour-operators to a single one is welfare reducing.

Modelo AC para el despacho combinado de contratos bilaterales y bolsa de energía considerando restricciones de seguridad

Reliability is a key aspect in power system design and planning. Maintaining a reliable power system is a very important issue for their design and operation. Under the new competitive framework of the electricity sector, power systems find ever more and more strained to operate near their limits. Under this new scenario, it is crucial for the system operator to use tools that facilitate an energy dispatch that minimizes possible power cuts. This paper presents a mathematical model to calculate an energy dispatch that considers security constraints (single contingencies in transmission lines and transformers). The model involves pool markets and fixed bilateral contracts. Traditional methodologies that include security constraints are usually based in multistage dispatch processes. In this case, we propose a single-stage model that avoids the economic inefficiencies which result when conventional multi-stage dispatch approaches are applied. The proposed model includes an AC representation of the transport system and allows calculating the cost overruns incurred in due to reliability restrictions. We found that complying with fixed bilateral contracts, when they go above certain levels, might lead to congestion problems in transmission lines.

Congestión vehicular en Medellín: una posible solución desde la Economía

Según la teoría económica el mecanismo de precios es una herramienta adecuada para solucionar el problema de congestión vehicular. El objetivo de este artículo es diagnosticar el grado de congestión vehicular de la ciudad de Medellín (Colombia) y proponer alternativas que den solución a dicho problema desde la óptica de la teoría económica. A diferencia de otros estudios, esta investigación analizó la relación entre el gasto de las familias en transporte y la elección de transporte (público o privado) a través la metodología de elasticidades. Se encontró evidencia a favor de la hipótesis de los precios como mecanismos para desincentivar el uso del automóvil privado, pues a medida que aumenta el nivel de gasto en transporte (asociado a un supuesto peaje urbano), la probabilidad de usar transporte privado disminuye, mientras que la probabilidad de utilizar transporte público aumenta.

Traffic congestion: the problem and how to tackle it

As the culmination of a project financed by the Technical Cooperation Agency of the Federal Republic of Germany (GTZ), ECLAC has just published Congestión de tránsito - El problema y cómo enfrentarlo, Cuadernos de la Cepal series, No. 87. The text of 194 pages analyses the negative impacts of congestion and the multidisciplinary efforts that are needed to keep it under control, through the design of appropriate policies and measures. Congestion control is part of the development of a strategic vision of how a city should develop which can make it possible to harmonize the needs of mobility, growth and competitiveness, which are so necessary today and in the future, with the sustainability of cities and the improvement of their quality of life.The task is complex and it is not easy to find appropriate solutions. The present publication presents tools for tackling this crucial problem. Everything indicates that it calls for high professional and leadership qualities on the part of the authorities, and that it must have the active support of the citizens.This edition of the Bulletin presents a summary of the main conclusions of the publication and it is stressed that ECLAC can conduct local workshops to analyze the problem and how to tackle it.

Traffic congestion: the problem and how to deal with it

The text of 194 pages analyses the negative impacts of congestion and the multidisciplinary efforts that are needed to keep it under control, through the design of appropriate policies and measures. Congestion control is part of the development of a strategic vision of how a city should develop which can make it possible to harmonize the needs of mobility, growth and competitiveness, which are so necessary today and in the future, with the sustainability of cities and the improvement of their quality of life.The task is complex and it is not easy to find appropriate solutions. The present publication presents tools for tackling this crucial problem. Everything indicates that it calls for high professional and leadership qualities on the part of the authorities, and that it must have the active support of the citizens.This edition of the Bulletin presents a summary of the main conclusions of the publication and it is stressed that ECLAC can conduct local workshops to analyze the problem and how to tackle it.

Optimal information transmission in organizations: Search and congestion

We propose a stylized model of a problem-solving organization whoseinternal communication structure is given by a fixed network. Problemsarrive randomly anywhere in this network and must find their way to theirrespective specialized solvers by relying on local information alone.The organization handles multiple problems simultaneously. For this reason,the process may be subject to congestion. We provide a characterization ofthe threshold of collapse of the network and of the stock of foatingproblems (or average delay) that prevails below that threshold. We buildupon this characterization to address a design problem: the determinationof what kind of network architecture optimizes performance for any givenproblem arrival rate. We conclude that, for low arrival rates, the optimalnetwork is very polarized (i.e. star-like or centralized ), whereas it islargely homogenous (or decentralized ) for high arrival rates. We also showthat, if an auxiliary assumption holds, the transition between these twoopposite structures is sharp and they are the only ones to ever qualify asoptimal.

Optimal network topologies for local search with congestion

The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.

Congestion probability routing in virtual path ATM network

This dissertation focuses on the problem of providing mechanisms for routing point to point and multipoint connections in ATM networks. In general the notion of multipoint connection refers to connections that involve a group of users with more than two members. The main objective of this dissertation is to contribute to design efficient routing protocols with alterative routes in fully connected VP-based ATM Networks for call establishment of point to point and multipoint VC connections. An efficient route should be computed during this connection establishment phase.

Measures for controlling traffic congestion

Traffic congestion has become a severe scourge in large cities, in both the industrialized and developing countries. Increasing demand for urban transport and transit has led to longer travel times, and a greater incidence of accidents, environmental problems and deterioration in the quality of life than is considered acceptable for citizens. A multidisciplinary approach is required in order to keep the negative effects of congestion under control and to ensure standards of living remain sustainable. In view of the seriousness of the problem, ECLAC with the support of the German Agency for Technical Cooperation (GTZ) is carrying out a project to study measures that contribute to traffic control. As part of this project, initiatives regarding the supply of, and the demand for, transport have been examined, and a programme to disseminate information is being conducted.For further information, please contact Mr Alberto Bull .

Alternatives for controlling urban traffic congestion

Traffic congestion is nothing new in Latin American cities but has worsened in recent years. Eliminating it is a pipedream, but it should be brought under control. Many economists and transport planners think electronic road pricing would be the best way of tackling it, now that the appropriate technology for implementing it is available. On the other hand, experience shows that, for political reasons, it would be better to begin by adopting simpler methods. To start with, simple road pricing would seem to be the best option. But, over 20 years of experience in London and more than six in Santiago, Chile, made it clear that socio-political barriers have to be surmounted before even this option can be applied in practice. There is more political support for measures to control parking, due in part to the fact that the legal powers do not normally extend to restricting the number of parking spaces available to high-income and influential motorists who have the right to park near their offices and who cause a great deal of the congestion whilst getting there. In Latin America, the relative importance of taxis also diminishes the effectiveness of measures geared to parking, since taxis contribute to congestion although but they do not park. The problem of congestion cannot be solved by using tame measures. The time has come for something bolder, i.e., measures that, at the very least, exercise control over those parking spaces, which so far have been beyond the reach of governments and local authorities, ideally, simple road pricing systems would be even more effective.

Mitigating congestion by integrating time forecasting and realtime information aggregation in cellular networks

An iterative travel time forecasting scheme, named the Advanced Multilane Prediction based Real-time Fastest Path (AMPRFP) algorithm, is presented in this dissertation. This scheme is derived from the conventional kernel estimator based prediction model by the association of real-time nonlinear impacts that caused by neighboring arcs’ traffic patterns with the historical traffic behaviors. The AMPRFP algorithm is evaluated by prediction of the travel time of congested arcs in the urban area of Jacksonville City. Experiment results illustrate that the proposed scheme is able to significantly reduce both the relative mean error (RME) and the root-mean-squared error (RMSE) of the predicted travel time. To obtain high quality real-time traffic information, which is essential to the performance of the AMPRFP algorithm, a data clean scheme enhanced empirical learning (DCSEEL) algorithm is also introduced. This novel method investigates the correlation between distance and direction in the geometrical map, which is not considered in existing fingerprint localization methods. Specifically, empirical learning methods are applied to minimize the error that exists in the estimated distance. A direction filter is developed to clean joints that have negative influence to the localization accuracy. Synthetic experiments in urban, suburban and rural environments are designed to evaluate the performance of DCSEEL algorithm in determining the cellular probe’s position. The results show that the cellular probe’s localization accuracy can be notably improved by the DCSEEL algorithm. Additionally, a new fast correlation technique for overcoming the time efficiency problem of the existing correlation algorithm based floating car data (FCD) technique is developed. The matching process is transformed into a 1-dimensional (1-D) curve matching problem and the Fast Normalized Cross-Correlation (FNCC) algorithm is introduced to supersede the Pearson product Moment Correlation Co-efficient (PMCC) algorithm in order to achieve the real-time requirement of the FCD method. The fast correlation technique shows a significant improvement in reducing the computational cost without affecting the accuracy of the matching process.

Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.

Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.

Ecological Literacy And Beyond: Problem-based Learning For Future Professionals.

Ecological science contributes to solving a broad range of environmental problems. However, lack of ecological literacy in practice often limits application of this knowledge. In this paper, we highlight a critical but often overlooked demand on ecological literacy: to enable professionals of various careers to apply scientific knowledge when faced with environmental problems. Current university courses on ecology often fail to persuade students that ecological science provides important tools for environmental problem solving. We propose problem-based learning to improve the understanding of ecological science and its usefulness for real-world environmental issues that professionals in careers as diverse as engineering, public health, architecture, social sciences, or management will address. Courses should set clear learning objectives for cognitive skills they expect students to acquire. Thus, professionals in different fields will be enabled to improve environmental decision-making processes and to participate effectively in multidisciplinary work groups charged with tackling environmental issues.

A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over

This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.