Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Theses/Dissertations

Mathematical optimization

ETD Archive

Articles 1 - 6 of 6

Full-Text Articles in Engineering

Biogeography-Based Optimization For Combinatorial Problems And Complex Systems, Dawei Du Jan 2014

Biogeography-Based Optimization For Combinatorial Problems And Complex Systems, Dawei Du

ETD Archive

Biogeography-based optimization (BBO) is a heuristic evolutionary algorithm that has shown good performance on many problems. In this dissertation, three problem1s 1 are researched for BBO: convergence speed and optimal solution convergence of BBO,1 1BBO application to combinatorial problems, and BBO application to complex systems. The first problem is to analyze BBO from two perspectives: how the components of BBO affect its convergence speed and the reason that BBO converges to the optimal solution. For the first perspective, which is convergence speed, we analyze the two essential components of BBO -- population construction and information sharing. For the second perspective, …


Oppositional Biogeography-Based Optimization, Mehmet Ergezer Jan 2014

Oppositional Biogeography-Based Optimization, Mehmet Ergezer

ETD Archive

This dissertation outlines a novel variation of biogeography-based optimization (BBO), which is an evolutionary algorithm (EA) developed for global optimization. The new algorithm employs opposition-based learning (OBL) alongside BBO migration to create oppositional BBO (OB BO). Additionally, a new opposition method named quasi-reflection is introduced. Quasireflection is based on opposite numbers theory and we mathematically prove that it has the highest expected probability of being closer to the problem solution among all OBL methods that we explore. Performance of quasi-opposition is validated by mathematical analysis for a single-dimensional problem and by simulations for higher dimensions. Experiments are performed on benchmark …


Path Planning And Evolutionary Optimization Of Wheeled Robots, Daljeet Singh Jan 2013

Path Planning And Evolutionary Optimization Of Wheeled Robots, Daljeet Singh

ETD Archive

Probabilistic roadmap methods (PRM) have been a well-known solution for solving motion planning problems where we have a fixed set of start and goal configurations in a workspace. We define a configuration space with static obstacles. We implement PRM to find a feasible path between start and goal for car-like robots. We further extend the concept of path planning by incorporating evolutionary optimization algorithms to tune the PRM parameters. The theory is demonstrated with simulations and experiments. Our results show that there is a significant improvement in the performance metrics of PRM after optimizing the PRM parameters using biogeography-based optimization, …


Moving Horizon Estimation With Dynamic Programming, Mohan Kumar Ramalingam Jan 2013

Moving Horizon Estimation With Dynamic Programming, Mohan Kumar Ramalingam

ETD Archive

Moving Horizon Estimation(MHE) is a optimization based strategy to state estimation. It involves computation of arrival cost, a penalty term, based on the MHE cost function. Minimization of this arrival cost is done through various methods. All these methods use nonlinear programming optimization technique which gives the estimate. The main idea of MHE revolves around minimizing the estimation cost function. The cost function is dependent on prediction error computation from data and arrival cost summarization. The major issue that hampers the MHE is choosing the arrival cost for ensuring stability of the overall estimation and computational time. In order to …


Distributed Biogeography Based Optimization For Mobile Robots, Arpit Shah Jan 2012

Distributed Biogeography Based Optimization For Mobile Robots, Arpit Shah

ETD Archive

I present hardware testing of an evolutionary algorithm (EA) known as distributed biogeography based optimization (DBBO). DBBO is an extended version of biogeography based optimization (BBO). Typically, EAs require a central computer to control the evaluation of candidate solutions to some optimization problem, and to control the sharing of information between those candidate solutions. DBBO, however, does not require a centralized unit to control individuals. Individuals independently run the EA and find a solution to a given optimization problem. Both BBO and DBBO are based on the theory of biogeography, which describes how organisms are distributed geographically in nature. I …


Biogeography-Based Optimization: Synergies With Evolutionary Strategies, Immigration Refusal, And Kalman Filters, Dawei Du Jan 2009

Biogeography-Based Optimization: Synergies With Evolutionary Strategies, Immigration Refusal, And Kalman Filters, Dawei Du

ETD Archive

Biogeography-based optimization (BBO) is a recently developed heuristic algorithm which has shown impressive performance on many well known benchmarks. The aim of this thesis is to modify BBO in different ways. First, in order to improve BBO, this thesis incorporates distinctive techniques from other successful heuristic algorithms into BBO. The techniques from evolutionary strategy (ES) are used for BBO modification. Second, the traveling salesman problem (TSP) is a widely used benchmark in heuristic algorithms, and it is considered as a standard benchmark in heuristic computations. Therefore the main task in this part of the thesis is to modify BBO to …