Optimal advertising campaign generation for multiple brands using MOGA

The paper proposes a new modified multiobjective genetic algorithm (MOGA) for the problem of optimal television (TV) advertising campaign generation for multiple brands. This NP-hard combinatorial optimization problem with numerous constraints is one of the key issues for an advertising agency when producing the optimal TV mediaplan. The classical approach to the solution of this problem is the greedy heuristic, which relies on the strength of the preceding commercial breaks when selecting the next break to add to the campaign. While the greedy heuristic is capable of generating only a group of solutions that are closely related in the objective space, the proposed modified MOGA produces a Pareto-optimal set of chromosomes that: 1) outperform the greedy heuristic and 2) let the mediaplanner choose from a variety of uniformly distributed tradeoff solutions. To achieve these results, the special problem-specific solution encoding, genetic operators, and original local optimization routine were developed for the algorithm. These techniques allow the algorithm to manipulate with only feasible individuals, thus, significantly improving its performance that is complicated by the problem constraints. The efficiency of the developed optimization method is verified using the real data sets from the Canadian advertising industry

Multiobjective Simulation Optimization Using Enhanced Evolutionary Algorithm Approaches

In today\u27s competitive business environment, a firm\u27s ability to make the correct, critical decisions can be translated into a great competitive advantage. Most of these critical real-world decisions involve the optimization not only of multiple objectives simultaneously, but also conflicting objectives, where improving one objective may degrade the performance of one or more of the other objectives. Traditional approaches for solving multiobjective optimization problems typically try to scalarize the multiple objectives into a single objective. This transforms the original multiple optimization problem formulation into a single objective optimization problem with a single solution. However, the drawbacks to these traditional approaches have motivated researchers and practitioners to seek alternative techniques that yield a set of Pareto optimal solutions rather than only a single solution. The problem becomes much more complicated in stochastic environments when the objectives take on uncertain (or noisy ) values due to random influences within the system being optimized, which is the case in real-world environments. Moreover, in stochastic environments, a solution approach should be sufficiently robust and/or capable of handling the uncertainty of the objective values. This makes the development of effective solution techniques that generate Pareto optimal solutions within these problem environments even more challenging than in their deterministic counterparts. Furthermore, many real-world problems involve complicated, black-box objective functions making a large number of solution evaluations computationally- and/or financially-prohibitive. This is often the case when complex computer simulation models are used to repeatedly evaluate possible solutions in search of the best solution (or set of solutions). Therefore, multiobjective optimization approaches capable of rapidly finding a diverse set of Pareto optimal solutions would be greatly beneficial. This research proposes two new multiobjective evolutionary algorithms (MOEAs), called fast Pareto genetic algorithm (FPGA) and stochastic Pareto genetic algorithm (SPGA), for optimization problems with multiple deterministic objectives and stochastic objectives, respectively. New search operators are introduced and employed to enhance the algorithms\u27 performance in terms of converging fast to the true Pareto optimal frontier while maintaining a diverse set of nondominated solutions along the Pareto optimal front. New concepts of solution dominance are defined for better discrimination among competing solutions in stochastic environments. SPGA uses a solution ranking strategy based on these new concepts. Computational results for a suite of published test problems indicate that both FPGA and SPGA are promising approaches. The results show that both FPGA and SPGA outperform the improved nondominated sorting genetic algorithm (NSGA-II), widely-considered benchmark in the MOEA research community, in terms of fast convergence to the true Pareto optimal frontier and diversity among the solutions along the front. The results also show that FPGA and SPGA require far fewer solution evaluations than NSGA-II, which is crucial in computationally-expensive simulation modeling applications

Engineering design using genetic algorithms

As modern computational and modeling technologies grow, engineering design heavily relies on computer modeling and simulation to accelerate design cycles and save cost. A complex design problem will involve many design parameters and tables. Exploring design space and finding optimal solutions are still major challenges for complex systems. This dissertation proposed to use Genetic Algorithms to optimize engineering design problems. It proposed a software infrastructure to combine engineering modeling with Genetic algorithms and covered several aspects in engineering design problems. The dissertation suggested a new Genetic Algorithm (Completely dominant Genetic algorithm) to quickly identify High Performance Areas for Engineering Design. To help design engineers to explore design space, the dissertation used a new visualization tool to demonstrate high dimensional Genetic Algorithm results in dynamical graphics. Robustness of design is critical for some of the engineering design applications due to perturbation and manufacturing tolerance. This dissertation demonstrated to use Genetic Algorithms to locate robust design areas and provided a thorough discussion on robustness and diversity in depth

Improving the resilience of post-disaster water distribution systems using a dynamic optimization framework

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Improving the resilience of water distribution systems (WDSs) to handle natural disasters (e.g., earthquakes) is a critical step towards sustainable urban water management. This requires the water utility to be able to respond quickly to such disaster events and in an organized manner, to prioritize the use of available resources to restore service rapidly whilst minimizing the negative impacts. Many methods have been developed to evaluate the WDS resilience, but few efforts are made so far to improve resilience of a post-disaster WDS through identifying optimal sequencing of recovery actions. To address this gap, a new dynamic optimization framework is proposed here where the resilience of a post-disaster WDS is evaluated using six different metrics. A tailored Genetic Algorithm is developed to solve the complex optimization problem driven by these metrics. The proposed framework is demonstrated using a real-world WDS with 6,064 pipes. Results obtained show that the proposed framework successfully identifies near-optimal sequencing of recovery actions for this complex WDS. The gained insights, conditional on the specific attributes of the case study, include: (i) the near-optimal sequencing of recovery strategy heavily depends on the damage properties of the WDS, (ii) replacements of damaged elements tend to be scheduled at the intermediate-late stages of the recovery process due to their long operation time, and (iii) interventions to damaged pipe elements near critical facilities (e.g., hospitals) should not be necessarily the first priority to recover due to complex hydraulic interactions within the WDS

Genetic learning particle swarm optimization

Social learning in particle swarm optimization (PSO) helps collective efficiency, whereas individual reproduction in genetic algorithm (GA) facilitates global effectiveness. This observation recently leads to hybridizing PSO with GA for performance enhancement. However, existing work uses a mechanistic parallel superposition and research has shown that construction of superior exemplars in PSO is more effective. Hence, this paper first develops a new framework so as to organically hybridize PSO with another optimization technique for “learning.” This leads to a generalized “learning PSO” paradigm, the *L-PSO. The paradigm is composed of two cascading layers, the first for exemplar generation and the second for particle updates as per a normal PSO algorithm. Using genetic evolution to breed promising exemplars for PSO, a specific novel *L-PSO algorithm is proposed in the paper, termed genetic learning PSO (GL-PSO). In particular, genetic operators are used to generate exemplars from which particles learn and, in turn, historical search information of particles provides guidance to the evolution of the exemplars. By performing crossover, mutation, and selection on the historical information of particles, the constructed exemplars are not only well diversified, but also high qualified. Under such guidance, the global search ability and search efficiency of PSO are both enhanced. The proposed GL-PSO is tested on 42 benchmark functions widely adopted in the literature. Experimental results verify the effectiveness, efficiency, robustness, and scalability of the GL-PSO

Linear Array Thinning with Cavity backed U-slot Patch Antenna using Genetic Algorithm

In this paper, a thinned linear array with Cavity backed U-slot Patch has been investigated using the Genetic Algorithm to minimize peak sidelobe level and the number of antenna elements. One of the essential steps in the Genetic Algorithm method is a crossover, which uses the Paired Top Ten and Combined Top Five rules applied to the Cavity backed U-slot Patch antenna. The peak sidelobe level value is -18.63 dB with a array filling of 63.33% at the broadside angle using Combined Top Five rules. In Paired Top Ten, the peak sidelobe level value is -19.48 dB with a array filling of 70%. The two methods are still better as compared to a dense array. This study is essential in the development of radar technologies since it needs a low sidelobe level

Genetic Algorithm and its Variants: Theory and Applications

The Genetic Algorithm is a popular optimization technique which is bio-inspired and is based on the concepts of natural genetics and natural selection theories proposed by Charles Darwin. The Algorithm functions on three basic genetic operators of selection, crossover and mutation. Based on the types of these operators GA has many variants like Real coded GA, Binary coded GA, Sawtooth GA, Micro GA, Improved GA, Differential Evolution GA. This paper discusses a few of the forms of GA and applies the techniques to the problem of Function optimization and System Identification. The paper makes a comparative analysis of the advantages and disadvantages of the different types of GA. The computer simulations illustrate the results. It also makes a comparison between the GA technique and Incremental LMS algorithm for System Identification