Mechanism Design Vohra, Rakesh V.
05/2011, Letnik:
v.Series Number 47
eBook
Mechanism design is an analytical framework for thinking clearly and carefully about what exactly a given institution can achieve when the information necessary to make decisions is dispersed and ...privately held. This analysis provides an account of the underlying mathematics of mechanism design based on linear programming. Three advantages characterize the approach. The first is simplicity: arguments based on linear programming are both elementary and transparent. The second is unity: the machinery of linear programming provides a way to unify results from disparate areas of mechanism design. The third is reach: the technique offers the ability to solve problems that appear to be beyond solutions offered by traditional methods. No claim is made that the approach advocated should supplant traditional mathematical machinery. Rather, the approach represents an addition to the tools of the economic theorist who proposes to understand economic phenomena through the lens of mechanism design.
In today's competitive environment, it is essential to design a flexible-responsive manufacturing system with automatic material handling systems. In this article, a fuzzy mixed integer linear ...programming model is designed for cell formation problems including the scheduling of parts within cells in a cellular manufacturing system (CMS) where several automated guided vehicles (AGVs) are in charge of transferring the exceptional parts. Notably, using these AGVs in CMS can be challenging from the perspective of mathematical modeling due to consideration of AGVs' collision as well as parts pickup/delivery. This article investigates the role of AGVs and human factors as indispensable components of automation systems in the cell formation and scheduling of parts under fuzzy processing time. The proposed objective function includes minimizing the makespan and intercellular movements of parts. Due to the NP-hardness of the problem, a hybrid genetic algorithm (GA/heuristic) and a whale optimization algorithm (WOA) are developed. The experimental results reveal that our proposed algorithms have a high performance compared to CPLEX and the other two well-known algorithms, i.e., particle swarm optimization and ant colony optimization, in terms of computational efficiency and accuracy. Finally, WOA stands out as the best algorithm to solve the problem.
This paper proposes an optimal bidding strategy in the day-ahead market of a microgrid consisting of intermittent distributed generation (DG), storage, dispatchable DG, and price responsive loads. ...The microgrid coordinates the energy consumption or production of its components, and trades electricity in both day-ahead and real-time markets to minimize its operating cost as a single entity. The bidding problem is challenging due to a variety of uncertainties, including power output of intermittent DG, load variation, and day-ahead and real-time market prices. A hybrid stochastic/robust optimization model is proposed to minimize the expected net cost, i.e., expected total cost of operation minus total benefit of demand. This formulation can be solved by mixed-integer linear programming. The uncertain output of intermittent DG and day-ahead market price are modeled via scenarios based on forecast results, while a robust optimization is proposed to limit the unbalanced power in real-time market taking account of the uncertainty of real-time market price. Numerical simulations on a microgrid consisting of a wind turbine, a photovoltaic panel, a fuel cell, a micro-turbine, a diesel generator, a battery, and a responsive load show the advantage of stochastic optimization, as well as robust optimization.
The penetration of distributed energy resources (DER), including distributed generators, storage devices, and demand response (DR) is growing worldwide, encouraged by environmental policies and ...decreasing costs. To enable DER local integration, new energy players as aggregators appeared in the electricity markets. This player, acting toward the grid as one entity, can offer new services to the electricity market and the system operator by aggregating flexible DER involving both DR and generation resources. In this paper, an optimization model is provided for participation of a DER aggregator in the day-ahead market in the presence of demand flexibility. This player behaves as an energy aggregator, which manages energy and financial interactions between the market and DER organized in local energy systems (LES), which are in charge to satisfy the multienergy demand of a set of building clusters with flexible demand. A stochastic mixed-integer linear programming problem is formulated by considering uncertainties of intermittent DER facilities and day-ahead market price, to find the optimal bidding strategies while maximizing the expected aggregator's profit. Numerical results show that the method is efficient in finding the bidding curves in the day-ahead market through the optimal management of flexibility requests sent to clusters, as well as of DER in LES and interactions among LES.
Unbalanced operation of a three-phase distribution system could incur more power losses, compared with the balanced operation. So far, the phase information of users in low voltage areas is not ...recorded by power utilities and the three-phase unbalance degree is very significant in some low voltage distribution systems. Given this background, this letter presents an integrated method for solving related issues including user phase identification based on spectral clustering and three-phase unbalance mitigation, and a Mixed Integer Linear Programming (MILP) model is then formulated. Some actual cases in Zhejiang province, China, are utilized to verify the effectiveness of the presented phase identification algorithm, and simulation results show that the three-phase unbalance can be significantly mitigated.
This article explores how to solve multipurpose problems to obtain optimal solutions using fuzzy linear programming. Our goal is to minimize production and transportation costs by using the most ...basic transportation methods and comparing the results to conventional methods. We discuss the results of numerical examples and illustrate this method.
Kalman filter, particle filter, IMM, PDA, ITS, random sets... The number of useful object-tracking methods is exploding. But how are they related? How do they help track everything from aircraft, ...missiles and extra-terrestrial objects to people and lymphocyte cells? How can they be adapted to novel applications? Fundamentals of Object Tracking tells you how. Starting with the generic object-tracking problem, it outlines the generic Bayesian solution. It then shows systematically how to formulate the major tracking problems – maneuvering, multiobject, clutter, out-of-sequence sensors – within this Bayesian framework and how to derive the standard tracking solutions. This structured approach makes very complex object-tracking algorithms accessible to the growing number of users working on real-world tracking problems and supports them in designing their own tracking filters under their unique application constraints. The book concludes with a chapter on issues critical to successful implementation of tracking algorithms, such as track initialization and merging.
Successful transition to active distribution networks (ADNs) requires a planning methodology that includes an accurate network model and accounts for the major sources of uncertainty. Considering ...these two essential features, this paper proposes a novel model for the multistage distribution expansion planning (MDEP) problem, which is able to jointly expand both the network assets (feeders and substations) and renewable/conventional distributed generators. With respect to network characteristics, the proposed planning model employs a convex conic quadratic format of ac power flow equations that is linearized using a highly accurate polyhedral-based linearization method. Furthermore, a chance-constrained programming approach is utilized to deal with the uncertain renewables and loads. In this regard, as the probability distribution functions of uncertain parameters are not perfectly known, a distributionally robust (DR) reformulation is proposed for the chance constraints that guarantees the robustness of the expansion plans against all uncertainty distributions defined within a moment-based ambiguity set. Effective linearization techniques are also devised to eliminate the nonlinearities of the proposed DR reformulation, which yields a distributionally robust chance-constrained mixed-integer linear programming model for the MDEP problem of ADNs. Finally, the 24-node and 138-node test systems are used to demonstrate the effectiveness of the proposed planning methodology.
As the rapid development of natural-gas fired units (NGUs), power systems begin to rely more on a natural gas system to supply the primary fuel. On the other hand, natural gas system contingency ...might cause the nonavailability of NGUs and inevitably jeopardize power system security. To address this issue, this paper studies security-constrained joint expansion planning problems for this combined energy system. We develop a computationally efficient mixed-integer linear programming (MILP) approach that simultaneously considers N-1 contingency in both natural gas system and electricity power system. To reduce the combinatorial search space of MILP models, an extension of a reduced disjunctive model is proposed to decrease the numbers of binary and continuous variables as well as constraints. The involving nonlinear terms in N-1 constraints are exactly linearized without sacrificing any optimality. Numerical results on two typical integrated energy systems demonstrate the necessity of extending N-1 criterion to the whole network of a combined energy system. Experimental results also show that compared with the conventional approach, our proposed MILP approach achieves a great computational performance improvement in solving security-constrained co-optimization expansion planning problems.
PDF
