Studying Evolutionary Solution Adaption Using a Flexibility Benchmark Based on a Metal Cutting Process

May 31, 2023 ยท Declared Dead ยท ๐Ÿ› Biomimetics

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Leo Francoso Dal Piccol Sotto, Sebastian Mayer, Hemanth Janarthanam, Alexander Butz, Jochen Garcke arXiv ID 2305.19775 Category cs.NE: Neural & Evolutionary Citations 0 Venue Biomimetics Last Checked 4 months ago
Abstract
We consider optimizing for different production requirements from the viewpoint of a bio-inspired framework for system flexibility that allows us to study the ability of an algorithm to transfer solutions from previous optimization tasks, which also relates to dynamic evolutionary optimization. Optimizing manufacturing process parameters is typically a multi-objective problem with often contradictory objectives such as production quality and production time. If production requirements change, process parameters have to be optimized again. Since optimization usually requires costly simulations based on, for example, the Finite Element method, it is of great interest to have means to reduce the number of evaluations needed for optimization. Based on the extended Oxley model for orthogonal metal cutting, we introduce a multi-objective optimization benchmark where different materials define related optimization tasks. We use the benchmark to study the flexibility of NSGA-II, which we extend by two variants: 1) varying goals, which optimizes solutions for two tasks simultaneously to obtain in-between source solutions expected to be more adaptable, and 2) active-inactive genotype, which accommodates different possibilities that can be activated or deactivated. Results show that adaption, i.e. transferring a solution from a previous optimization task, with standard NSGA-II greatly reduces the number of evaluations required for optimization to a target goal in comparison to starting from scratch. The proposed variants further improve the adaption costs, although further work is needed towards making the methods advantageous for real applications.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Neural & Evolutionary

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

LSTM: A Search Space Odyssey

Klaus Greff, Rupesh Kumar Srivastava, ... (+3 more)

cs.NE ๐Ÿ› IEEE TNNLS ๐Ÿ“š 6.0K cites 11 years ago

Died the same way โ€” ๐Ÿ‘ป Ghosted