Full text not available from this repository.

Abstract

This study is the second using real-coded representation for problems usually solved with a discrete coding. The adaptive generative representation is able to adapt itself on the fly to prior parts of the construction of an object as it assembles it. In the initial study the ability of the representation to take user supplied or problem supplied biases that change its behavior was demonstrated but not explored. In this study the bias is used to change the way evolution explores a fitness landscape for both an RFID antenna design problem and small instances of the traveling salesman problem. Addition of a bias to two different generative representations promotes the evolution of longer antenna designs (a heuristic objective associated with good antennas) while leading the algorithm to generate designs with distinctive shape characteristics. For the traveling salesman, a simple inverse-distance bias for the adaptive generative representation causes a large improvement in performance over a random key representation in 99 of 100 instances studied.

Item Type:	Conference Publication
Authors/Creators:	Montgomery, J and Ashlock, D
Keywords:	solution representation, combinatorial optimisation, self-avoiding walk, RFID antenna design, travelling salesman problem
Journal or Publication Title:	Proceedings of the 2017 IEEE Congress on Evolutionary Computation
Publisher:	IEEE Congress on Evolutionary Computation
DOI / ID Number:	https://doi.org/10.1109/CEC.2017.7969427
Copyright Information:	Copyright 2017 IEEE
Related URLs:	Google Scholar: Montgomery, J UTAS Profile: Montgomery, J
Item Statistics:	View statistics for this item

Actions (login required)

Item Control Page