Optimization, or Simulation Based Optimization (SBO), is a powerful technique employed to \u2018seek out\u2019 the best possible solution from an \u2018infinite\u2019 pool of potential solutions.<\/p>\n\n\n\n
Imagine a warehouse with 1099 storage spaces, designated to accommodate 100 different part numbers. Each space needs to be assigned to one of the 100 part numbers, with each item number guaranteed at least one space. The products dynamically flow in and out of the warehouse, influenced by various parameters. The challenge now is to calculate the optimal distribution of storage spaces for each part number to maximize warehouse utilization.<\/p>\n\n\n\n
Assuming no additional constraints, each item number can occupy anywhere between 1 and 1000 (1099 – 99 = 1000) spaces. This scenario leads to a staggering 1000^100 = 1 * 10^300 possible combinations or solutions. That\u2019s a one followed by 300 zeros! While it\u2019s not technically an infinite number of solutions, it\u2019s still an astronomical figure, especially considering the relatively limited scope of the calculation.<\/p>\n\n\n\n
An optimization algorithm\u2019s mission is to pinpoint the optimal, or near-optimal, solution for a given optimization problem. Various types of optimization algorithms exist, each specialized in different problem scenarios. In the aforementioned example, the sole objective is to maximize the utilization rate. However, most real-world cases involve multiple objectives that need to be optimized simultaneously. These objectives often contradict each other. For instance, one might need to maximize the production throughput while minimizing the work-in-progress.<\/p>\n\n\n\n
When multiple objectives need to be met, one common optimization technique involves converting the values from each result parameter into a universal parameter, such as cost. This approach allows for optimization as if there\u2019s only a single objective. However, this method may not always provide the ideal solution. In such instances, it\u2019s beneficial to employ Multi-Objective Optimization (MOO), a strategy specifically designed to optimize multiple objectives simultaneously.<\/p>\n\n\n\n
NSGA-II stands as a well-known multi-objective optimization algorithm. This algorithm operates by initiating with a random population. The superior solutions within this population are permitted to survive and generate the succeeding population. Through this process, the algorithm almost always succeeds in identifying the optimal or near-optimal solution among an \u2018infinite\u2019 array of possibilities.<\/p>\n\n\n\n
Optimization time plays almost always a crucial role. Even though the optimization algorithm aids in pinpointing the optimal solution, it often requires numerous generations to discover the best solution, particularly for large optimization problems. For each individual in every generation, the Flow Simulation model must be executed to give a unique result. This necessity for speed is a key reason why it\u2019s vital to build a Flow Simulation model to run fast and underscores the importance of simplifying Simulation models.<\/p>\n","protected":false},"excerpt":{"rendered":"
Optimization, or Simulation Based Optimization (SBO), is a powerful technique employed to \u2018seek out\u2019 the best possible solution from an \u2018infinite\u2019 pool of potential solutions. EXAMPLE OPTIMIZATION PROBLEM Imagine a warehouse with 1099 storage spaces, designated to accommodate 100 different part numbers. Each space needs to be assigned to one of the 100 part numbers, […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":1324,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"inline_featured_image":false,"footnotes":""},"class_list":["post-1396","page","type-page","status-publish","hentry"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/pages\/1396","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/comments?post=1396"}],"version-history":[{"count":5,"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/pages\/1396\/revisions"}],"predecessor-version":[{"id":2269,"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/pages\/1396\/revisions\/2269"}],"up":[{"embeddable":true,"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/pages\/1324"}],"wp:attachment":[{"href":"https:\/\/simulationpartner.se\/en\/wp-json\/wp\/v2\/media?parent=1396"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}