Production scheduling under uncertainty of an open-pit mine using Lagrangian relaxation and branch-and-cut algorithm

ABSTRACT

The life-of-mine optimization of open pit mine production scheduling under geological uncertainty is a computationally intensive process. Production scheduling determines the optimal extraction sequence by maximizing net present value (NPV). In this paper, an algorithm is proposed to schedule an open pit mine under geological uncertainty, where instead of solving the whole problem at once, the production schedule is generated by sequentially solving sub-problems. The sub-gradient method is used to generate the upper bound solution of a Lagrangian relaxed sub-problem. If the upper bound relaxed solution is infeasible, a mixed integer programming is applied to the latter solution. The algorithm is validated by solving six problems and is compared to the linear relaxation of the original production scheduling problem. The results show that the proposed algorithm generates a solution that is very close to optimal, with less than a 3% optimality gap. An application at a copper mine, where geological uncertainty is quantified with geostatistical simulations of the related orebody, shows that all constraints are satisfied and an 11% higher NPV is generated when compared to the corresponding deterministic equivalent of the proposed approach, while a 26% higher NPV is generated compared to a common conventional industry approach.     

基于局部路径重连的多星测控调度遗传交叉算子

为提高多星测控调度问题简单遗传算法的搜索精度,设计一种基于局部分层路径搜索的交叉算子(local layering path-relinking crossover operator,LLPRCO)。分析多星测控调度问题的遗传算法编码特点,得出解空间的复杂性和基因间较弱的相关性。借鉴路径重连的思想,利用构成初始解和引导解要素的差异性,构建从初始解出发的分层搜索邻域,将邻域中满足模型约束的解作为交叉的结果,并创建2个仿真场景进行验证。仿真结果表明,该交叉算子与具备一定随机特性的交叉算子混合使用能明显提高遗传算法对问题的求解性能。     

Surrogate-based optimization of a periodic rescheduling algorithm

Periodic rescheduling is an iterative method for real-time decision-making on industrial process operations. The design of such methods involves high-level when-to-schedule and how-to-schedule decisions, the optimal choices of which depend on the operating environment. The evaluation of the choices typically requires computationally costly simulation of the process, which—if not sufficiently efficient—may result in a failure to deploy the system in practice. We propose the continuous control parameter choices, such as the re-optimization frequency and horizon length, to be determined using surrogate-based optimization. We demonstrate the method on real-time rebalancing of a bike sharing system. Our results on three test cases indicate that the method is useful in reducing the computational cost of optimizing an online algorithm in comparison to the full factorial sampling.     

A nested online scheduling and nonlinear model predictive control framework for multi-product continuous systems

In the pursuit of integrated scheduling and control frameworks for chemical processes, it is important to develop accurate integrated models and computational strategies such that optimal decisions can be made in a dynamic environment. In this study, a recently developed switched system formulation that integrates scheduling and control decisions is extended to closed-loop operation embedded with nonlinear model predictive control (NMPC). The resulting framework is a nested online scheduling and control loop that allows to obtain fast and accurate solutions as no model reduction is needed and no integer variables are involved in the formulations. In the outer loop, the integrated model is solved to calculate an optimal product switching sequence such that the process economics is optimized, whereas in the inner loop, an NMPC implements the scheduling decisions. The proposed scheme was tested on two multi-product continuous systems. Unexpected large disturbances and rush orders were handled effectively.     

[车间调度]求解带有阻塞限制的HFSP的MILP模型与改进回溯搜索算法

针对带有阻塞限制的不相关并行机混合流水车间调度问题,以最小化最长完工时间为目标,依据不同的建模思想,建立了求解该问题的4个混合整数线性规划(MILP)模型;鉴于混合整数线性规划不适合求解中大规模问题,提出了一种改进的回溯搜索算法以求解中大规模问题,在该算法中,引入了轮盘赌选择策略以及变邻域搜索算法,以提高算法的收敛速度以及局部搜索能力。最后,对所提MILP模型以及算法进行了对比分析,通过对具体实例的求解验证了所提MILP模型以及算法的有效性及优越性。     

煤炭公司级安全生产综合信息平台的设计与实现

基于现有数字化矿山应用现状及煤炭公司级安全生产调度与集约化管理需求,提出了基于煤炭集团公司安全生产综合信息系统平台,作为矿井数字化矿山信息化部分业务内容在公司层面的系统集成与向上延伸扩展与综合应用。平台的建设为集团公司综合调度提供了信息化支撑,使得各级调度管理人员能够分级分责快速获取作业现场安全生产运营数据信息,实现协同调度指挥与现代化集团集约化管控模式,减少重复性投资,提高企业的核心竞争力。     

Inventory pinch based,multiscale models for integrated planning and scheduling‐part II: Gasoline blend scheduling

Integration of planning and scheduling optimizes simultaneous decisions at both levels, thereby leading to more efficient operation. A three‐level discrete‐time algorithm which uses nonlinear models and integrates planning and detailed scheduling is introduced: first level optimizes nonlinear blend models via multiperiod nonlinear programming (NLP), where period boundaries are initially determined by the inventory pinch points; second level uses fixed recipes (from the first level) in a multiperiod mixed‐integer linear program to determine first an optimal production plan and then to optimize an approximate schedule which minimizes the total number of switches in blenders and swing tanks; third level computes detailed schedules that adhere to inventory constraints computed in the approximate schedule. If inventory infeasibilities appear at the second or the third level, the first‐level periods are subdivided and blend recipes are reoptimized. Algorithm finds the same or better solutions and is substantially faster than previously published full‐space continuous‐time model. © 2014 American Institute of Chemical Engineers AIChE J, 60: 2475–2497, 2014     

Optimization models for shale gas water management

There are four key aspects for water use in hydraulic fracturing, including source water acquisition, wastewater production, reuse and recycle, and subsequent transportation, storage, and disposal. Water use life cycle is optimized for wellpads through a discrete‐time two‐stage stochastic mixed‐integer linear programming model under uncertain availability of water. The objective is to minimize expected transportation, treatment, storage, and disposal cost while accounting for the revenue from gas production. Assuming freshwater sources, river withdrawal data, location of wellpads, and treatment facilities are given, the goal is to determine an optimal fracturing schedule in coordination with water transportation, and its treatment and reuse. The proposed models consider a long‐time horizon and multiple scenarios from historical data. Two examples representative of the Marcellus Shale play are presented to illustrate the effectiveness of the formulation, and to identify optimization opportunities that can improve both the environmental impact and economical use of water. © 2014 American Institute of Chemical Engineers AIChE J, 60: 3490–3501, 2014     

Evaluation of a CPU Scheduling Mechanism for Multimedia Systems

Multimedia applications handling audio and video data have to obey time characteristics of these media types. Besides a basic functionality to express time relations, correctness with respect to time constraints requires mechanisms which lead to favoured processing of multimedia operations. CPU scheduling techniques based on the experience from real-time operating systems offer a solution and provide multimedia applications with the ability to meet time-related quality of service requirements. This paper discusses mechanisms to express time in multimedia systems and describes an implementation of a CPU scheduler designed to run under IBM's UNIX derivate AIX. The evaluation of the implementation based on measurements shows that the scheduler is able to support the time requirements of multimedia applications and that such mechanisms are indeed necessary since otherwise deadline violations occur.     

一种提高802.11无线Ad Hoc网络公平性的新机制-FFMA

实现多个数据流对无线信道的公平共享是802.11无线Ad Hoc网络中的一个重要议题,但802.11DCF机制在无线Ad Hoc网络中存在严重的公平性问题,甚至有可能出现单个节点或数据流独占信道而其他节点和数据流处于"饥饿"状态的情况.论文提出了一种新颖的保证数据流间公平性的MAC层接入机制FFMA(Flow rate-based Fair Medium Access),通过公平调度和公平竞争的方式,FFMA能够在数据流间公平地分配信道带宽资源.仿真结果表明,在无线Ad Hoc网络中,FFMA可以在保证信道吞吐量的前提下取得远优于802.11 DCF的数据流间的公平性.