Skip to main content

Research Repository

Advanced Search

All Outputs (3)

The influence of search components and problem characteristics in early life cycle class modelling (2014)
Journal Article
Smith, J., & Simons, C. (2015). The influence of search components and problem characteristics in early life cycle class modelling. Journal of Systems and Software, 103, 440-451. https://doi.org/10.1016/j.jss.2014.11.034

© 2014 Elsevier Inc. All rights reserved. This paper examines the factors affecting the quality of solution found by meta-heuristic search when optimising object-oriented software class models. From the algorithmic perspective, we examine the effect... Read More about The influence of search components and problem characteristics in early life cycle class modelling.

Interactive ant colony optimization (iACO) for early lifecycle software design (2014)
Journal Article
Simons, C., Smith, J., & White, P. (2014). Interactive ant colony optimization (iACO) for early lifecycle software design. Swarm Intelligence, 8(2), 139-157. https://doi.org/10.1007/s11721-014-0094-2

Finding good designs in the early stages of the software development lifecycle is a demanding multi-objective problem that is crucial to success. Previously, both interactive and non-interactive techniques based on evolutionary algorithms (EAs) have... Read More about Interactive ant colony optimization (iACO) for early lifecycle software design.

A genetic algorithm for the one-dimensional cutting stock problem with setups (2014)
Journal Article
de Araujo, S. A., Poldi, K. C., & Smith, J. (2014). A genetic algorithm for the one-dimensional cutting stock problem with setups. Pesquisa Operacional, 34(2), 165-187. https://doi.org/10.1590/0101-7438.2014.034.02.0165

This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting patterns used. A new heuristic method based on the conce... Read More about A genetic algorithm for the one-dimensional cutting stock problem with setups.