1,295 research outputs found
Memetic Multilevel Hypergraph Partitioning
Hypergraph partitioning has a wide range of important applications such as
VLSI design or scientific computing. With focus on solution quality, we develop
the first multilevel memetic algorithm to tackle the problem. Key components of
our contribution are new effective multilevel recombination and mutation
operations that provide a large amount of diversity. We perform a wide range of
experiments on a benchmark set containing instances from application areas such
VLSI, SAT solving, social networks, and scientific computing. Compared to the
state-of-the-art hypergraph partitioning tools hMetis, PaToH, and KaHyPar, our
new algorithm computes the best result on almost all instances
An overview of population-based algorithms for multi-objective optimisation
In this work we present an overview of the most prominent population-based algorithms and the methodologies used to extend them to multiple objective problems. Although not exact in the mathematical sense, it has long been recognised that population-based multi-objective optimisation techniques for real-world applications are immensely valuable and versatile. These techniques are usually employed when exact optimisation methods are not easily applicable or simply when, due to sheer complexity, such techniques could potentially be very costly. Another advantage is that since a population of decision vectors is considered in each generation these algorithms are implicitly parallelisable and can generate an approximation of the entire Pareto front at each iteration. A critique of their capabilities is also provided
Comparision of the walk techniques for fitness state space analysis in vehicle routing problem
The Vehicle Routing Problem (VRP) is a highly researched discrete optimization task. The first article dealing with this problem was published by Dantzig and Ramster in 1959 under the name Truck Dispatching Problem. Since then, several versions of VRP have been developed. The task is NP difficult, it can be solved only in the foreseeable future, relying on different heuristic algorithms. The geometrical property of the state space influences the efficiency of the optimization method. In this paper, we present an analysis of the following state space methods: adaptive, reverse adaptive and uphill-downhill walk. In our paper, the efficiency of four operators are analysed on a complex Vehicle Routing Problem. These operators are the 2-opt, Partially Matched Crossover, Cycle Crossover and Order Crossover. Based on the test results, the 2-opt and Partially Matched Crossover are superior to the other two methods
Evolutionary computation applied to combinatorial optimisation problems
This thesis addresses the issues associated with conventional genetic algorithms (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the validity constraints for constrained optimisation problems. The problem selected is the travelling salesman problem (TSP), a well known NP-hard problem.
Following a review of conventional genetic algorithms, this thesis advocates the use of a repair technique for genetic algorithms: GeneRepair. We evaluate the effectiveness of this operator against a wide range of benchmark problems and compare these results with conventional genetic algorithm approaches. A comparison between GeneRepair and the conventional GA approaches is made in two forms: firstly a handcrafted approach compares GAs without repair against those using GeneRepair. A second automated approach is then presented. This meta-genetic algorithm examines different configurations of operators and parameters. Through the use of a cost/benefit (Quality-Time Tradeoff) function, the user can balance the computational effort against the quality of the solution and thus allow the user to specify exactly what the cost benefit point should be for the search.
Results have identified the optimal configuration settings for solving selected TSP problems. These results show that GeneRepair when used consistently generates very good TSP solutions for 50, 70 and 100 city problems. GeneRepair assists in finding TSP solutions in an extremely efficient manner, in both time and number of evaluations required
Artificial intelligence based design optimization for improving diversity in wireless links.
Masters Degree. University of KwaZulu-Natal, Durban.Abstract available in PDF
Biogeography-Based Optimization for Combinatorial Problems and Complex Systems
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, a mathematical BBO model is built to theoretically prove why BBO is capable of reaching the global optimum for any problem. In the second problem addressed by the dissertation, BBO is applied to combinatorial problems. Our research includes the study of migration, local search, population initialization, and greedy methods for combinatorial problems. We conduct a series of simulations based on four benchmarks, the sizes of which vary from small to extra large. The simulation results indicate that when combined with other techniques, the performance of BBO can be significantly improved. Also, a BBO graphical user interface (GUI) is created for combinatorial problems, which is an intuitive way to experiment with BBO algorithms, including hybrid BBO algorithms. The third and final problem addressed in this dissertation is the optimization of complex systems. We invent a new algorithm for complex system optimization based on BBO, which is called BBO/complex. Four real world problems are used to test BBO/Complex and compare with other complex system optimization algorithms, and we obtain encouraging results from BBO/Complex. Then, a Markov model is created for BBO/Complex. Simulation results are provided to confirm the mode
Recommended from our members
Project schedule optimisation utilising genetic algorithms
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis extends the body of research into the application of Genetic Algorithms to the Project Scheduling Problem (PSP). A thorough literature review is conducted in this area as well as in the application of other similar meta-heuristics. The review extends previous similar reviews to include PSP utilizing the Design Structure Matrix (DSM), as well as incorporating recent developments.
There is a need within industry for optimisation algorithms that can assist in the identification of optimal schedules when presented with a network that can present a number of possible alternatives. The optimisation requirement may be subtle only performing slight resource levelling or more profound by selecting an optimal mode of execution for a number of activities or evaluating a number of alternative strategies.
This research proposes a unique, efficient algorithm using adaptation based on the fitness improvement over successive generations. The algorithm is tested initially using a MATLAB based implementation to solve instances of the travelling salesman problem (TSP). The algorithm is then further developed both within MATLAB and Microsoft Project Visual Basic to optimise both known versions of the Resource Constrained Project Scheduling Problems as well as investigating newly defined variants of the problem class
Dynamic Scheduling for Maintenance Tasks Allocation supported by Genetic Algorithms
Since the first factories were created, man has always tried to maximize its production and, consequently, his profits. However, the market demands have changed and nowadays is not so easy to get the maximum yield of it. The production lines are becoming more flexible and dynamic and the amount of information going through the factory is growing more and more. This leads to a scenario where errors in the production scheduling may occur often.
Several approaches have been used over the time to plan and schedule the shop-floor’s production. However, some of them do not consider some factors present in real environments, such as the fact that the machines are not available all the time and need maintenance sometimes. This increases the complexity of the system and makes it harder to allocate the tasks competently. So, more dynamic approaches should be used to explore the large search spaces more efficiently.
In this work is proposed an architecture and respective implementation to get a schedule including both production and maintenance tasks, which are often ignored on the related works. It considers the maintenance shifts available.
The proposed architecture was implemented using genetic algorithms, which already proved to be good solving combinatorial problems such as the Job-Shop Scheduling problem. The architecture considers the precedence order between the tasks of a same product and the maintenance shifts available on the factory.
The architecture was tested on a simulated environment to check the algorithm behavior. However, it was used a real data set of production tasks and working stations
- …