In forest planning, an understanding of the spatial relationships between compartments has become an increasingly important issue. Effective approaches must, therefore, be developed that include consideration of spati...
详细信息
In forest planning, an understanding of the spatial relationships between compartments has become an increasingly important issue. Effective approaches must, therefore, be developed that include consideration of spatial relationships in planning models. Existing approaches, based on numerical optimization, tend to lack the means effectively to include spatial considerations. Further, many suggested approaches have focused on ways to include adjacency constraints or green-up constraints in forest planning. However, in order to maintain the biodiversity in the forest, methods dealing with, for instance, the problem of fragmentation of old forests, also have to be developed. In this paper, the issue of fragmentation is addressed and incorporated into long-term forest planning. The approach is to attempt to minimize the outer perimeter of areas of old forest. The model presented is formulated on the basis of mixed integer programming, and solved with a branch and bound algorithm. A data set consisting of 924 stands was used to examine the model, which was then evaluated with different requirements for the degree of clustering. The results indicate that the model is effective for the clustering of old forest stands and that it can be solved within a reasonable time despite the large number of constraints and variables. In the case study the loss in net present value as a result of including the issue of fragmentation was a few percent. (c) 2007 Elsevier B.V. All rights reserved.
The French waterway system consists of large navigable rivers and canals connecting many regions. Maintaining a safe navigation channel, in the Nord-Pas De Calais (NPDC) region in France, requires the regular removal ...
详细信息
The French waterway system consists of large navigable rivers and canals connecting many regions. Maintaining a safe navigation channel, in the Nord-Pas De Calais (NPDC) region in France, requires the regular removal of accumulated sediments which are often contaminated with zinc, lead, cadmium, and mercury. New legislations, such as the European Water Framework Directive (DCA, 2000), ensure that disposal should be reduced to minimal level and the waterways sediment should be treated. Such measures increase the research interest to find the potential costumers and create the need for establishing an efficient waterway sediment network. This paper discusses the design of a multi-modal supply chain network (SCN) in order to satisfy the demand of the treated sediments and to respect environmental, social and economic requirements. First, we reviewed models for strategic supply chain network design. After that, we proposed a multi-modal, single period, supply chain network design (SCND) model for waterway sediments problem using a mixedinteger linear programming (MILP) approach. Then, results obtained solving a real case SCND model of French waterways (Voies Navigables de France: VNF) in NPDC region are presented. Finally, we present the most important results and future research opportunities.
Virtual network (VN) embedding is a major challenge in network virtualization. In this paper, we aim to increase the acceptance ratio of VNs and the revenue of infrastructure providers by optimizing VN embedding costs...
详细信息
Virtual network (VN) embedding is a major challenge in network virtualization. In this paper, we aim to increase the acceptance ratio of VNs and the revenue of infrastructure providers by optimizing VN embedding costs. We first establish two models for VN embedding: an integer linear programming model for a substrate network that does not support path splitting and a mixed integer programming model when path splitting is supported. Then we propose a unified enhanced particle swarm optimization-based VN embedding algorithm, called VNE-UEPSO, to solve these two models irrespective of the support for path splitting. In VNE-UEPSO, the parameters and operations of the particles are well redefined according to the VN embedding context. To reduce the time complexity of the link mapping stage, we use shortest path algorithm for link mapping when path splitting is unsupported and propose greedy k-shortest paths algorithm for the other case. Furthermore, a large to large and small to small preferred node mapping strategy is proposed to achieve better convergence and load balance of the substrate network. The simulation results show that our algorithm significantly outperforms previous approaches in terms of the VN acceptance ratio and long-term average revenue. Copyright (c) 2012 John Wiley & Sons, Ltd.
This paper presents a novel operational scheme for enhanced utilization of late-life shale multi-well systems. These systems are characterized by a large number of geographically spread wells and pads, where a substan...
详细信息
This paper presents a novel operational scheme for enhanced utilization of late-life shale multi-well systems. These systems are characterized by a large number of geographically spread wells and pads, where a substantial number of the wells are producing at low erratic rates due to reservoir pressure depletion and well liquid loading. By applying a cyclic shut-in and production strategy, the scheme avoids well liquid loading and optimizes the production from a set of late-life wells at a shared production pad. The scheduling of well shut-ins is formulated as a generalized disjunctive program (GDP), using a novel shale-gas well and reservoir proxy model. The GDP formulation lends itself both to a complete MILP reformulation and reduced size MINLP reformulations;a computational study indicates in favor of the MILP formulation. We include numerical examples to demonstrate the potential benefit of applying the proposed cyclic scheme compared to a non-optimized approach. (C) 2013 Elsevier Ltd. All rights reserved.
Data correspondence/grouping under an unknown parametric model is a fundamental topic in computer vision. Finding feature correspondences between two images is probably the most popular application of this research fi...
详细信息
Data correspondence/grouping under an unknown parametric model is a fundamental topic in computer vision. Finding feature correspondences between two images is probably the most popular application of this research field, and is the main motivation of our work. It is a key ingredient for a wide range of vision tasks, including three-dimensional reconstruction and object recognition. Existing feature correspondence methods are based on either local appearance similarity or global geometric consistency or a combination of both in some heuristic manner. None of these methods is fully satisfactory, especially in the presence of repetitive image textures or mismatches. In this paper, we present a new algorithm that combines the benefits of both appearance-based and geometry-based methods and mathematically guarantees a global optimization. Our algorithm accepts the two sets of features extracted from two images as input, and outputs the feature correspondences with the largest number of inliers, which verify both the appearance similarity and geometric constraints. Specifically, we formulate the problem as a mixedinteger program and solve it efficiently by a series of linear programs via a branch-and-bound procedure. We subsequently generalize our framework in the context of data correspondence/grouping under an unknown parametric model and show it can be applied to certain classes of computer vision problems. Our algorithm has been validated successfully on synthesized data and challenging real images.
This paper presents a novel and computational deadlock prevention policy for a class of generalized Petri nets, namely G-systems, which allows multiple resource acquisitions and flexible routings with machining, assem...
详细信息
This paper presents a novel and computational deadlock prevention policy for a class of generalized Petri nets, namely G-systems, which allows multiple resource acquisitions and flexible routings with machining, assembly and disassembly operations. In this research, a mixed integer programming (MIP)-based deadlock detection technique is used to find an insufficiently marked minimal siphon from a maximal deadly marked siphon for generalized Petri nets. In addition, two-stage control method is employed for deadlock prevention in Petri net model. Such proposed method is an iterative approach consisting of two stages. The first one is called siphons control, which adds a control place to the original net for each insufficiently marked minimal siphon. The objective is to prevent minimal siphons from being insufficiently marked. The second one, called control-induced siphons control, is to add a control place to the augmented net with its output arcs connecting to source transitions, which assures that there is no new insufficiently marked siphon generated due to the addition of the monitors. Compared with the existing approaches, the proposed deadlock prevention policy can usually lead to a non-blocking supervisor with more permissive behavior and high computational efficiency for a sizeable plant model due to avoiding complete siphon enumeration. Finally, a practical flexible manufacturing system (FMS) example is utilized to illustrate the proposed method.
Corrective transmission switching schemes are an essential part of grid operations and are used to improve the reliability of the grid as well as the operational efficiency. Today, the transmission switching schemes a...
详细信息
Corrective transmission switching schemes are an essential part of grid operations and are used to improve the reliability of the grid as well as the operational efficiency. Today, the transmission switching schemes are established based on the operator's past knowledge of the system as well as other ad-hoc methods. In this paper, three topology control (corrective transmission switching) methodologies are presented along with the detailed formulation of robust corrective switching. By incorporating robust optimization into the corrective switching framework, the switching solution is guaranteed to be feasible for a range of system operating states. The robust model can be solved offline to suggest switching actions that can be used in a dynamic security assessment tool in real-time. The proposed robust topology control algorithm can also generate multiple corrective switching actions for a particular contingency. The robust topology control formulation is tested on an IEEE 118-bus test case with different uncertainty sets.
In this paper we present a framework to tackle mixed integer programming problems based upon a "constrained" black box approach. Given a MIP formulation, a black-box solver, and a set of incumbent solutions,...
详细信息
In this paper we present a framework to tackle mixed integer programming problems based upon a "constrained" black box approach. Given a MIP formulation, a black-box solver, and a set of incumbent solutions, we iteratively build corridors around such solutions by adding exogenous constraints to the original MIP formulation. Such corridors, or neighborhoods, are then explored, possibly to optimality, with a standard MIP solver. An iterative approach in the spirit of a hill climbing scheme is thus used to explore subportions of the solution space. While the exploration of the corridor relies on a standard MIP solver, the way in which such corridors are built around the incumbent solutions is influenced by a set of factors, such as the distance metric adopted, or the type of method used to explore the neighborhood. The proposed framework has been tested on a challenging variation of the lot sizing problem, the multi-level lot sizing problem with setups and carryovers. When tested on 1920 benchmark instances of such problem, the algorithm was able to solve to near optimality every instance of the benchmark library and, on the most challenging instances, was able to find high quality solutions very early in the search process. The algorithm was effective, in terms of solution quality as well as computational time, when compared with a commercial MIP solver and the best algorithm from the literature.
mixedinteger optimization is a powerful tool for modeling many optimization problems arising from real-world applications. Finding a first feasible solution represents the first step for several mixedinteger program...
详细信息
mixedinteger optimization is a powerful tool for modeling many optimization problems arising from real-world applications. Finding a first feasible solution represents the first step for several mixed integer programming (MIP) solvers. The feasibility pump is a heuristic for finding feasible solutions to mixedinteger linear programming (MILP) problems which is effective even when dealing with hard MIP instances. In this work, we start by interpreting the feasibility pump as a Frank-Wolfe method applied to a nonsmooth concave merit function. Then we define a general class of functions that can be included in the feasibility pump scheme for measuring solution integrality, and we identify some merit functions belonging to this class. We further extend our approach by dynamically combining two different merit functions. Finally, we define a new version of the feasibility pump algorithm, which includes the original version of the feasibility pump as a special case, and we present computational results on binary MILP problems showing the effectiveness of our approach.
Combined heat and power (CHP), distributed generation (DG) technologies have the potential to provide economic savings to commercial building owners in certain markets, if the system is appropriately configured, sized...
详细信息
Combined heat and power (CHP), distributed generation (DG) technologies have the potential to provide economic savings to commercial building owners in certain markets, if the system is appropriately configured, sized, and operated. Numerous optimization models exist for determining the design and dispatch of a DG system, and some require a great deal of time and computing power to determine building-market scenarios for which the optimal solution includes the acquisition of CHP technologies. Thus, it is beneficial to identify which scenarios are likely to be economically viable prior to solving an optimization model that determines the lowest-cost system design and dispatch. Accordingly, we derive conditions for the economic viability of a CHP DG technology by comparing the total operational savings afforded by the technology to its total installed cost. We demonstrate these conditions numerically in eight distinct scenarios that include the installation of a fuel cell-based CHP system for various building types and energy markets. Using these scenarios, we examine the energy, emissions, operations and maintenance, and peak demand savings provided by the DG system, and determine which scenarios are likely to result in total savings that exceed the total installed cost. Results indicate that the combination of building type, energy market, and system design and dispatch in a given scenario have a significant impact on the economic viability of the CHP system. (C) 2013 Elsevier Ltd. All rights reserved.
暂无评论