(btw, these e-mails should be sent to [email protected], not to the list
owner, see http://www.pserc.cornell.edu/matpower/#mailinglist for details)
I suspect that the attached case is somehow not identical to the one used in
the paper. The base case cost is higher and removing line 153 does make the
problem infeasible.
Ray
> On Jun 27, 2015, at 3:54 PM, Mohammad Joshaki <[email protected]> wrote:
>
> Dear all,
> I am working with rundcopf on IEEE 118 bus test system. I modified the test
> system based on "S. A. Blumsack, Network Topologies and Transmission
> Investment
> Under Electric-Industry Restructuring, pp. 1–283, May 2006. ".(Modified case
> file is attached to this E-mail.).
> But DCOPF with default options doesn't converge.
> I changed DCOPF solver to MIPS using the following code:
> mpopt = mpoption('model','DC','opf.dc.solver', 'MIPS');
> Then it converged but when I opened line 153, it didn't converge!
> Based on "E. B. Fisher, R. P. O’Neill, and M. C. Ferris, “Optimal transmission
> switching,” IEEE Trans Power Syst., vol. 23, no. 3, pp. 1346–1355,
> Aug. 2008." the network should converge and have total dispatch cost of 1925
> $.
> Actually based on the last paper the total cost should be as follows:
> Base case: 2054$
> Without line 153: 1925$
> Without lines 132, 153: 1800$
> Without lines 132, 136, 153: 1646$
> But I couldn't get these results by using Matpower, because of the
> convergence problem.
> Any advice would be really appreciated.
> Best Regards,
> <case118modified.m>
