Premium
Centroid Mapping Optimization: A New Efficient Optimization for Food Research and Processing
Author(s) -
AISHIMA T.,
NAKAI S.
Publication year - 1986
Publication title -
journal of food science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.772
H-Index - 150
eISSN - 1750-3841
pISSN - 0022-1147
DOI - 10.1111/j.1365-2621.1986.tb13109.x
Subject(s) - centroid , simplex , vertex (graph theory) , simplex algorithm , range (aeronautics) , mathematical optimization , computer science , algorithm , mathematics , artificial intelligence , linear programming , engineering , theoretical computer science , combinatorics , graph , aerospace engineering
Experimenting at the centroid during simplex optimization was efficient in search for the optimum. A centroid search process, which replaced the worst vertex within the simplex with the centroid vertex one after another, was introduced. In the new method, the optimum can be found by combination of initial simplex, centroid search, mapping and simultaneous factor shift. An algorithm to define the new range for the subsequent simplex was also applied when the centroid search did not work effectively. This new method enabled efficient research by conducting a set of experiments simultaneously. By changing the range in sequential simplex/centroid search, the optimum could be more efficiently found than by previous simplex methods when compared with mathematical models.