5,310 research outputs found
Optimal dynamic operations scheduling for small-scale satellites
A satellite's operations schedule is crafted based on each subsystem/payload operational needs, while taking into account the available resources on-board. A number of operating modes are carefully designed, each one with a different operations plan that can serve emergency cases, reduced functionality cases, the nominal case, the end of mission case and so on. During the mission span, should any operations planning amendments arise, a new schedule needs to be manually developed and uplinked to the satellite during a communications' window. The current operations planning techniques over a reduced number of solutions while approaching operations scheduling in a rigid manner. Given the complexity of a satellite as a system as well as the numerous restrictions and uncertainties imposed by both environmental and technical parameters, optimising the operations scheduling in an automated fashion can over a flexible approach while enhancing the mission robustness. In this paper we present Opt-OS (Optimised Operations Scheduler), a tool loosely based on the Ant Colony System algorithm, which can solve the Dynamic Operations Scheduling Problem (DOSP). The DOSP is treated as a single-objective multiple constraint discrete optimisation problem, where the objective is to maximise the useful operation time per subsystem on-board while respecting a set of constraints such as the feasible operation timeslot per payload or maintaining the power consumption below a specific threshold. Given basic mission inputs such as the Keplerian elements of the satellite's orbit, its launch date as well as the individual subsystems' power consumption and useful operation periods, Opt-OS outputs the optimal ON/OFF state per subsystem per orbital time step, keeping each subsystem's useful operation time to a maximum while ensuring that constraints such as the power availability threshold are never violated. Opt-OS can provide the flexibility needed for designing an optimal operations schedule on the spot throughout any mission phase as well as the ability to automatically schedule operations in case of emergency. Furthermore, Opt-OS can be used in conjunction with multi-objective optimisation tools for performing full system optimisation. Based on the optimal operations schedule, subsystem design parameters are being optimised in order to achieve the maximal usage of the satellite while keeping its mass minimal
Robust integrated production-maintenance scheduling for an evaporation network
Producción CientíficaThis work aims to reduce the global resource consumption in an industrial evaporation network by better tasks management and coordination. The network works in continuous, processing some products in several evaporation plants, so optimal load allocation and product-plant assignment problems appear. The plants have different features (capacity, equipment, etc.) and their performance is affected by fouling inside the heat exchangers and external factors. Hereby, the optimizer has to decide when maintenance operations have to be triggered. Therefore, a mixed production/maintenance scheduling problem arises. The plant behavior is approximated by surrogate linear models obtained experimentally, allowing thus the use of mixed-integer linear optimization routines to obtain solutions in acceptable time. Furthermore, uncertainty in the weather forecast and in the production plan is also considered via a two-stage stochastic programming approach. Finally, a trade-off analysis between other objectives of interest is given to support the decision maker.Spanish Government with project INOPTCON (MINECO/FEDER DPI2015-70975-P)
Efficient scheduling of batch processes in continuous processing lines
This thesis focuses mainly on the development of efficient formulations for scheduling
in industrial environments. Likewise, decisions over the processes more related
to advanced process control or production planning are included in the scheduling;
in this way, the schedule obtained will be more efficient than it would be if the
additional restrictions were not considered. The formulations have to emphasize
obtaining online implementations, as they are planned to be used in real plants.
The most common scheduling problems handled in the industrial environments
are: the assignment of tasks to units, the distribution of production among parallel
units and the distribution of shared resources among concurrent processes. Most
advances in this work are the result of a collaborative work.Departamento de Ingeniería de Sistemas y AutomáticaDoctorado en Ingeniería Industria
Optimization of intersatellite routing for real-time data download
The objective of this study is to develop a strategy to maximise the available bandwidth to Earth of a satellite constellation through inter-satellite links. Optimal signal routing is achieved by mimicking the way in which ant colonies locate food sources, where the 'ants' are explorative data packets aiming to find a near-optimal route to Earth. Demonstrating the method on a case-study of a space weather monitoring constellation; we show the real-time downloadable rate to Earth
Recommended from our members
A memetic ant colony optimization algorithm for the dynamic travelling salesman problem
Copyright @ Springer-Verlag 2010.Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP (DTSP), where cities are replaced by new ones during the execution of the algorithm. Under such environments, traditional ACO algorithms face a serious challenge: once they converge, they cannot adapt efficiently to environmental changes. To improve the performance of ACO on the DTSP, we investigate a hybridized ACO with local search (LS), called Memetic ACO (M-ACO) algorithm, which is based on the population-based ACO (P-ACO) framework and an adaptive inver-over operator, to solve the DTSP. Moreover, to address premature convergence, we introduce random immigrants to the population of M-ACO when identical ants are stored. The simulation experiments on a series of dynamic environments generated from a set of benchmark TSP instances show that LS is beneficial for ACO algorithms when applied on the DTSP, since it achieves better performance than other traditional ACO and P-ACO algorithms.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01 and Grant EP/E060722/02
An analysis-forecast system for uncertainty modeling of wind speed: A case study of large-scale wind farms
© 2017 Elsevier Ltd The uncertainty analysis and modeling of wind speed, which has an essential influence on wind power systems, is consistently considered a challenging task. However, most investigations thus far were focused mainly on point forecasts, which in reality cannot facilitate quantitative characterization of the endogenous uncertainty involved. An analysis-forecast system that includes an analysis module and a forecast module and can provide appropriate scenarios for the dispatching and scheduling of a power system is devised in this study; this system superior to those presented in previous studies. In order to qualitatively and quantitatively investigate the uncertainty of wind speed, recurrence analysis techniques are effectively developed for application in the analysis module. Furthermore, in order to quantify the uncertainty accurately, a novel architecture aimed at uncertainty mining is devised for the forecast module, where a non-parametric model optimized by an improved multi-objective water cycle algorithm is considered a predictor for producing intervals for each mode component after feature selection. The results of extensive in-depth experiments show that the devised system is not only superior to the considered benchmark models, but also has good potential practical applications in wind power systems
Scenario driven optimal sequencing under deep uncertainty
Abstract not availableEva H.Y. Beh, Holger R. Maier, Graeme C. Dand
- …