Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings

While evolutionary algorithms are known to be very successful for a broad range of applications, the algorithm designer is often left with many algorithmic choices, for example, the size of the population, the mutation rates, and the crossover rates of the algorithm. These parameters are known to have a crucial influence on the optimization time, and thus need to be chosen carefully, a task that often requires substantial efforts. Moreover, the optimal parameters can change during the optimization process. It is therefore of great interest to design mechanisms that dynamically choose best-possible parameters. An example for such an update mechanism is the one-fifth success rule for step-size adaption in evolutionary strategies. While in continuous domains this principle is well understood also from a mathematical point of view, no comparable theory is available for problems in discrete domains. In this work we show that the one-fifth success rule can be effective also in discrete settings. We regard the $(1+(\lambda,\lambda))$~GA proposed in [Doerr/Doerr/Ebel: From black-box complexity to designing new genetic algorithms, TCS 2015]. We prove that if its population size is chosen according to the one-fifth success rule then the expected optimization time on \textsc{OneMax} is linear. This is better than what \emph{any} static population size $\lambda$ can achieve and is asymptotically optimal also among all adaptive parameter choices.Comment: This is the full version of a paper that is to appear at GECCO 201

OneMax in Black-Box Models with Several Restrictions

Black-box complexity studies lower bounds for the efficiency of general-purpose black-box optimization algorithms such as evolutionary algorithms and other search heuristics. Different models exist, each one being designed to analyze a different aspect of typical heuristics such as the memory size or the variation operators in use. While most of the previous works focus on one particular such aspect, we consider in this work how the combination of several algorithmic restrictions influence the black-box complexity. Our testbed are so-called OneMax functions, a classical set of test functions that is intimately related to classic coin-weighing problems and to the board game Mastermind. We analyze in particular the combined memory-restricted ranking-based black-box complexity of OneMax for different memory sizes. While its isolated memory-restricted as well as its ranking-based black-box complexity for bit strings of length $n$ is only of order $n/\log n$, the combined model does not allow for algorithms being faster than linear in $n$, as can be seen by standard information-theoretic considerations. We show that this linear bound is indeed asymptotically tight. Similar results are obtained for other memory- and offspring-sizes. Our results also apply to the (Monte Carlo) complexity of OneMax in the recently introduced elitist model, in which only the best-so-far solution can be kept in the memory. Finally, we also provide improved lower bounds for the complexity of OneMax in the regarded models. Our result enlivens the quest for natural evolutionary algorithms optimizing OneMax in $o(n \log n)$ iterations.Comment: This is the full version of a paper accepted to GECCO 201

Penguasaan kemahiran generik di kalangan graduan hospitaliti di politeknik : satu kajian berkenaan keperluan industri perhotelan, persepsi pensyarah dan pelajar

Kajian yang dijalankan ini bertujuan untuk mengenal pasti kepentingan kemahiran generik mengikut keperluan industri perhotelan di Malaysia dengan persepsi pensyarah dan persepsi pelajar Jabatan Hospitaliti. Oleh kerana matlamat kurikulum pendidikan kini adalah untuk melahirkan graduan yang dapat memenuhi keperluan pihak industri, maka kajian ini dijalankan untuk menilai hubungan di antara keperluan industri perhotelan di Malaysia dengan persepsi pensyarah dan pelajar Jabatan Hospitaliti di Politeknik. Terdapat 13 kemahiran generik yang diperolehi daripada Kementerian Pelajaran dan Latihan Ontario (1997) dijadikan sebagai skop kepada instrumen kajian. Responden kajian terdiri daripada tiga pihak utama iaitu industri perhotelan di Malaysia yang melibatkan 40 buah hotel yang diwakili oleh MAH Chapter dan jawatankuasa dalam Malaysian Associated of Hotel (MAH), pensyarah Unit Hotel dan Katering dan pelajar semester akhir Diploma Hotel dan Katering di Politeknik Johor Bahru, Johor dan Politeknik Merlimau, Melaka. Kajian rintis yang dijalankan menunjukkan nilai Alpha Cronbach pada 0.8781. Data yang diperolehi dianalisis secara deskriptif dan inferensi dengan menggunakan perisian Statistical Package for Social Science (SPSS) versi 11.5. Melalui dapatan kajian, satu senarai berkenaan kemahiran generik yang diperlukan oleh industri perhotelan telah dapat dihasilkan. Selain itu, senarai kemahiran generik menurut persepsi pensyarah dan juga persepsi pelajar turut dihasilkan. Hasil statistik dan graf garis yang diperolehi menunjukkan terdapat perbezaan di antara kemahiran generik yang diperlukan oleh industri perhotelan di Malaysia dengan kemahiran generik menurut persepsi pensyarah dan persepsi pelajar Politeknik. Dapatan analisis menggunakan korelasi Pearson mendapati bahawa tidak terdapat perhubungan yang signifikan di antara kemahiran generik yang diperlukan oleh industri perhotelan dengan persepsi pensyarah dan persepsi pelajar. Namun begitu, terdapat hubungan yang signifikan di antara persepsi pensyarah dengan persepsi pelajar berkenaan dengan amalan kemahiran generik di Politeknik

A Hybrid Differential Evolution Approach to Designing Deep Convolutional Neural Networks for Image Classification

Convolutional Neural Networks (CNNs) have demonstrated their superiority in image classification, and evolutionary computation (EC) methods have recently been surging to automatically design the architectures of CNNs to save the tedious work of manually designing CNNs. In this paper, a new hybrid differential evolution (DE) algorithm with a newly added crossover operator is proposed to evolve the architectures of CNNs of any lengths, which is named DECNN. There are three new ideas in the proposed DECNN method. Firstly, an existing effective encoding scheme is refined to cater for variable-length CNN architectures; Secondly, the new mutation and crossover operators are developed for variable-length DE to optimise the hyperparameters of CNNs; Finally, the new second crossover is introduced to evolve the depth of the CNN architectures. The proposed algorithm is tested on six widely-used benchmark datasets and the results are compared to 12 state-of-the-art methods, which shows the proposed method is vigorously competitive to the state-of-the-art algorithms. Furthermore, the proposed method is also compared with a method using particle swarm optimisation with a similar encoding strategy named IPPSO, and the proposed DECNN outperforms IPPSO in terms of the accuracy.Comment: Accepted by The Australasian Joint Conference on Artificial Intelligence 201

Computational tasks in robotics and factory automation

The design of Manufacturing Planning and Control Systems (MPCSs) — systems that negotiate with Customers and Suppliers to exchange products in return for money in order to generate profit, is discussed.\ud \ud The computational task of MPCS components are systematically specified as a starting point for the development of computational engines, as computer systems and programs, that execute the specified computation. Key issues are the overwhelming complexity and frequently changing application of MPCSs

Real Coded Genetic Algorithm with Enhanced Abilities for Adaptation Applied to Optimisation of MIMO Systems

This article presents an investigation of real coded Genetic Algorithm Blend Crossover Alpha modification, with enhanced ability for adaptation, applied to minimisation of transmit power in multiple-input multiple-output (MIMO) systems beamforming. The goal is to formulate transmit power minimisation task as a black box software object and evaluate an alternative to currently existing methods for optimisation of transmit energy in multicast system constrained by signal to noise ratio. The novelty of this adaptive methodology for determination of minimal power level within certain Quality of Service criteria is that it guarantees satisfaction of the constraint and 100% feasibility of achieved solutions. In addition this methodology excludes retuning algorithms parameters by using black box model for the problem definition. Experiments are conducted for identification of weight vectors assigned for signal strength and direction. Achieved experimental results are presented and analysed