Tabu searchTabu search (TS) is a metaheuristic search method employing local search methods used for mathematical optimization. It was created by Fred W. Glover in 1986 and formalized in 1989. Local (neighborhood) searches take a potential solution to a problem and check its immediate neighbors (that is, solutions that are similar except for very few minor details) in the hope of finding an improved solution. Local search methods have a tendency to become stuck in suboptimal regions or on plateaus where many solutions are equally fit.
Alloy steelAlloy steel is steel that is alloyed with a variety of elements in total amounts between 1.0% and 50% by weight to improve its mechanical properties. Alloy steels are broken down into two groups: low alloy steels and high alloy steels. The difference between the two is disputed. Smith and Hashemi define the difference at 4.0%, while Degarmo, et al., define it at 8.0%. Most commonly, the phrase "alloy steel" refers to low-alloy steels. Strictly speaking, every steel is an alloy, but not all steels are called "alloy steels".
Rolling (metalworking)In metalworking, rolling is a metal forming process in which metal stock is passed through one or more pairs of rolls to reduce the thickness, to make the thickness uniform, and/or to impart a desired mechanical property. The concept is similar to the rolling of dough. Rolling is classified according to the temperature of the metal rolled. If the temperature of the metal is above its recrystallization temperature, then the process is known as hot rolling.
Steel millA steel mill or steelworks is an industrial plant for the manufacture of steel. It may be an integrated steel works carrying out all steps of steelmaking from smelting iron ore to rolled product, but may also be a plant where steel semi-finished casting products are made from molten pig iron or from scrap. Since the invention of the Bessemer process, steel mills have replaced ironworks, based on puddling or fining methods. New ways to produce steel appeared later: from scrap melted in an electric arc furnace and, more recently, from direct reduced iron processes.
Aluminium alloyAn aluminium alloy (or aluminum alloy; see spelling differences) is an alloy in which aluminium (Al) is the predominant metal. The typical alloying elements are copper, magnesium, manganese, silicon, tin, nickel and zinc. There are two principal classifications, namely casting alloys and wrought alloys, both of which are further subdivided into the categories heat-treatable and non-heat-treatable. About 85% of aluminium is used for wrought products, for example rolled plate, foils and extrusions.
AlloyAn alloy is a mixture of chemical elements of which at least one is a metal. Unlike chemical compounds with metallic bases, an alloy will retain all the properties of a metal in the resulting material, such as electrical conductivity, ductility, opacity, and luster, but may have properties that differ from those of the pure metals, such as increased strength or hardness. In some cases, an alloy may reduce the overall cost of the material while preserving important properties.
Iterated local searchIterated Local Search (ILS) is a term in applied mathematics and computer science defining a modification of local search or hill climbing methods for solving discrete optimization problems. Local search methods can get stuck in a local minimum, where no improving neighbors are available. A simple modification consists of iterating calls to the local search routine, each time starting from a different initial configuration. This is called repeated local search, and implies that the knowledge obtained during the previous local search phases is not used.
Local search (optimization)In computer science, local search is a heuristic method for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate solutions. Local search algorithms move from solution to solution in the space of candidate solutions (the search space) by applying local changes, until a solution deemed optimal is found or a time bound is elapsed.
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.
Search algorithmIn computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. The appropriate search algorithm to use often depends on the data structure being searched, and may also include prior knowledge about the data.
