Release 1.2.

Author: rdzman

CHANGES.md

@@ -2,8 +2,11 @@ Change history for MOST
 =======================
 
 
-since version 1.1
------------------
+Version 1.2 - *Dec 13, 2022*
+----------------------------
+
+#### 12/13/22
+  - Release 1.2.
 
 #### 11/10/22
 - Update `addgen2mpc()` to expand fixed reserve parameters to keep sizes

CITATION

@@ -17,12 +17,12 @@ Scheduling Tool (MOST) explicitly acknowledge that fact by citing both the
 The MATPOWER Optimal Scheduling Tool (MOST) User's Manual should also be
 cited explicitly in work that refers to or is derived from its content.
 The citation and DOI can be version-specific or general, as appropriate.
-For version 1.1, use:
+For version 1.2, use:
 
   R. D. Zimmerman, C. E. Murillo-Sanchez. MATPOWER Optimal Scheduling
-  Tool (MOST) User's Manual, Version 1.1. 2020. [Online].
-  Available: https://matpower.org/docs/MOST-manual-1.1.pdf
-  doi: 10.5281/zenodo.4073878
+  Tool (MOST) User's Manual, Version 1.2. 2022. [Online].
+  Available: https://matpower.org/docs/MOST-manual-1.2.pdf
+  doi: 10.5281/zenodo.7434827
 
 For a version non-specific citation, use the following citation and DOI,
 with <YEAR> replaced by the year of the most recent release:

LICENSE

@@ -1,4 +1,4 @@
-Copyright (c) 1996-2020, Power Systems Engineering Research Center (PSERC)
+Copyright (c) 1996-2022, Power Systems Engineering Research Center (PSERC)
 and individual contributors (see AUTHORS file for details).
 All rights reserved.
 

README.md

@@ -57,11 +57,12 @@ t_most_30b_3_1_0.......ok
 t_most_fixed_res.......ok
 t_most_30b_1_1_0_uc....ok
 t_most_mpopf...........ok
-t_most_uc..............ok (264 of 330 skipped)
+t_most_uc..............ok (272 of 340 skipped)
 t_most_suc.............ok (148 of 185 skipped)
+t_most_tlmp............ok
 t_most_w_ds............ok
-All tests successful (310 passed, 412 skipped of 722)
-Elapsed time 46.18 seconds.
+All tests successful (359 passed, 420 skipped of 779)
+Elapsed time 39.45 seconds.
 ```
 
 If, for some reason, you prefer to install your own copy of MOST directly
@@ -113,8 +114,8 @@ Publications
 3.  A. J. Lamadrid, D. Munoz-Alvarez, C. E. Murillo-Sanchez,
     R. D. Zimmerman, H. D. Shin and R. J. Thomas, ["Using the MATPOWER
     Optimal Scheduling Tool to Test Power System Operation Methodologies
-    Under Uncertainty,"][19] *Sustainable Energy, IEEE Transactions on*,
-    vol. 10, no. 3, pp. 1280-1289, July 2019.
+    Under Uncertainty,"][11] *Sustainable Energy, IEEE Transactions on*,
+    vol. 10, no. 3, pp. 1280-1289, July 2019.  
     doi: [10.1109/TSTE.2018.2865454][11].
 
 
@@ -140,12 +141,12 @@ citing both the 2011 MATPOWER paper and the 2013 MOST paper.
 The [MATPOWER Optimal Scheduling Tool (MOST) User's Manual][7] should
 also be cited explicitly in work that refers to or is derived from its
 content. The citation and DOI can be version-specific or general, as
-appropriate. For version 1.1, use:
+appropriate. For version 1.2, use:
 
 >   R. D. Zimmerman, C. E. Murillo-Sanchez. *MATPOWER Optimal Scheduling
-    Tool (MOST) User's Manual, Version 1.1*. 2020. [Online].
-    Available: https://matpower.org/docs/MOST-manual-1.1.pdf  
-    doi: [10.5281/zenodo.4073878](https://doi.org/10.5281/zenodo.4073878)
+    Tool (MOST) User's Manual, Version 1.2*. 2022. [Online].
+    Available: https://matpower.org/docs/MOST-manual-1.2.pdf  
+    doi: [10.5281/zenodo.7434827](https://doi.org/10.5281/zenodo.7434827)
 
 For a version non-specific citation, use the following citation and DOI,
 with *\<YEAR\>* replaced by the year of the most recent release:

docs/MOST-manual.pdf

@@ -0,0 +1,69 @@
+What's New in MOST 1.2
+----------------------
+
+#### Released Dec 13, 2022
+
+Below is a summary of the changes since version 1.1 of MOST. See the
+[`CHANGES.md`][1] file for all the gory details. For release notes for
+previous versions, see Appendix B of the [MOST User's Manual][2].
+
+#### Changes:
+  - Ramping reserves and constraints are now included for the
+    transition from the initial state into period 1, except for
+    single-period problems.
+  - Added calculation of expected TLMP (temporal locational marginal
+    price) based on work by Guo, Chen, Tong in [[1](#references),
+    [2](#references), [3](#references)]. For generators, these are
+    returned in `mdo.results.GenTLMP` and `mdo.results.CondGenTLMP`.
+    For storage units they are returned in `mdo.results.StorageTLMPc`,
+    `mdo.results.StorageTLMPd`, `mdo.results.CondStorageTLMPc`, and
+    `mdo.results.CondStorageTLMPd`. See Table 5-13 in the
+    [MOST User's Manual][2].
+  - For deterministic cases with storage where `ForceCyclicStorage` is 0,
+    ensure that initial storage bounds are equal to initial storage and
+    output a warning if they are modified. Fix deterministic UC tests
+    where this was causing results to change depending on value of `rho`.
+
+#### Bugs Fixed:
+  - Plotting of commitment schedule using `plot_uc()` did not work
+    properly in a subplot, such as in `t_most_uc()`. *Thanks to Lim Han.*
+  - Fix tests that were failing under Octave 7.x.
+  - Fix issue [#29][3] where a typo caused a check on `md.UC.MinDown` > 1
+    to be skipped. *Thanks to Talha Iqbal.*
+
+#### Incompatible Changes:
+  - Modified definition of ramping reserves for period *t* (and all
+    corresponding input and output parameters) to refer to the transition
+    from *t*-1 to *t*, not *t* to *t*+1. This means that the ramping
+    reserves for the transition into the first period are now optimization
+    variables and the corresponding constraints are explicit. This is for
+    multiperiod problems only. Ramping reserves and contraints are explicitly
+    excluded for single-period problems.  
+    *Note:* This change also corrects an error in (4.11), where \gamma^t
+    is now correct. Previously it should have been \gamma^{t+1}, as it was
+    in the code.
+
+#### References
+
+1. Y. Guo, C. Chen and L. Tong, [“Pricing Multi-Interval Dispatch Under
+   Uncertainty Part I: Dispatch-Following Incentives,”][4] *IEEE Transactions
+   on Power Systems*, vol. 36, no. 5, pp. 3865–3877, Sept. 2021,
+   doi: [10.1109/TPWRS.2021.3055730][4].
+
+2. C. Chen, Y. Guo and L. Tong, [“Pricing Multi-Interval Dispatch Under
+   Uncertainty Part II: Generalization and Performance,”][5] *IEEE Transactions
+   on Power Systems*, vol. 36, no. 5, pp. 3878–3886, Sept. 2021,
+   doi: [10.1109/TPWRS.2020.3045162][5].
+
+3. C. Chen and L. Tong, [“Pricing Real-time Stochastic Storage Operations,”][6]
+   *2022 Power Systems Computation Conference (PSCC)*, June 27–July 1, 2022,
+   doi: [10.48550/arXiv.2204.08140][6].
+
+
+[1]: ../../CHANGES.md
+[2]: ../MOST-manual.pdf
+[3]: https://github.com/MATPOWER/most/issues/29
+[4]: https://doi.org/10.1109/TPWRS.2021.3055730
+[5]: https://doi.org/10.1109/TPWRS.2020.3045162
+[6]: https://doi.org/10.48550/arXiv.2204.08140
+