Research Repository

The plant propagation algorithm for discrete optimisation: The case of the travelling salesman problem

Selamoğlu, B and Salhi, A (2016) 'The plant propagation algorithm for discrete optimisation: The case of the travelling salesman problem.' In: UNSPECIFIED, (ed.) Studies in Computational Intelligence. UNSPECIFIED, 43 - 61.

Full text not available from this repository.

Abstract

© Springer International Publishing Switzerland 2016. The Plant Propagation algorithm (PPA), has been demonstrated to work well on continuous optimization problems. In this paper, we investigate its use in discrete optimization and particularly on the well known Travelling Salesman Problem (TSP). This investigation concerns the implementation of the idea of short and long runners when searching for Hamiltonian cycles in complete graphs. The approach uses the notion of k-optimality. The performance of the algorithm on a standard list of test problems is compared to that of the Genetic Algorithm (GA), Simulated Annealing (SA), Particle Swarm Optimization (PSO) and the New Discrete Firefly Algorithm (New DFA). Computational results are included.

Item Type: Book Section
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Jim Jamieson
Date Deposited: 20 Nov 2016 14:29
Last Modified: 30 Jan 2019 16:20
URI: http://repository.essex.ac.uk/id/eprint/18123

Actions (login required)

View Item View Item