Abstract
This paper applies a new concept in discrete event dynamic system (DEDS) optimization, called ordinal optimization, to address distribution reconfiguration for loss minimization. Different from the conventional optimization concept to make every effort to find the best numerical solution in a deterministic approach, ordinal optimization is to efficiently find a good enough solution with an acceptable probability for a discrete event optimization problem. This paper first reviews ordinal optimization and then presents probabilistic analysis, complementary to the previous theoretic research in ordinal optimization, about the overlap of representative set and good enough set. Then, this paper applies ordinal optimization to address the distribution reconfiguration problem for loss minimization. The proposed algorithm is discussed in details. Tests on a series of sample systems are performed to illustrate the idea of ordinal optimization applied in distribution reconfiguration. The paper also analyzes and verifies the test results such as ordered performance curve (OPC) shape, solution accuracy, running time, and error distribution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
