It is technologically possible for a biorefinery to use a variety of biomass as feedstock including native perennial grasses (e.g., switchgrass) and agricultural residues (e.g., corn stalk and wheat straw). Incorporat...
详细信息
It is technologically possible for a biorefinery to use a variety of biomass as feedstock including native perennial grasses (e.g., switchgrass) and agricultural residues (e.g., corn stalk and wheat straw). Incorporating the distinct characteristics of various types of biomass feedstocks and taking into account their interaction in supplying the bioenergy production, this paper proposed a multi-commodity network flow model to design the logistics system for a multiple-feedstock biomass-to-bioenergy industry. The model was formulated as a mixed integer linear programming, determining the locations of warehouses, the size of harvesting team, the types and amounts of biomass harvested/purchased, stored, and processed in each month, the transportation of biomass in the system, and so on. This paper demonstrated the advantages of using multiple types of biomass feedstocks by comparing with the case of using a single feedstock (switchgrass) and analyzed the relationship of the supply capacity of biomass feedstocks to the output and cost of biofuel. (C) 2011 Elsevier Ltd. All rights reserved.
As multicast applications become more and more popular, implementing multicast in the optical domain has attracted increased attention due to its more efficient bandwidth usage. And also these services have quality-of...
详细信息
As multicast applications become more and more popular, implementing multicast in the optical domain has attracted increased attention due to its more efficient bandwidth usage. And also these services have quality-of-service requirements. In this article, the problem of cost-effective optical multicast provisioning to satisfy the differentiated leaf availability requirements is formally stated. A mixedintegerlinear Program formulation is proposed for provisioning dedicated light-tree protection with differentiated leaf availability guarantee. The algorithm is so complex and infeasible that we also propose a feasible two-step approximate approach to solve the problem. Different from the previous schemes, our scheme finds out the primary light-trees and backup paths for destination nodes whose availability is not satisfied. Because of taking the different leaf availability requirements into account, the proposed algorithm obtains a more efficient feasible solution requiring less network resources.
Optimization of air traffic flow in the National Airspace System is, by nature, a large-scale problem, the solving of which usually requires intensive computation. This paper presents a mixedintegerlinear programmin...
详细信息
Optimization of air traffic flow in the National Airspace System is, by nature, a large-scale problem, the solving of which usually requires intensive computation. This paper presents a mixed integer linear programming method to solve a nationwide air traffic flow management problem based on an aggregate air traffic model. A dual decomposition method is applied to solve the large-scale traffic management problem, where the nationwide problem is decomposed path by path into 1000s of subproblems that are solved independently. It is shown in this paper that the solution with the dual decomposition method converges to the global optimum. The major contribution of the proposed modeling and optimization framework is that it is about 6 times faster than a previously developed large-capacity cell transmission model. It is also shown that the proposed optimization method obtains an equally optimal solution as the large-capacity cell transmission model. In the meantime, the proposed model is capable of including both ground delay and airborne delay, while the large-capacity cell transmission model includes airborne delay only. The traffic forecasting capability of the new model is also examined statistically at the sector level and the national level. It is shown that the sector counts are predicted with relative errors of less than 20% for over 80% of the high-altitude sectors in the United States. Further analysis also suggests that the accuracy of the proposed model is comparable with the other two aggregate models in the literature.
Recently introduced colonial competitive algorithm (CCA) has shown its excellent capability on different optimization problems. The aim of this paper is to propose a discrete version of this method to determine a sche...
详细信息
Recently introduced colonial competitive algorithm (CCA) has shown its excellent capability on different optimization problems. The aim of this paper is to propose a discrete version of this method to determine a schedule that minimizes sum of the linear earliness and quadratic tardiness in the hybrid flowshops scheduling problem with simultaneously considering effects of sequence-dependent setup times and limited waiting time. In other word we assume that the waiting time for each job between two consecutive stages cannot be greater than a given upper bound. Also for this problem, a mixedinteger program is formulated. Computational results are presented to evaluate the performance of the proposed algorithms for problems with different structures. (C) 2011 Elsevier Ltd. All rights reserved.
Cement manufacturing requires sustained supply of raw materials from limestone quarry. Raw materials inventory in limestone quarry is identified as a block model, usually, consisting of thousands of blocks. Each block...
详细信息
Cement manufacturing requires sustained supply of raw materials from limestone quarry. Raw materials inventory in limestone quarry is identified as a block model, usually, consisting of thousands of blocks. Each block consists of a distinct amount of chemical constituents which are vital for cement production. An individual block never satisfies the process quality constraints;therefore, the blending of various quarry blocks with expensive additives purchased from the market becomes a prerequisite. The objective of a quarry production scheduling model is to mine available blocks in a sequence such that cement plant quantity and quality requirements are satisfied. Achieving a solution to the problem, where each block is defined as an integer (0-1) variable, often within reasonable time, has been a challenge for the mining industry. In this article, the complex production scheduling problem is divided into two sub-problems, where quarry sequencing algorithm develops feasible quarry plans and mixed integer linear programming based blending formulation minimises cost by selecting a plan that requires least amount of additives from the market. The implementation of methodology on an existing operation ensures time as well as cost savings compared to the schedules produced manually.
The shortening of patent life periods, generic competition and public health policies, among other factors, have changed the operating context of the pharmaceutical industry. In this work we address a dynamic allocati...
详细信息
The shortening of patent life periods, generic competition and public health policies, among other factors, have changed the operating context of the pharmaceutical industry. In this work we address a dynamic allocation/planning problem that optimises the global supply chain planning of a pharmaceutical company, from production stages at primary and secondary sites to product distribution to markets. The model explores different production and distribution costs and tax rates at different locations in order to maximise the company's net profit value (NPV). Large instances of the model are not solvable in realistic time scales, so two decomposition algorithms were developed. In the first method, the supply chain is decomposed into independent primary and secondary subproblems, and each of them is optimised separately. The second algorithm is a temporal decomposition, where the main problem is separated into several independent subproblems, one per each time period. These algorithms enable the solution of large instances of the problem in reasonable time with good quality results. (C) 2011 Published by Elsevier B.V. on behalf of The Institution of Chemical Engineers.
Accurate and reliable control of planetary entry is a major challenge for planetary exploration vehicles. For Mars entry, uncertainties in atmospheric properties such as winds aloft and density pose a major problem fo...
详细信息
Accurate and reliable control of planetary entry is a major challenge for planetary exploration vehicles. For Mars entry, uncertainties in atmospheric properties such as winds aloft and density pose a major problem for meeting precision landing requirements. Anticipated manned missions to Mars will also require levels of safety and fault tolerance not required during earlier robotic missions. This paper develops a nonlinear fault-tolerant controller specifically tailored for addressing the unique environmental and mission demands of future Mars entry vehicles. The controller tracks a desired trajectory from entry interface to parachute deployment, and has an adaptation mechanism that reduces tracking errors in the presence of uncertain parameters such as atmospheric density, and vehicle properties such as aerodynamic coefficients and inertias. This nonlinear control law generates the commanded moments for a discrete control allocation algorithm, which then generates the optimal controls required to follow the desired trajectory. The reaction control system acts as a non-uniform quantizer, which generates applied moments that approximate the desired moments generated by a continuous adaptive control law. If a fault is detected in the control jets, it reconfigures the controls and minimizes the impact of control failures or damage on trajectory tracking. It is assumed that a fault identification and isolation scheme already exists to identify failures. A stability analysis is presented, and fault tolerance performance is evaluated with non real-time simulation for a complete Mars entry trajectory tracking scenario using various scenarios of control effector failures. The results presented in the paper demonstrate that the control algorithm has a satisfactory performance for tracking a pre-defined trajectory in the presence of control failures, in addition to plant and environment uncertainties. Copyright (C) 2010 John Wiley & Sons, Ltd.
The Multi-Period Multi-Product (MPMP) production planning, as a well known problem in literature, attempts to match production rates of individual products with fluctuated market demand over planning horizon. This stu...
详细信息
The Multi-Period Multi-Product (MPMP) production planning, as a well known problem in literature, attempts to match production rates of individual products with fluctuated market demand over planning horizon. This study, demonstrates how the conventional MPMP linearprogramming (LP) model may fail to utilize available capacity of machines, and also a novel Multi Objective linearprogramming (MOLP) model is developed to simultaneously minimize net present value of production costs and maximize machine utilization. The proposed model consists of production constraints such as available labor, inventory, maximum subcontracting levels and also forecasted demands. The proposed MOLP model is further converted to a Fuzzy Multi Objective linearprogramming (FMOLP) model utilizing piecewise linear membership functions. The model, accommodates the Decision Maker (DM) with a more systematic decision making approach enabling the DM to adjust the search direction during the solving procedure to achieve the most satisfactory result.
Changes in complex industrial energy systems require adequate tools to be evaluated satisfactorily. The MIND method (Method for analysis of INDustrial energy systems) is a flexible method constructed as decision suppo...
详细信息
Changes in complex industrial energy systems require adequate tools to be evaluated satisfactorily. The MIND method (Method for analysis of INDustrial energy systems) is a flexible method constructed as decision support for different types of analyses of industrial energy systems. It is based on mixed integer linear programming (MILP) and developed at Linkoping University in Sweden. Several industries, ranging from the food industry to the pulp and paper industry, have hitherto been modelled and analyzed using the MIND method. In this paper the principles regarding the use of the method and the creation of constraints of the modelled system are presented. Two case studies are also included, a dairy and a pulp and paper mill, that focus some measures that can be evaluated using the MIND method, e.g. load shaping, fuel conversion and introduction of energy efficiency measures. The case studies illustrate the use of the method and its strengths and weaknesses. The results from the case studies are related to the main issues stated by the European Commission, such as reduction of greenhouse gas emissions, improvements regarding security of supply and increased use of renewable energy, and show great potential as regards both cost reductions and possible load shifting. (C) 2010 Elsevier Ltd. All rights reserved.
The underlying time framework used is one of the major differences in the basic structure of mathematical programming formulations used for production scheduling problems. The models are either based on continuous or ...
详细信息
The underlying time framework used is one of the major differences in the basic structure of mathematical programming formulations used for production scheduling problems. The models are either based on continuous or discrete time representations. In the literature there is no general agreement on which is better or more suitable for different types of production or business environments. In this paper we study a large real-world scheduling problem from a pharmaceutical company. The problem is at least NP-hard and cannot be solved with standard solution methods. We therefore decompose the problem into two parts and compare discrete and continuous time representations for solving the individual parts. Our results show pros and cons of each model. The continuous formulation can be used to solve larger test cases and it is also more accurate for the problem under consideration. (C) 2011 Elsevier B.V. All rights reserved.
暂无评论