Learn More
Ant colony optimisation is a relatively new meta-heuristic search technique for solving optimisation problems. To date, much research has concentrated on solving standard benchmark problems such as the travelling salesman problem, quadratic assignment problem and the job sequencing problem. In this paper, we investigate the application of ant colony(More)
This note considers possible arrangements of the sectors of a generalised dartboard. The sum of the pth powers of the absolute differences of the numbers on adjacent sectors is introduced as a penalty cost function and a string reversal algorithm is used to determine all arrangements that maximise the penalty, for any p ≥ 1. The maximum value of the penalty(More)
This paper considers bifurcation at the principal eigenvalue of a class of gradient operators which possess the Palais-Smale condition. The existence of the bifurcation branch and the asymptotic nature of the bifurcation is verified by using the compactness in the Palais Smale condition and the order of the nonlinearity in the operator. The main result is(More)