According to multiproduct/multipurpose batch and continuous processes scheduling, an overview of developments in the chemical processes scheduling is presented. Two scheduling methodologies based on time representatio...
详细信息
ISBN:
(纸本)9781424421138
According to multiproduct/multipurpose batch and continuous processes scheduling, an overview of developments in the chemical processes scheduling is presented. Two scheduling methodologies based on time representation are introduced: one is discrete-time approaches the other is various continuous-time approaches, and the strengths and limitations of these approaches are examined. Also, important characteristics of chemical processes challenging to the scheduling problem are discussed, further research area and possible directions in the production scheduling problem are pointed out.
In this paper, the short-term scheduling of cascaded hydroelectric chain plants with pumped-storage units is considered. Some integer variables are carefully introduced such that the original problem is successfully f...
详细信息
ISBN:
(纸本)9787900719706
In this paper, the short-term scheduling of cascaded hydroelectric chain plants with pumped-storage units is considered. Some integer variables are carefully introduced such that the original problem is successfully formulated as a mixed-integer linear programming. The model given in this paper admits of many complex characteristics such as nonlinear hydroelectric production function, minimum/maximum down/up time of hydro units, existence of pumped-units and time delay between plants, etc. CPLEX package is adopted to solve the problem. Numerical testing is also performed for a system with 3 cascaded reservoir, 12 hydro units and a pumped-storage plant with 5 pumped-units. The results suggest that the mixed-integerprogramming model given in this paper is very effective.
This paper presents a genetic algorithm (GA) based on heuristic rules for high-constrained large-size single-stage multi-product scheduling problem (SMSP) with parallel units. SMSP has been widely studied, very often ...
详细信息
This paper presents a genetic algorithm (GA) based on heuristic rules for high-constrained large-size single-stage multi-product scheduling problem (SMSP) with parallel units. SMSP has been widely studied, very often solved by using mixed-integer linear programming (MILP methods). When the problem size increases linearly, the computational time of MILP will increase exponentially. Therefore, it is very difficult for MILP to obtain acceptable solutions to the large-size problems within reasonable time. To solve the large-size scheduling problems, the preferred method in industry is the use of scheduling rules. However, due to the constraints in SMSP, the simple rule-based method may not guarantee the feasibility and quality of the solutions. In this study, random search based on heuristic rules is proposed first. Through exploring a set of random solutions, better feasible solutions are obtained. To improve the quality of solutions, GA based on heuristic rules is then proposed to evolve the random solutions. The heuristic rules play a very important role in the algorithm. However, the computational time of the GA increases dramatically due to some constraints that may create infeasibility. To overcome this, a penalty method is adopted. Through comparison of computational results of MILP, random search and GA, GA has demonstrated its effectiveness and reliability in solving the highly constrained large-size scheduling problems. (c) 2007 Elsevier B.V. All rights reserved.
This paper provides a stochastic programming approach to optimally reinforce and expand the transmission network so that the impact of deliberate attacks is mitigated. The network planner selects the new lines to be b...
详细信息
This paper provides a stochastic programming approach to optimally reinforce and expand the transmission network so that the impact of deliberate attacks is mitigated. The network planner selects the new lines to be built accounting for the vulnerability of the transmission network against a set of credible intentional outages. The vulnerability of the transmission network is measured in terms of the expected load shed. An instance of the previously reported terrorist threat problem is solved to generate the set of credible deliberate attacks. The proposed model is formulated as a mixed-integerlinear program for which efficient solvers are available. Results from a case study based on the IEEE Two Area Reliability Test System are provided and analyzed.
Two independent proofs of the polyhedrality of the split closure of mixedintegerlinear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a const...
详细信息
Two independent proofs of the polyhedrality of the split closure of mixedintegerlinear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Koppe and Weismantel. (c) 2006 Elsevier B.V. All rights reserved.
This paper presents a heuristic approach based on genetic algorithm (GA) for solving large-size multi-stage multi-product scheduling problem (MMSP) in batch plant. The proposed approach is suitable for different sched...
详细信息
This paper presents a heuristic approach based on genetic algorithm (GA) for solving large-size multi-stage multi-product scheduling problem (MMSP) in batch plant. The proposed approach is suitable for different scheduling objectives, such as total process time, total flow time, etc. In the algorithm, solutions to the problem are represented by chromosomes that will be evolved by GA. A chromosome consists of order sequences corresponding to the processing stages. These order sequences are then assigned to processing units according to assignment strategies such as forward or backward assignment, active scheduling technique or similar technique, and some heuristic rules. All these measures greatly reduce unnecessary search space and increase the search speed. In addition, a penalty method for handling the constraints in the problem, e.g., the forbidden changeovers, is adopted, which avoids the infeasibility during the GA search and further greatly increases the search speed. (c) 2006 Elsevier Ltd. All rights reserved.
Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common over-arching mission objectives which make it reasonable to expect some degree or cooperativeness on the part of their constituen...
详细信息
ISBN:
(纸本)9781424410422
Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common over-arching mission objectives which make it reasonable to expect some degree or cooperativeness on the part of their constituent nodes. In this article we demonstrate new strategies to improve MANET communications, based on inter-node cooperation with respect to node mobility. We present our model for cooperative mobility, and use this cost-benefit framework to explore the impact of cooperation in MANETs where nodes are-to varying extents-willing to be moved for the common good. We develop a mixed-integer linear programming (MILP) formulation of the model, accurately capturing its objectives and constraints. The MILP model is evaluated through simulations and found to be very effective, albeit for small networks. To make the proposed technique scale to large networks we develop a new technique for converting a large global MILP into a sequence of smaller local MILP optimizations, and demonstrate that the resulting approach is scalable and succeeds at efficiently moving cooperative nodes in a manner which optimizes connection bit error rates.
As a useful tool for combinatorial optimisation over continuous and discrete variables, the mixed-integer linear programming (MILP) approach can address complex control and planning models providing high computational...
详细信息
ISBN:
(纸本)9781424412969
As a useful tool for combinatorial optimisation over continuous and discrete variables, the mixed-integer linear programming (MILP) approach can address complex control and planning models providing high computational efficiency as well as robust behavior. On power system planning, previous work using MILP employed conventional dc load flow model neglecting reactive power, power loss and transformer tap ratios. In this paper, a novel thyristor-controlled series compensator (TCSC) allocation model is proposed based on recently reported tine flow equations and basic linearisation rule of binary-continuous products. The objectives of the planning strategy are to improve system loadability by choosing proper locations and settings of devices. Simulation results are presented and discussed for IEEE 9- and 118-bus systems.
To attain the highest economic and energy saving characteristics of gas turbine cogeneration plants, it is necessary to rationally determine capacities and numbers of gas turbines and auxiliary equipment in considerat...
详细信息
ISBN:
(纸本)9780791847923
To attain the highest economic and energy saving characteristics of gas turbine cogeneration plants, it is necessary to rationally determine capacities and numbers of gas turbines and auxiliary equipment in consideration of their operational strategies corresponding to seasonal and hourly variations in energy demands. Some optimization approaches based on the mixed-integer linear programming (MILP) have been proposed to such configuration design problems of energy supply plants. However, with increases in the numbers of the equipment which must be considered as candidates as well as the periods which must be set for variations in energy demands, the optimal configuration design problems become too large-scale and complex to solve. The author has proposed a MILP decomposition approach to obtain quasi-optimal solutions of the optimal configuration design problems in reasonable computation times. However, this approach has been limited to the optimal configuration design problems where equipment capacities are treated continuously. In this paper, the MILP decomposition approach is extended to the optimal configuration design problems where equipment capacities are treated discretely. The effectiveness of this extended approach is investigated through a numerical study on a gas turbine cogeneration plant.
We consider the problem of planning and scheduling physical and chemical processes on a multi-product chemical batch production plant. Such a plant consists of several multi-purpose processing units and storage facili...
详细信息
ISBN:
(纸本)9781424415281
We consider the problem of planning and scheduling physical and chemical processes on a multi-product chemical batch production plant. Such a plant consists of several multi-purpose processing units and storage facilities of limited capacity. Given primary requirements for final products, the problem consists in generating an appropriate set of batches for each process and scheduling the processing of those batches on the processing units subject to different types of technological constraints. In the literature the short-term planning problem is generally modeled as a monolithic mixed-integerlinear program. Due to the combinatorial nature of the problem, those models generally cannot be used when dealing with problem instances of practical size. In this paper we propose a two-level approach which is based on a decomposition of the problem into a hatching and a batch scheduling problem. We formulate the hatching problem as a mixed-integerlinear program, which allows for considering the execution of processes on alternative processing units with unit-specific lower and upper bounds on the batch sizes. The batch scheduling problem can be solved using a specific method known from the literature. We report on computational results for a sample production process from the chemical engineering literature.
暂无评论