Simulated annealingSimulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space for an optimization problem. For large numbers of local optima, SA can find the global optima. It is often used when the search space is discrete (for example the traveling salesman problem, the boolean satisfiability problem, protein structure prediction, and job-shop scheduling).
Monetary policyMonetary policy is the policy adopted by the monetary authority of a nation to affect monetary and other financial conditions to accomplish broader objectives like high employment and price stability (normally interpreted as a low and stable rate of inflation). Further purposes of a monetary policy may be to contribute to economic stability or to maintain predictable exchange rates with other currencies.
Peak demandPeak demand on an electrical grid is simply the highest electrical power demand that has occurred over a specified time period (Gönen 2008). Peak demand is typically characterized as annual, daily or seasonal and has the unit of power. Peak demand, peak load or on-peak are terms used in energy demand management describing a period in which electrical power is expected to be provided for a sustained period at a significantly higher than average supply level. Peak demand fluctuations may occur on daily, monthly, seasonal and yearly cycles.
MetaheuristicIn computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, tune, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem or a machine learning problem, especially with incomplete or imperfect information or limited computation capacity. Metaheuristics sample a subset of solutions which is otherwise too large to be completely enumerated or otherwise explored.
Monetary economicsMonetary economics is the branch of economics that studies the different theories of money: it provides a framework for analyzing money and considers its functions (such as medium of exchange, store of value, and unit of account), and it considers how money can gain acceptance purely because of its convenience as a public good. The discipline has historically prefigured, and remains integrally linked to, macroeconomics. This branch also examines the effects of monetary systems, including regulation of money and associated financial institutions and international aspects.
Monetary inflationMonetary inflation is a sustained increase in the money supply of a country (or currency area). Depending on many factors, especially public expectations, the fundamental state and development of the economy, and the transmission mechanism, it is likely to result in price inflation, which is usually just called "inflation", which is a rise in the general level of prices of goods and services.Michael F. Bryan, On the Origin and Evolution of the Word "Inflation", clevelandfed.
Monetary systemA monetary system is a system by which a government provides money in a country's economy. Modern monetary systems usually consist of the national treasury, the mint, the central banks and commercial banks. Commodity money A commodity money system is a type of monetary system in which a commodity such as gold or seashells is made the unit of value and physically used as money. The money retains its value because of its physical properties.
Hill climbingIn numerical analysis, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by making an incremental change to the solution. If the change produces a better solution, another incremental change is made to the new solution, and so on until no further improvements can be found. For example, hill climbing can be applied to the travelling salesman problem.
Genetic algorithmIn computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection. Some examples of GA applications include optimizing decision trees for better performance, solving sudoku puzzles, hyperparameter optimization, causal inference, etc.
Nurse scheduling problemThe nurse scheduling problem (NSP), also called the nurse rostering problem (NRP), is the operations research problem of finding an optimal way to assign nurses to shifts, typically with a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions. Solutions to the nurse scheduling problem can be applied to constrained scheduling problems in other fields. The nurse scheduling problem has been studied since before 1969, and is known to have NP-hard complexity.
