38 research outputs found

    Towards a unified method to synthesising scenarios and solvers in combinatorial optimisation via graph-based approaches

    Get PDF
    Hyper-heuristics is a collection of search methods for selecting, combining and generating heuristics used to solve combinatorial optimisation problems. The primary objective of hyper-heuristics research is to develop more generally applicable search procedures that can be easily applied to a wide variety of problems. However, current hyper-heuristic architectures assume the existence of a domain barrier that does not allow low-level heuristics or operators to be applied outside their designed problem domain. Additionally the representation used to encode solvers differs from the one used to encode solutions. This means that hyper-heuristic internal components can not be optimised by the system itself. In this thesis we address these issues by using graph reformulations of selected problems and search in the space of operators by using Grammatical Evolution techniques to evolve new perturbative and constructive heuristics. The low-level heuristics (representing graph transformations) are evolved using a single grammar which is capable of adapting to multiple domains. We test our generators of heuristics on instances of the Travelling Salesman Problem, Knapsack Problem and Load Balancing Problem and show that the best evolved heuristics can compete with human written heuristics and representations designed for each problem domain. Further we propose a conceptual framework for the production and combination of graph structures. We show how these concepts can be used to describe and provide a representation for problems in combinatorics and the inner mechanics of hyper-heuristic systems. The final contribution is a new benchmark that can generate problem instances for multiple problem domains that can be used for the assessment of multi-domain problem solvers

    A generation perturbative hyper-heuristic for combinatorial optimization problems

    Get PDF
    Dissertation (MSc (Computer Science))--University of Pretoria, 2020.Perturbative heuristics or move operators are problem dependent operators commonly used by search techniques to solve computationally hard problems such as combinatorial optimization problems. These operators are generally derived manually by problem domain experts but this process is extremely challenging and time consuming. Hence, some initiatives aimed at automating the derivation process using search methodologies such as hyper-heuristics have been proposed in recent years. However, most of the proposed hyper-heuristic approaches generate new perturbative heuristics by recombining already existing and human-derived perturbative heuristics or components with various move acceptance criteria instead of generating the heuristics from scratch. As a result, these approaches cannot be easily applied to other problem domains where the human-derived heuristics are not available. In addition, the few hyper-heuristic approaches that have been proposed to generate perturbative heuristics from scratch are either designed for a single problem domain or applicable only to specific types of problems such as those that can be represented as graphs. The research presented in this dissertation addresses these issues by proposing a novel approach that can be used to automatically generate perturbative heuristics for any combinatorial optimization problem. In the proposed approach, perturbative heuristics are defined in terms of a set of basic operations (e.g. move and swap) and components of the solution (e.g. exam, period and room for the examination timetabling problem). Grammatical evolution, a well-known Evolutionary Algorithm, is used to combine the basic operations and components of the solution into perturbative heuristics. The generality of the proposed approach is tested by applying it to benchmark sets from three different problem domains, namely examination timetabling, vehicle routing and Boolean satisfiability. In addition, the performance of the perturbative heuristics generated by the proposed approach on the benchmark sets is compared to that of the commonly-used human-derived perturbative heuristics as well as the perturbative heuristics generated by other hyper-heuristic approaches in the literature. The experimental results show that the perturbative heuristics evolved by the proposed approach, specifically the grammatical evolution extended approach, outperformed the human-derived perturbative heuristics on all benchmark sets from the three problem domains. When compared to existing hyper-heuristic approaches, the proposed approach obtained solutions that were superior to those obtained by most hyper-heuristic approaches on the examination timetabling problem and only slightly inferior to those obtained by the best performing hyper-heuristic approaches on the vehicle routing and Boolean satisfiability problems. This performance of the proposed approach can be attributed to the fact that the generated perturbative heuristics were applied as is with no optimization as is commonly done with most hyper-heuristic approaches. Overall, the experimental results demonstrated success in developing an approach that can be used to automatically generate perturbative heuristics from scratch. Future work will consider incorporating optimization techniques during problem solving as well as performing a fitness landscape analysis in order to further improve the quality of solutions and have a better understanding of the proposed approach.SELF/ NRF MastersComputer ScienceMSc (Computer Science)Unrestricte

    Novel Hyper-heuristics Applied to the Domain of Bin Packing

    Get PDF
    Principal to the ideology behind hyper-heuristic research is the desire to increase the level of generality of heuristic procedures so that they can be easily applied to a wide variety of problems to produce solutions of adequate quality within practical timescales.This thesis examines hyper-heuristics within a single problem domain, that of Bin Packing where the benefits to be gained from selecting or generating heuristics for large problem sets with widely differing characteristics is considered. Novel implementations of both selective and generative hyper-heuristics are proposed. The former approach attempts to map the characteristics of a problem to the heuristic that best solves it while the latter uses Genetic Programming techniques to automate the heuristic design process. Results obtained using the selective approach show that solution quality was improved significantly when contrasted to the performance of the best single heuristic when applied to large sets of diverse problem instances. Although enforcing the benefits to be gained by selecting from a range of heuristics the study also highlighted the lack of diversity in human designed algorithms. Using Genetic Programming techniques to automate the heuristic design process allowed both single heuristics and collectives of heuristics to be generated that were shown to perform significantly better than their human designed counterparts. The thesis concludes by combining both selective and generative hyper-heuristic approaches into a novel immune inspired system where heuristics that cover distinct areas of the problem space are generated. The system is shown to have a number of advantages over similar cooperative approaches in terms of its plasticity, efficiency and long term memory. Extensive testing of all of the hyper-heuristics developed on large sets of both benchmark and newly generated problem instances enforces the utility of hyper-heuristics in their goal of producing fast understandable procedures that give good quality solutions for a range of problems with widely varying characteristics

    A study of evoluntionary perturbative hyper-heuristics for the nurse rostering problem.

    Get PDF
    Master of Science in Computer Science. University of KwaZulu-Natal, Pietermaritzburg 2017.Hyper-heuristics are an emerging field of study for combinatorial optimization. The aim of a hyper-heuristic is to produce good results across a set of problems rather than producing the best results. There has been little investigation of hyper-heuristics for the nurse rostering problem. The majority of hyper-heuristics for the nurse rostering problem fit into a single type of hyper-heuristic, the selection perturbative hyper-heuristic. There is no work in using evolutionary algorithms employed as selection perturbative hyper-heuristics for the nurse rostering problem. There is also no work in using the generative perturbative type of hyper-heuristic for the nurse rostering problem. The first objective of this dissertation is to investigate the selection perturbative hyper-heuristic for the nurse rostering problem and the effectiveness of employing an evolutionary algorithm (SPHH). The second objective is to investigate a generative perturbative hyper-heuristic to evolve perturbation heuristics for the nurse rostering problem using genetic programming (GPHH). The third objective is to compare the performance of SPHH and GPHH. SPHH and GPHH were evaluated using the INRC2010 benchmark data set and the results obtained were compared to available results from literature. The INRC2010 benchmark set is comprised of sprint, medium and long instance types. SPHH and GPHH produced good results for the INRC2010 benchmark data set. GPHH and SPHH were found to have different strengths and weaknesses. SPHH found better results than GPHH for the medium instances. GPHH found better results than SPHH for the long instances. SPHH produced better average results. GPHH produced results that were closer to the best known results. These results suggest future research should investigate combining SPHH and GPHH to benefit from the strengths of both perturbative hyper-heuristics

    Search-Based Temporal Testing of Multicore Applications

    Get PDF
    Multicore systems are increasingly common as a modern computing platform. Multicore processors not only offer better performance-to-cost ratios relative to single-core processors but also have significantly minimised space, weight, and power (SWaP) constraints. Unfortunately, they introduce challenges in verification as their shared components are potential channels for interference. The potential for interference increases the possibility of concurrency faults at runtime and consequently increases the difficulty of verifying. In this thesis, search-based techniques are empirically investigated to determine their effectiveness in temporal testing—searching for test inputs that may lead a task running on an embedded multicore to produce extreme (here longest) execution times, which might cause the system to violate its temporal requirements. Overall, the findings suggest that various forms of search-based approaches are effective in generating test inputs exhibiting extreme execution times on the embedded multicore environment. All previous work in temporal testing has evolved test data directly; this is not essential. In this thesis, one novel proposed approach, i.e. the use of search to discover high performing biased random sampling regimes (which we call 'dependent input sampling strategies'), has proved particularly effective. Shifting the target of search from test data itself to strategies proves particularly well motivated for attaining extreme execution times. Finally, we present also preliminary results on the use of so-called 'hyper-heuristics', which can be used to form optimal hybrids of optimisation techniques. An extensive comparison of direct approaches to establishing a baseline is followed by reports of research into indirect approaches and hyper-heuristics. The shift to strategies from direct data can be thought of as a leap in abstraction level for the underlying temporal test data generation problem. The shift to hyper-heuristics aims to boost the level of optimisation technique abstraction. The former is more fully worked out than the latter and has proved a significant success. For the latter only preliminary results are available; as will be seen from this work as the whole computational requirements for research experimentation are significant

    A Framework for Hyper-Heuristic Optimisation of Conceptual Aircraft Structural Designs

    Get PDF
    Conceptual aircraft structural design concerns the generation of an airframe that will provide sufficient strength under the loads encountered during the operation of the aircraft. In providing such strength, the airframe greatly contributes to the mass of the vehicle, where an excessively heavy design can penalise the performance and cost of the aircraft. Structural mass optimisation aims to minimise the airframe weight whilst maintaining adequate resistance to load. The traditional approach to such optimisation applies a single optimisation technique within a static process, which prevents adaptation of the optimisation process to react to changes in the problem. Hyper-heuristic optimisation is an evolving field of research wherein the optimisation process is evaluated and modified in an attempt to improve its performance, and thus the quality of solutions generated. Due to its relative infancy, hyper-heuristics have not been applied to the problem of aircraft structural design optimisation. It is the thesis of this research that hyper-heuristics can be employed within a framework to improve the quality of airframe designs generated without incurring additional computational cost. A framework has been developed to perform hyper-heuristic structural optimisation of a conceptual aircraft design. Four aspects of hyper-heuristics are included within the framework to promote improved process performance and subsequent solution quality. These aspects select multiple optimisation techniques to apply to the problem, analyse the solution space neighbouring good designs and adapt the process based on its performance. The framework has been evaluated through its implementation as a purpose-built computational tool called AStrO. The results of this evaluation have shown that significantly lighter airframe designs can be generated using hyper-heuristics than are obtainable by traditional optimisation approaches. Moreover, this is possible without penalising airframe strength or necessarily increasing computational costs. Furthermore, improvements are possible over the existing aircraft designs currently in production and operation

    Co-evolutionary Hybrid Bi-level Optimization

    Get PDF
    Multi-level optimization stems from the need to tackle complex problems involving multiple decision makers. Two-level optimization, referred as ``Bi-level optimization'', occurs when two decision makers only control part of the decision variables but impact each other (e.g., objective value, feasibility). Bi-level problems are sequential by nature and can be represented as nested optimization problems in which one problem (the ``upper-level'') is constrained by another one (the ``lower-level''). The nested structure is a real obstacle that can be highly time consuming when the lower-level is NP−hard\mathcal{NP}-hard. Consequently, classical nested optimization should be avoided. Some surrogate-based approaches have been proposed to approximate the lower-level objective value function (or variables) to reduce the number of times the lower-level is globally optimized. Unfortunately, such a methodology is not applicable for large-scale and combinatorial bi-level problems. After a deep study of theoretical properties and a survey of the existing applications being bi-level by nature, problems which can benefit from a bi-level reformulation are investigated. A first contribution of this work has been to propose a novel bi-level clustering approach. Extending the well-know ``uncapacitated k-median problem'', it has been shown that clustering can be easily modeled as a two-level optimization problem using decomposition techniques. The resulting two-level problem is then turned into a bi-level problem offering the possibility to combine distance metrics in a hierarchical manner. The novel bi-level clustering problem has a very interesting property that enable us to tackle it with classical nested approaches. Indeed, its lower-level problem can be solved in polynomial time. In cooperation with the Luxembourg Centre for Systems Biomedicine (LCSB), this new clustering model has been applied on real datasets such as disease maps (e.g. Parkinson, Alzheimer). Using a novel hybrid and parallel genetic algorithm as optimization approach, the results obtained after a campaign of experiments have the ability to produce new knowledge compared to classical clustering techniques combining distance metrics in a classical manner. The previous bi-level clustering model has the advantage that the lower-level can be solved in polynomial time although the global problem is by definition NP\mathcal{NP}-hard. Therefore, next investigations have been undertaken to tackle more general bi-level problems in which the lower-level problem does not present any specific advantageous properties. Since the lower-level problem can be very expensive to solve, the focus has been turned to surrogate-based approaches and hyper-parameter optimization techniques with the aim of approximating the lower-level problem and reduce the number of global lower-level optimizations. Adapting the well-know bayesian optimization algorithm to solve general bi-level problems, the expensive lower-level optimizations have been dramatically reduced while obtaining very accurate solutions. The resulting solutions and the number of spared lower-level optimizations have been compared to the bi-level evolutionary algorithm based on quadratic approximations (BLEAQ) results after a campaign of experiments on official bi-level benchmarks. Although both approaches are very accurate, the bi-level bayesian version required less lower-level objective function calls. Surrogate-based approaches are restricted to small-scale and continuous bi-level problems although many real applications are combinatorial by nature. As for continuous problems, a study has been performed to apply some machine learning strategies. Instead of approximating the lower-level solution value, new approximation algorithms for the discrete/combinatorial case have been designed. Using the principle employed in GP hyper-heuristics, heuristics are trained in order to tackle efficiently the NP−hard\mathcal{NP}-hard lower-level of bi-level problems. This automatic generation of heuristics permits to break the nested structure into two separated phases: \emph{training lower-level heuristics} and \emph{solving the upper-level problem with the new heuristics}. At this occasion, a second modeling contribution has been introduced through a novel large-scale and mixed-integer bi-level problem dealing with pricing in the cloud, i.e., the Bi-level Cloud Pricing Optimization Problem (BCPOP). After a series of experiments that consisted in training heuristics on various lower-level instances of the BCPOP and using them to tackle the bi-level problem itself, the obtained results are compared to the ``cooperative coevolutionary algorithm for bi-level optimization'' (COBRA). Although training heuristics enables to \emph{break the nested structure}, a two phase optimization is still required. Therefore, the emphasis has been put on training heuristics while optimizing the upper-level problem using competitive co-evolution. Instead of adopting the classical decomposition scheme as done by COBRA which suffers from the strong epistatic links between lower-level and upper-level variables, co-evolving the solution and the mean to get to it can cope with these epistatic link issues. The ``CARBON'' algorithm developed in this thesis is a competitive and hybrid co-evolutionary algorithm designed for this purpose. In order to validate the potential of CARBON, numerical experiments have been designed and results have been compared to state-of-the-art algorithms. These results demonstrate that ``CARBON'' makes possible to address nested optimization efficiently

    Bus route design and frequency setting for public transit systems

    Get PDF
    Thesis (PhD)--Stellenbosch University, 2022.ENGLISH ABSTRACT: The availability of effective public transport systems is increasingly becoming an urgent problem in urban areas worldwide due to the traffic congestion caused by private vehicles. The careful design of such a transport system is important because, if well designed, such a system can increase the comfort of commuters and ensure that they arrive at their destinations timeously. A well-designed public transport system can also result in considerable cost savings for the operator of the system. The problem considered in this dissertation is that of designing three mathematical models for aiding a bus company in deciding upon efficient bus transit routes (facilitated by the first two models) and setting appropriate frequencies for buses along these routes (facilitated by the third model). The design criteria embedded in the first model (for designing bus routes) are the simultaneous pursuit of minimising the expected average passenger travel time and minimising the system operator’s cost (measuring the latter as the sum total of all route lengths in the system). The first model takes as input an origin-destination demand matrix for a specified set of bus stops, along with the corresponding road network structure, and returns as output a set of bus route solutions. The decision maker can then select one of these route sets subjectively, based on the desired trade-off achieved between the aforementioned transit system design criteria. This bi-objective minimisation problem is solved approximately in three distinct stages — a solution initialisation stage, an intermediate analysis stage and an iterative metaheuristic search stage during which high-quality trade-off solutions are sought. A novel procedure is introduced for the solution initialisation stage aimed at effectively generating high-quality initial feasible solutions. Two metaheuristics are adopted for the solution implementation, namely a dominance-based multi-objective simulated annealing algorithm and an improved non-dominated sorting genetic algorithm. The second model is a novel approach towards establishing high-quality bus routes resembling a reference set of bus routes (typically the currently operational bus routes) to varying degrees, providing the decision maker with bus route design alternatives that may be implemented incre mentally in order to limit the disruption experienced by passengers in the bus transit network. The objectives pursued in this model are the simultaneous minimisation of the expected aver age passenger travel time and the minimisation of a reference-route-to-design-route similarity measure. The second model takes the same input as the first model above, with the addition of a reference route set with which to compare alternative design routes in terms of similarity, and provides as output a set of trade-off solutions according to this model’s design criteria. The same three-stage approximate solution methodology described above is adopted for this model, and the same two metaheuristic implementations are utilised to solve instances of this new model. In the third model, high-quality bus frequencies are sought for each bus route in pursuit of min imising the expected average travel time for passengers (including waiting time, transfer time and travel time) and simultaneously minimising the total number of buses required by an operator to maintain the specified frequencies. The third model takes as input all the data required by the first model, along with a route set for which frequencies should be set, and returns as output a set of bus frequencies at which buses should operate along the various routes, based on a de sired trade-off between the aforementioned two design criteria. The solution approach adopted for this bi-objective minimisation problem again conforms to the three aforementioned distinct stages, with the exception that only a non-dominated sorting genetic algorithm is designed for solving it. The first and third models are finally applied to a special case study involving real data in order to showcase the practical applicability of the modelling approach.AFRIKAANSE OPSOMMING: Die beskikbaarheid van doeltreffende openbare vervoerstelsels word wˆereldwyd toenemend ’n dringende probleem in stedelike gebiede as gevolg van die verkeersopeenhopings wat deur private voertuie veroorsaak word. Die noukeurige ontwerp van so ’n vervoerstelsel is belangrik, want as dit goed ontwerp is, kan so ’n stelsel die gemak van pendelaars verhoog en verseker dat hul betyds by hul bestemmings aankom. ’n Goed-ontwerpte openbare vervoerstelsel kan ook aansienlike kostebesparings vir die stelseloperateur tot gevolg hˆe. Die probleem wat in hierdie proefskrif oorweeg word, is die ontwerp van drie wiskundige modelle om ’n busonderneming daartoe in staat te stel om besluite oor doeltreffende busvervoerroetes (die eerste twee modelle) en die geskikte frekwensies vir busse langs hierdie roetes (die derde model) te neem. Die ontwerpkriteria in die eerste model (vir die ontwerp van busroetes) is die gelyktydige strewe daarna om die verwagte gemiddelde reistyd van passasiers te minimeer en die koste van die stelseloperateur te minimeer (laasgenoemde gemeet as die somtotaal van alle roetelengtes in die stelsel). Die eerste model neem as toevoer ’n oorsprong-bestemming aan vraagmatriks vir ’n spesifieke stel bushaltes, tesame met die ooreenstemmende padnetwerkstruk tuur, en lewer as afvoer ’n versameling busroetestelle. Die besluitnemer kan dan een van hierdie roetestelle subjektief kies, gebaseer op die gewenste afruiling tussen die bogenoemde ontwerpkri teria. Hierdie twee-doelige minimeringsprobleem word in drie verskillende fases benaderd opgelos — ’n oplossingsinisialiseringsfase, ’n intermediˆere analise-fase en ’n iteratiewe metaheuristiese soekfase waartydens afruilingssoplossings van ho¨e gehalte gesoek word. ’n Nuwe prosedure word vir die oplossingsinisialiseringsfase daargestel wat daarop gemik is om aanvanklike haalbare oplossings van ho¨e gehalte op ’n doeltreffende wyse te genereer. Twee meteheuristieke word vir die oplossing van die model gebruik, naamlik ’n dominansie-gebaseerde meer-doelige ge simuleerde temeperingsalgoritme en ’n verbeterde nie-gedomineerde sorteer-genetiese algoritme. Die tweede model is ’n nuwe benadering om busroetes van ho¨e gehalte te vestig wat in verskil lende mates ooreenkomste met ’n verwysingstel busroetes (tipies die huidige stel operasionele roetes) toon, en bied die besluitnemer alternatiewe vir busroetes wat geleidelik ge¨ımplementeer kan word om die ontwrigting van passasiers in die busvervoernetwerk te beperk. Die doele wat in hierdie model nagestreef word, is die gelyktydige minimering van die verwagte gemiddelde passas ier se reistyd en die minimering van ’n verwysingsroete-na-ontwerp-roete ooreenkomsmaatstaf. Die tweede model neem dieselfde toevoere as die eerste model hierbo, met die byvoeging van ’n verwysingsroete waarmee alternatiewe ontwerproetestelle in terme van ooreenkoms vergelyk kan word, en bied as afvoer ’n stel afruilingsoplossings volgens die model se ontwerpkriteria. Die selfde drie-fase benaderde oplos-singsmetode hierbo beskryf, word op hierdie model toegepas, en dieselfde twee metaheuristiese implementerings word gebruik om gevalle van hierdie nuwe model op te los. In die derde model word busfrekwensies van ho¨e gehalte vir elke busroete gesoek om die verwagte gemiddelde reistyd van passasiers (insluitend wagtyd, oorklimtyd en werklike reistyd) te minimeer en terselfdertyd die totale aantal busse wat ’n operateur benodig, te minimeer terwyl die gespesifiseerde frekwensies gehandhaaf word. Die derde model neem dieselfde toevoerdata as die eerste model, tesame met ’n roete waarvoor frekwensies vasgestel moet word, en lewer as afvoer ’n stel busfrekwensies waarteen busse langs die verskillende roetes ontplooi moet word, gebaseer op ’n gewenste afruiling tussen die bogenoemde twee ontwerpkriteria. Die oplossingsbenadering wat op hierdie tweedoelige minimeringsprobleem toegepas word, volg weer die bogenoemde drie fases, met die uitsondering dat slegs ’n nie-gedomineerde sorteer-genetiese algoritme ontwerp word om dit op te los. Die eerste en derde modelle word uiteindelik op ’n spesiale gevallestudie toegepas wat op werklike data gebaseer is om sodoende die praktiese toepaslikheid van die modelleringsbenadering te illustreer.Doctora
    corecore