Category:Optimization - Revision history

LarsSangstuvall at 11:58, 14 December 2022

2022-12-14T11:58:57Z

← Older revision		Revision as of 13:58, 14 December 2022
Line 1:		Line 1:
	https://www.heurekaslu.se/wiki/Optimization		Please proceed to: https://www.heurekaslu.se/wiki/Optimization

LarsSangstuvall: Merged with page Optimization

2022-12-14T11:58:24Z

Merged with page Optimization

← Older revision		Revision as of 13:58, 14 December 2022
Line 1:		Line 1:
	~~==About the optimization tool==~~		https://www.heurekaslu.se/wiki/Optimization
	For PlanWise a very flexible optimization tool is built-in for formulating and solving LP and MIP problems. It is basically a graphical user interface to the [http://zimpl.zib.de/ ZIMPL optimization modelling language]. For solving a problem, external third-party solvers are used and directly linked to the optimization tool. Currently, the solvers available are

	*[http://lpsolve.sourceforge.net/ LPSolve], which is freely available
	*[https://soplex.zib.de SoPlex], which is freely available for academic use
	*[https://www.~~gurobi~~.~~com Gurobi<sup>®<~~/~~sup>], versions 6.0 - 9.1~~
	*[https:/~~/www.ibm.com/support/pages/how-do-i-download-cplex-optimization-studio?mhsrc=ibmsearch_a&mhq=cplex IBM CPLEX<sup>®</sup>], version 12.2~~
	*[https://www.mosek.com MOSEK<sup>®</sup>], version 7.1-8.1
	*[https://www.fico.com/en/products/fico-xpress-solver FICO Xpress<sup>®</sup>], version 7.9

	~~CPLEX, Gurobi, Xpress and MOSEK are very efficient, state-of-the-art solvers. They require a license, which can be obtained for free for academic use.~~

	The optimization model is linked to a Heureka-formatted SQL Server database used for storing input data, simulation data, and result data. This enables a seamless integration with the input data required by the optimization model, as well as direct presentation of optimization results in the form of tables, graphs, and maps. This simplifies the analysis and visualization of scenarios or plans of forest development and outputs.

	~~A number of basic models will be developed with the built-in optimization tool. A user should be able to use these as they are, or as a starting point for further development.~~

	~~==User's guide==~~
	[[Optimization]]

	~~==Available features==~~
	*Opening-size constraints can be automatically generated, resulting in a so called EARM model developed by [http://pubsonline.informs.org/doi/abs/10.1287/opre.1040.0169 Goycoolea et al. (2005)]. There is a built-in function to compute adjacency pairs, and enumeration of harvest blocks (combinations of polygons) that meet a given maximum opening size tolerance.
	*Partial set-asides (hänsynsytor) within stands are handled as separate treatment units in which no harvest activities are carried out. The development in such set-asides is in reality affected by the surroundings in the way that the risk of mortality increases in the set-aside after clear-cutting the main stand. In PlanWise, you can let the program generate one alternative for the set-aside area for each management program generated for the main stand, and let the mortality be affected by when and if clear-cutting takes place in the main stand. This is non-default, by default only one alternative is generated for the set-aside. If choosing the non-default option, you must add a link between the set-aside and the main stand in the optimization problem. There is a built-in function available from the optimization menu that does this automatically. Read more here: http://heurekaslu.org/help/index.html?naturvardsatgarder.htm, section "Lämnaande av hänsynsytor" (only in Swedish).

	~~====Ongoing development (april 2014)====~~
	Another spatial feature is currently being added by Andrew B. Martin (Dalhousie University, Canada), that makes it possible to calculate neighborhood areas for each stand. This means that for a user-specified radius originating from the centroid of each stand, the area for every other stand that is overlapped by the circle is computed. This information can then be used in optimization models that take habitat area requirements into account (see {http://www.nrcresearchpress.com/doi/abs/10.1139/x10-232#.Uz5hhfmSx8E Öhman et. al 2011]).

LarsSangstuvall at 13:05, 2 August 2022

2022-08-02T13:05:45Z

← Older revision		Revision as of 15:05, 2 August 2022
Line 4:		Line 4:
	*[http://lpsolve.sourceforge.net/ LPSolve], which is freely available		*[http://lpsolve.sourceforge.net/ LPSolve], which is freely available
	*[https://soplex.zib.de SoPlex], which is freely available for academic use		*[https://soplex.zib.de SoPlex], which is freely available for academic use
	*[https://www.gurobi.com Gurobi<sup>®</sup>], versions 6.0 - 8.1		*[https://www.gurobi.com Gurobi<sup>®</sup>], versions 6.0 - 9.1
	*[https://www.ibm.com/support/pages/how-do-i-download-cplex-optimization-studio?mhsrc=ibmsearch_a&mhq=cplex IBM CPLEX<sup>®</sup>], version 12.2		*[https://www.ibm.com/support/pages/how-do-i-download-cplex-optimization-studio?mhsrc=ibmsearch_a&mhq=cplex IBM CPLEX<sup>®</sup>], version 12.2
	*[https://www.mosek.com MOSEK<sup>®</sup>], version 7.1-8.1		*[https://www.mosek.com MOSEK<sup>®</sup>], version 7.1-8.1

Peder at 08:12, 10 September 2020

2020-09-10T08:12:54Z

← Older revision		Revision as of 10:12, 10 September 2020
Line 3:		Line 3:

	*[http://lpsolve.sourceforge.net/ LPSolve], which is freely available		*[http://lpsolve.sourceforge.net/ LPSolve], which is freely available
	*[~~http~~://~~scip~~.zib.de ~~SCIP/Soplex~~], which is freely available for academic use		*[https://soplex.zib.de SoPlex], which is freely available for academic use
	*[~~http~~://www.~~ilog~~.com~~/products/optimization/archive.cfm?acc=ggopt&gp=cplex&source=cpc&cmpn=cplex IBM CPLEX~~<sup>®</sup>], ~~version 12~~.2		*[https://www.gurobi.com Gurobi<sup>®</sup>], versions 6.0 - 8.1
	*[~~http~~://www.~~gurobi~~.com ~~Gurobi~~<sup>®</sup>], version 5.~~6 and 6.0~~		*[https://www.ibm.com/support/pages/how-do-i-download-cplex-optimization-studio?mhsrc=ibmsearch_a&mhq=cplex IBM CPLEX<sup>®</sup>], version 12.2
	*[~~http~~://www.mosek.com MOSEK<sup>®</sup>], version 7.1		*[https://www.mosek.com MOSEK<sup>®</sup>], version 7.1-8.1
	*[~~http~~://www.fico.com/en/~~analytics~~/~~optimization~~ FICO Xpress<sup>®</sup>] 7.9		*[https://www.fico.com/en/products/fico-xpress-solver FICO Xpress<sup>®</sup>], version 7.9

	CPLEX, Gurobi, Xpress and MOSEK are very efficient, state-of-the-art solvers. They require a license, which can be obtained for free for academic use.		CPLEX, Gurobi, Xpress and MOSEK are very efficient, state-of-the-art solvers. They require a license, which can be obtained for free for academic use.

Peder: /* About the optimization tool */

2016-02-25T16:07:14Z

About the optimization tool

← Older revision		Revision as of 18:07, 25 February 2016
Line 12:		Line 12:

	The optimization model is linked to a Heureka-formatted SQL Server database used for storing input data, simulation data, and result data. This enables a seamless integration with the input data required by the optimization model, as well as direct presentation of optimization results in the form of tables, graphs, and maps. This simplifies the analysis and visualization of scenarios or plans of forest development and outputs.		The optimization model is linked to a Heureka-formatted SQL Server database used for storing input data, simulation data, and result data. This enables a seamless integration with the input data required by the optimization model, as well as direct presentation of optimization results in the form of tables, graphs, and maps. This simplifies the analysis and visualization of scenarios or plans of forest development and outputs.

	As an alternative to the integrated optimization tool, an [http://www.aimms.com AIMMS] model has been developed, which may be more suitable for an OR researcher or the very advanced user who needs maximum flexibility or maximum optimization performance. This model is also linked to the same database, but is run as a separate application. It also requires an AIMMS licence.

	A number of basic models will be developed with the built-in optimization tool. A user should be able to use these as they are, or as a starting point for further development.		A number of basic models will be developed with the built-in optimization tool. A user should be able to use these as they are, or as a starting point for further development.

Peder: /* About the optimization tool */

2016-02-25T16:06:54Z

About the optimization tool

← Older revision		Revision as of 18:06, 25 February 2016
Line 9:		Line 9:
	*[http://www.fico.com/en/analytics/optimization FICO Xpress<sup>®</sup>] 7.9		*[http://www.fico.com/en/analytics/optimization FICO Xpress<sup>®</sup>] 7.9

	CPLEX, Gurobi and MOSEK are very efficient, state-of-the-art solvers. They require a license, which can be obtained for free for academic use.		CPLEX, Gurobi, Xpress and MOSEK are very efficient, state-of-the-art solvers. They require a license, which can be obtained for free for academic use.

	The optimization model is linked to a Heureka-formatted SQL Server database used for storing input data, simulation data, and result data. This enables a seamless integration with the input data required by the optimization model, as well as direct presentation of optimization results in the form of tables, graphs, and maps. This simplifies the analysis and visualization of scenarios or plans of forest development and outputs.		The optimization model is linked to a Heureka-formatted SQL Server database used for storing input data, simulation data, and result data. This enables a seamless integration with the input data required by the optimization model, as well as direct presentation of optimization results in the form of tables, graphs, and maps. This simplifies the analysis and visualization of scenarios or plans of forest development and outputs.

Peder: /* About the optimization tool */

2016-02-25T16:06:16Z

About the optimization tool

← Older revision		Revision as of 18:06, 25 February 2016
Line 4:		Line 4:
	*[http://lpsolve.sourceforge.net/ LPSolve], which is freely available		*[http://lpsolve.sourceforge.net/ LPSolve], which is freely available
	*[http://scip.zib.de SCIP/Soplex], which is freely available for academic use		*[http://scip.zib.de SCIP/Soplex], which is freely available for academic use
	*[http://www.ilog.com/products/optimization/archive.cfm?acc=ggopt&gp=cplex&source=cpc&cmpn=cplex ~~ILOG~~ CPLEX], version 12.2		*[http://www.ilog.com/products/optimization/archive.cfm?acc=ggopt&gp=cplex&source=cpc&cmpn=cplex IBM CPLEX<sup>®</sup>], version 12.2
	*[http://www.gurobi.com Gurobi], version 5.5 and 5.6		*[http://www.gurobi.com Gurobi<sup>®</sup>], version 5.6 and 6.0
	*[http://www.mosek.com MOSEK], version 7		*[http://www.mosek.com MOSEK<sup>®</sup>], version 7.1
			*[http://www.fico.com/en/analytics/optimization FICO Xpress<sup>®</sup>] 7.9

	CPLEX, Gurobi and MOSEK are very efficient, state-of-the-art solvers. They require a license, which can be obtained for free for academic use.		CPLEX, Gurobi and MOSEK are very efficient, state-of-the-art solvers. They require a license, which can be obtained for free for academic use.

Peder: /* Available features */

2014-04-04T07:57:32Z

Available features

← Older revision		Revision as of 09:57, 4 April 2014
Line 21:		Line 21:
	==Available features==		==Available features==
	*Opening-size constraints can be automatically generated, resulting in a so called EARM model developed by [http://pubsonline.informs.org/doi/abs/10.1287/opre.1040.0169 Goycoolea et al. (2005)]. There is a built-in function to compute adjacency pairs, and enumeration of harvest blocks (combinations of polygons) that meet a given maximum opening size tolerance.		*Opening-size constraints can be automatically generated, resulting in a so called EARM model developed by [http://pubsonline.informs.org/doi/abs/10.1287/opre.1040.0169 Goycoolea et al. (2005)]. There is a built-in function to compute adjacency pairs, and enumeration of harvest blocks (combinations of polygons) that meet a given maximum opening size tolerance.
	*Partial set-asides (hänsynsytor) within stands are handled as separate treatment units in which no harvest activities are carried out. The development in such set-asides is in reality affected by the surroundings in the way that the risk of mortality increases in the set-aside after clear-cutting the main stand. In PlanWise, you can let the program generate one alternative for the set-aside area for each management program generated for the main stand, and let the mortality be affected by when and if clear-cutting takes place in the main stand. This is non-default, by default only one alternative is generated for the set-aside. If choosing the non-default option, you must add a link between the set-aside and the main stand in the optimization problem. There is a built-in function in the optimization menu that ~~adds~~ this ~~link~~ automatically. Read more here: http://heurekaslu.org/help~~/RC2.0~~/index.html?naturvardsatgarder.htm, section "Lämnaande av hänsynsytor" (only in Swedish).		*Partial set-asides (hänsynsytor) within stands are handled as separate treatment units in which no harvest activities are carried out. The development in such set-asides is in reality affected by the surroundings in the way that the risk of mortality increases in the set-aside after clear-cutting the main stand. In PlanWise, you can let the program generate one alternative for the set-aside area for each management program generated for the main stand, and let the mortality be affected by when and if clear-cutting takes place in the main stand. This is non-default, by default only one alternative is generated for the set-aside. If choosing the non-default option, you must add a link between the set-aside and the main stand in the optimization problem. There is a built-in function available from the optimization menu that does this automatically. Read more here: http://heurekaslu.org/help/index.html?naturvardsatgarder.htm, section "Lämnaande av hänsynsytor" (only in Swedish).

	====Ongoing development (april 2014)====		====Ongoing development (april 2014)====
	Another spatial feature is currently being added by Andrew B. Martin (Dalhousie University, Canada), that makes it possible to calculate neighborhood areas for each stand. This means that for a user-specified radius originating from the centroid of each stand, the area for every other stand that is overlapped by the circle is computed. This information can then be used in optimization models that take habitat area requirements into account (see {http://www.nrcresearchpress.com/doi/abs/10.1139/x10-232#.Uz5hhfmSx8E Öhman et. al 2011]).		Another spatial feature is currently being added by Andrew B. Martin (Dalhousie University, Canada), that makes it possible to calculate neighborhood areas for each stand. This means that for a user-specified radius originating from the centroid of each stand, the area for every other stand that is overlapped by the circle is computed. This information can then be used in optimization models that take habitat area requirements into account (see {http://www.nrcresearchpress.com/doi/abs/10.1139/x10-232#.Uz5hhfmSx8E Öhman et. al 2011]).

Peder: /* Other options */

2014-04-04T07:56:32Z

Other options

← Older revision		Revision as of 09:56, 4 April 2014
Line 25:		Line 25:
	====Ongoing development (april 2014)====		====Ongoing development (april 2014)====
	Another spatial feature is currently being added by Andrew B. Martin (Dalhousie University, Canada), that makes it possible to calculate neighborhood areas for each stand. This means that for a user-specified radius originating from the centroid of each stand, the area for every other stand that is overlapped by the circle is computed. This information can then be used in optimization models that take habitat area requirements into account (see {http://www.nrcresearchpress.com/doi/abs/10.1139/x10-232#.Uz5hhfmSx8E Öhman et. al 2011]).		Another spatial feature is currently being added by Andrew B. Martin (Dalhousie University, Canada), that makes it possible to calculate neighborhood areas for each stand. This means that for a user-specified radius originating from the centroid of each stand, the area for every other stand that is overlapped by the circle is computed. This information can then be used in optimization models that take habitat area requirements into account (see {http://www.nrcresearchpress.com/doi/abs/10.1139/x10-232#.Uz5hhfmSx8E Öhman et. al 2011]).

	~~==Other options==~~

Peder: /* Optimization models developed or under development */

2014-04-04T07:56:19Z

Optimization models developed or under development

← Older revision		Revision as of 09:56, 4 April 2014
Line 25:		Line 25:
	====Ongoing development (april 2014)====		====Ongoing development (april 2014)====
	Another spatial feature is currently being added by Andrew B. Martin (Dalhousie University, Canada), that makes it possible to calculate neighborhood areas for each stand. This means that for a user-specified radius originating from the centroid of each stand, the area for every other stand that is overlapped by the circle is computed. This information can then be used in optimization models that take habitat area requirements into account (see {http://www.nrcresearchpress.com/doi/abs/10.1139/x10-232#.Uz5hhfmSx8E Öhman et. al 2011]).		Another spatial feature is currently being added by Andrew B. Martin (Dalhousie University, Canada), that makes it possible to calculate neighborhood areas for each stand. This means that for a user-specified radius originating from the centroid of each stand, the area for every other stand that is overlapped by the circle is computed. This information can then be used in optimization models that take habitat area requirements into account (see {http://www.nrcresearchpress.com/doi/abs/10.1139/x10-232#.Uz5hhfmSx8E Öhman et. al 2011]).

	~~==Optimization models developed or under development==~~
	~~====Non-spatial model for analyzing sustainable cut and other values (available)====~~
	~~====Harvest scheduling with clustering of old growth areas and harvest areas====~~
	~~====Harvest scheduling including road access, AAC constraints, opening size constraints, and harvest flow constraints ====~~

	==Other options==		==Other options==