An efficient genetic algorithm for solving nonlinear optimization problems defined with fuzzy relational equations and max-Lukasiewicz composition

2018 ◽  
Vol 69 ◽  
pp. 475-492 ◽  
Author(s):  
Amin Ghodousian ◽  
Ali Babalhavaeji
Author(s):  
William P. Fox

We present both classical analytical, numerical, and heuristic techniques to solve constrained optimization problems relating to business, industry, and government. We briefly discuss other methods such as genetic algorithm. Today's business environment has many resource challenges to their attempts to maximize profits or minimize costs for which constrained optimization might be used. Facility location and transportation networks techniques are often used as well as the traveling salesman problem.


Measurement ◽  
2018 ◽  
Vol 115 ◽  
pp. 27-38 ◽  
Author(s):  
Majid Esmaelian ◽  
Madjid Tavana ◽  
Francisco J. Santos-Arteaga ◽  
Masoumeh Vali

1999 ◽  
Vol 9 (3) ◽  
pp. 755-778 ◽  
Author(s):  
Paul T. Boggs ◽  
Anthony J. Kearsley ◽  
Jon W. Tolle

Author(s):  
Kaixian Gao ◽  
Guohua Yang ◽  
Xiaobo Sun

With the rapid development of the logistics industry, the demand of customer become higher and higher. The timeliness of distribution becomes one of the important factors that directly affect the profit and customer satisfaction of the enterprise. If the distribution route is planned rationally, the cost can be greatly reduced and the customer satisfaction can be improved. Aiming at the routing problem of A company’s vehicle distribution link, we establish mathematical models based on theory and practice. According to the characteristics of the model, genetic algorithm is selected as the algorithm of path optimization. At the same time, we simulate the actual situation of a company, and use genetic algorithm to plan the calculus. By contrast, the genetic algorithm suitable for solving complex optimization problems, the practicability of genetic algorithm in this design is highlighted. It solves the problem of unreasonable transportation of A company, so as to get faster efficiency and lower cost.


Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 494
Author(s):  
Ekaterina Andriushchenko ◽  
Ants Kallaste ◽  
Anouar Belahcen ◽  
Toomas Vaimann ◽  
Anton Rassõlkin ◽  
...  

In recent decades, the genetic algorithm (GA) has been extensively used in the design optimization of electromagnetic devices. Despite the great merits possessed by the GA, its processing procedure is highly time-consuming. On the contrary, the widely applied Taguchi optimization method is faster with comparable effectiveness in certain optimization problems. This study explores the abilities of both methods within the optimization of a permanent magnet coupling, where the optimization objectives are the minimization of coupling volume and maximization of transmitted torque. The optimal geometry of the coupling and the obtained characteristics achieved by both methods are nearly identical. The magnetic torque density is enhanced by more than 20%, while the volume is reduced by 17%. Yet, the Taguchi method is found to be more time-efficient and effective within the considered optimization problem. Thanks to the additive manufacturing techniques, the initial design and the sophisticated geometry of the Taguchi optimal designs are precisely fabricated. The performances of the coupling designs are validated using an experimental setup.


Sign in / Sign up

Export Citation Format

Share Document