Multi-speed Gearbox Synthesis Using Global Search and Non-convex Optimization

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the synthesis problem of a multi-speed gearbox, a mechanical system that receives an input speed and transmits it to an outlet through a series of connected gears, decreasing or increasing the speed according to predetermined transmission ratios. Here we formulate this as a bi-level optimization problem, where the inner problem involves non-convex optimization over continuous parameters of the components, and the outer task explores different configurations of the system. The outer problem is decomposed into sub-tasks and optimized by a variety of global search methods, namely simulated annealing, best-first search and estimation of distribution algorithm. Our experiments show that a three-stage decomposition coupled with a best-first search performs well on small-size problems, and it outmatches other techniques on larger problems when coupled with an estimation of distribution algorithm.

Cite

CITATION STYLE

APA

Piacentini, C., Cheong, H., Ebrahimi, M., & Butscher, A. (2020). Multi-speed Gearbox Synthesis Using Global Search and Non-convex Optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12296 LNCS, pp. 381–398). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-58942-4_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free