Methodology to Minimise the Abandonment of Web Page Navigation Using the Tabu Search Algorithm

Abstract

This article shows an application of the metaheuristic tabu algorithm for resolution by domains to the optimisation of navigating an online banking webpage. In this algorithm a ‘memory’ is created that stores the last moves made in the navigation which, if repeated, produce results already explored. This ‘memory’ would serve to impede the pathway to those results. The properties of this algorithm make it ideal for optimising webpage navigation by reducing waiting times and ‘noise’ (irrelevant information) in the search for information and consequently a reduction in abandonment and a better quality of navigation is achieved.