15,671 research outputs found
Optimizing production scheduling of steel plate hot rolling for economic load dispatch under time-of-use electricity pricing
Time-of-Use (TOU) electricity pricing provides an opportunity for industrial
users to cut electricity costs. Although many methods for Economic Load
Dispatch (ELD) under TOU pricing in continuous industrial processing have been
proposed, there are still difficulties in batch-type processing since power
load units are not directly adjustable and nonlinearly depend on production
planning and scheduling. In this paper, for hot rolling, a typical batch-type
and energy intensive process in steel industry, a production scheduling
optimization model for ELD is proposed under TOU pricing, in which the
objective is to minimize electricity costs while considering penalties caused
by jumps between adjacent slabs. A NSGA-II based multi-objective production
scheduling algorithm is developed to obtain Pareto-optimal solutions, and then
TOPSIS based multi-criteria decision-making is performed to recommend an
optimal solution to facilitate filed operation. Experimental results and
analyses show that the proposed method cuts electricity costs in production,
especially in case of allowance for penalty score increase in a certain range.
Further analyses show that the proposed method has effect on peak load
regulation of power grid.Comment: 13 pages, 6 figures, 4 table
Recent Advances in Graph Partitioning
We survey recent trends in practical algorithms for balanced graph
partitioning together with applications and future research directions
An Efficient Algorithm for Computing Network Reliability in Small Treewidth
We consider the classic problem of Network Reliability. A network is given
together with a source vertex, one or more target vertices, and probabilities
assigned to each of the edges. Each edge appears in the network with its
associated probability and the problem is to determine the probability of
having at least one source-to-target path. This problem is known to be NP-hard.
We present a linear-time fixed-parameter algorithm based on a parameter
called treewidth, which is a measure of tree-likeness of graphs. Network
Reliability was already known to be solvable in polynomial time for bounded
treewidth, but there were no concrete algorithms and the known methods used
complicated structures and were not easy to implement. We provide a
significantly simpler and more intuitive algorithm that is much easier to
implement.
We also report on an implementation of our algorithm and establish the
applicability of our approach by providing experimental results on the graphs
of subway and transit systems of several major cities, such as London and
Tokyo. To the best of our knowledge, this is the first exact algorithm for
Network Reliability that can scale to handle real-world instances of the
problem.Comment: 14 page
- âŠ