Methodology to Minimise the Abandonment of Web Page Navigation Using the Tabu Search Algorithm
- Carmen Lozano
- Federico Fuentes
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.- Full Text: PDF
- DOI:10.5539/ass.v7n8p107
This work is licensed under a Creative Commons Attribution 4.0 License.
Journal Metrics
Index
- Academic Journals Database
- BASE (Bielefeld Academic Search Engine)
- Berkeley Library
- CNKI Scholar
- COPAC
- EBSCOhost
- EconBiz
- Elektronische Zeitschriftenbibliothek (EZB)
- Excellence in Research for Australia (ERA)
- Genamics JournalSeek
- GETIT@YALE (Yale University Library)
- Harvard Library
- IBZ Online
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MIAR
- Mir@bel
- NewJour
- OAJI
- Open J-Gate
- PKP Open Archives Harvester
- Publons
- Questia Online Library
- RePEc
- SafetyLit
- SHERPA/RoMEO
- Standard Periodical Directory
- Stanford Libraries
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- Universe Digital Library
- VOCEDplus
- WorldCat
Contact
- Jenny ZhangEditorial Assistant
- ass@ccsenet.org