An Integrated Design Optimization Approach for Quantitative and Qualitative Search Space

2003 ◽  
Author(s):  
Victor Oduguwa ◽  
Rajkumar Roy ◽  
Didier Farrugia
Keyword(s):  
Real World ◽  
Design Problem ◽  
Integrated Design ◽  
Search Space ◽  
Optimization Approach ◽  
Design Optimisation ◽  
Solution Approach ◽  
Rod Rolling ◽  
Algorithmic Engineering ◽  
Real World Problems

Most of the algorithmic engineering design optimisation approaches reported in the literature aims to find the best set of solutions within a quantitative (QT) search space of the given problem while ignoring related qualitative (QL) issues. These QL issues can be very important and by ignoring them in the optimisation search, can have expensive consequences especially for real world problems. This paper presents a new integrated design optimisation approach for QT and QL search space. The proposed solution approach is based on design of experiment methods and fuzzy logic principles for building the required QL models, and evolutionary multi-objective optimisation technique for solving the design problem. The proposed technique was applied to a two objectives rod rolling problem. The results obtained demonstrate that the proposed solution approach can be used to solve real world problems taking into account the related QL evaluation of the design problem.

Genetic algorithm synthesis of four-bar mechanisms

1996 ◽  
Vol 10 (5) ◽  
pp. 371-390 ◽  
Author(s):  
Gerald P. Roston ◽  
Robert H. Sturges
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Classical Theory ◽  
Real World ◽  
Design Problem ◽  
Numerical Technique ◽  
Active Area ◽  
Mechanism Synthesis ◽  
Classical Design ◽  
Real World Problems

AbstractThe synthesis of four-bar mechanisms is a well-understood, classical design problem. The original systematic work in this field began in the late 1800s and continues to be an active area of research. Limitations to the classical theory of four-bar synthesis potentially limit its application to certain real-world problems by virtue of the small number of precision points and unspecified order. This paper presents a numerical technique for four-bar mechanism synthesis based on genetic algorithms that removes this limitation by relaxing the accuracy of the precision points.

scholarly journals Donkey and smuggler optimization algorithm: A collaborative working approach to path finding

2019 ◽  
Vol 6 (4) ◽  
pp. 562-583 ◽  
Author(s):  
Ahmed S. Shamsaldin ◽  
Tarik A. Rashid ◽  
Rawan A. Al-Rashid Agha ◽  
Nawzad K. Al-Salihi ◽  
Mokhtar Mohammadi
Keyword(s):  
Optimization Algorithm ◽  
Real World ◽  
Experimental Results ◽  
Optimization Approach ◽  
Packet Routing ◽  
Real World Data ◽  
Search Spaces ◽  
Searching Ability ◽  
Benchmark Test Functions ◽  
Real World Problems

AbstractSwarm Intelligence is a metaheuristic optimization approach that has become very predominant over the last few decades. These algorithms are inspired by animals' physical behaviors and their evolutionary perceptions. The simplicity of these algorithms allows researchers to simulate different natural phenomena to solve various real-world problems. This paper suggests a novel algorithm called Donkey and Smuggler Optimization Algorithm (DSO). The DSO is inspired by the searching behavior of donkeys. The algorithm imitates transportation behavior such as searching and selecting routes for movement by donkeys in the actual world. Two modes are established for implementing the search behavior and route-selection in this algorithm. These are the Smuggler and Donkeys. In the Smuggler mode, all the possible paths are discovered and the shortest path is then found. In the Donkeys mode, several donkey behaviors are utilized such as Run, Face & Suicide, and Face & Support. Real world data and applications are used to test the algorithm. The experimental results consisted of two parts, firstly, we used the standard benchmark test functions to evaluate the performance of the algorithm in respect to the most popular and the state of the art algorithms. Secondly, the DSO is adapted and implemented on three real-world applications namely; traveling salesman problem, packet routing, and ambulance routing. The experimental results of DSO on these real-world problems are very promising. The results exhibit that the suggested DSO is appropriate to tackle other unfamiliar search spaces and complex problems.Highlights Donkey and Smuggler Optimization Algorithm (DSO) is a novel optimization algorithm. The DSO is inspired by Donkeys' behaviors. It has been evaluated against other algorithms. DSO solves different problems such as TSP, packet routing, and ambulance routing. The outcomes on the tests exhibit a greater manipulation of DSO. The outcomes prove that DSO has a greater searching ability.

scholarly journals A Bio-Inspired Method for Mathematical Optimization Inspired by Arachnida Salticidade

Mathematics ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 102
Author(s):  
Hernán Peraza-Vázquez ◽  
Adrián Peña-Delgado ◽  
Prakash Ranjan ◽  
Chetan Barde ◽  
Arvind Choubey ◽  
...  
Keyword(s):  
Real World ◽  
Optimization Problems ◽  
Mathematical Optimization ◽  
Search Space ◽  
Hunting Strategies ◽  
Harmonic Elimination ◽  
Selective Harmonic Elimination ◽  
Mathematical Problems ◽  
Elimination Problem ◽  
Real World Problems

This paper proposes a new meta-heuristic called Jumping Spider Optimization Algorithm (JSOA), inspired by Arachnida Salticidae hunting habits. The proposed algorithm mimics the behavior of spiders in nature and mathematically models its hunting strategies: search, persecution, and jumping skills to get the prey. These strategies provide a fine balance between exploitation and exploration over the solution search space and solve global optimization problems. JSOA is tested with 20 well-known testbench mathematical problems taken from the literature. Further studies include the tuning of a Proportional-Integral-Derivative (PID) controller, the Selective harmonic elimination problem, and a few real-world single objective bound-constrained numerical optimization problems taken from CEC 2020. Additionally, the JSOA’s performance is tested against several well-known bio-inspired algorithms taken from the literature. The statistical results show that the proposed algorithm outperforms recent literature algorithms and is capable to solve challenging real-world problems with unknown search space.

scholarly journals Handrails through the Swamp? A Pilot to Test the Integration and Implementation Science Framework in Complex Real-World Research

2021 ◽  
Vol 13 (10) ◽  
pp. 5491
Author(s):  
Melissa Robson-Williams ◽  
Bruce Small ◽  
Roger Robson-Williams ◽  
Nick Kirk
Keyword(s):  
Pilot Study ◽  
Case Studies ◽  
Implementation Science ◽  
Real World ◽  
Environmental Problems ◽  
Environmental Research ◽  
Integrative Framework ◽  
The World ◽  
Science Framework ◽  
Real World Problems

The socio-environmental challenges the world faces are ‘swamps’: situations that are messy, complex, and uncertain. The aim of this paper is to help disciplinary scientists navigate these swamps. To achieve this, the paper evaluates an integrative framework designed for researching complex real-world problems, the Integration and Implementation Science (i2S) framework. As a pilot study, we examine seven inter and transdisciplinary agri-environmental case studies against the concepts presented in the i2S framework, and we hypothesise that considering concepts in the i2S framework during the planning and delivery of agri-environmental research will increase the usefulness of the research for next users. We found that for the types of complex, real-world research done in the case studies, increasing attention to the i2S dimensions correlated with increased usefulness for the end users. We conclude that using the i2S framework could provide handrails for researchers, to help them navigate the swamps when engaging with the complexity of socio-environmental problems.

scholarly journals Combined Games with Randomly Delayed Beginnings

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 534
Author(s):  
F. Thomas Bruss
Keyword(s):  
Discrete Time ◽  
Real World ◽  
Optimal Stopping ◽  
Random Variables ◽  
Approximate Solutions ◽  
Real World Problems

This paper presents two-person games involving optimal stopping. As far as we are aware, the type of problems we study are new. We confine our interest to such games in discrete time. Two players are to chose, with randomised choice-priority, between two games G1 and G2. Each game consists of two parts with well-defined targets. Each part consists of a sequence of random variables which determines when the decisive part of the game will begin. In each game, the horizon is bounded, and if the two parts are not finished within the horizon, the game is lost by definition. Otherwise the decisive part begins, on which each player is entitled to apply their or her strategy to reach the second target. If only one player achieves the two targets, this player is the winner. If both win or both lose, the outcome is seen as “deuce”. We motivate the interest of such problems in the context of real-world problems. A few representative problems are solved in detail. The main objective of this article is to serve as a preliminary manual to guide through possible approaches and to discuss under which circumstances we can obtain solutions, or approximate solutions.

Review of Network Flow Algorithms David P. Williamson

2021 ◽  
Vol 52 (1) ◽  
pp. 12-15
Author(s):  
S.V. Nagaraj
Keyword(s):  
Graduate Students ◽  
Real World ◽  
Network Flow ◽  
Network Flows ◽  
Optimization Problems ◽  
Capacity Constraints ◽  
Incoming Flow ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Real World Problems

This book is on algorithms for network flows. Network flow problems are optimization problems where given a flow network, the aim is to construct a flow that respects the capacity constraints of the edges of the network, so that incoming flow equals the outgoing flow for all vertices of the network except designated vertices known as the source and the sink. Network flow algorithms solve many real-world problems. This book is intended to serve graduate students and as a reference. The book is also available in eBook (ISBN 9781316952894/US$ 32.00), and hardback (ISBN 9781107185890/US$99.99) formats. The book has a companion web site www.networkflowalgs.com where a pre-publication version of the book can be downloaded gratis.

Help communities solve real-world problems with AI

AI Matters ◽  
2019 ◽  
Vol 5 (3) ◽  
pp. 12-14
Author(s):  
Tara Chklovski
Keyword(s):  
Real World ◽  
Real World Problems
Sign in / Sign up

Export Citation Format

Share Document