Picture of blood cells

Open Access research which pushes advances in bionanotechnology

Strathprints makes available scholarly Open Access content by researchers in the Strathclyde Institute of Pharmacy & Biomedical Sciences (SIPBS) , based within the Faculty of Science.

SIPBS is a major research centre in Scotland focusing on 'new medicines', 'better medicines' and 'better use of medicines'. This includes the exploration of nanoparticles and nanomedicines within the wider research agenda of bionanotechnology, in which the tools of nanotechnology are applied to solve biological problems. At SIPBS multidisciplinary approaches are also pursued to improve bioscience understanding of novel therapeutic targets with the aim of developing therapeutic interventions and the investigation, development and manufacture of drug substances and products.

Explore the Open Access research of SIPBS. Or explore all of Strathclyde's Open Access research...

Multi agent collaborative search based on Tchebycheff decomposition

Zuiani, Federico and Vasile, Massimiliano (2013) Multi agent collaborative search based on Tchebycheff decomposition. Computational Optimization and Applications, 56 (1). pp. 189-208. ISSN 0926-6003

[img]
Preview
PDF
macs2_r2_v0.pdf
Accepted Author Manuscript

Download (1MB)| Preview

    Abstract

    This paper presents a novel formulation of Multi Agent Collaborative Search, for multi-objective optimization, based on Tchebycheff decomposition. A population of agents combines heuristics that aim at exploring the search space both globally (social moves) and in a neighborhood of each agent (individualistic moves). In this novel formulation the selection process is based on a combination of Tchebycheff scalarization and Pareto dominance. Furthermore, while in the previous implementation, social actions were applied to the whole population of agents and individualistic actions only to an elite sub-population, in this novel formulation this mechanism is inverted. The novel agent-based algorithm is tested at first on a standard benchmark of difficult problems and then on two specific problems in space trajectory design. Its performance is compared against a number of state-of-the-art multi objective optimization algorithms. The results demonstrate that this novel agent-based search has better performance with respect to its predecessor in a number of cases and converges better than the other state-of-the-art algorithms with a better spreading of the solutions.