ACO with Heuristic Desirability for Web Page Positioning Problem

Due to ever changing browsing patterns of the website users, the companies need to adapt the structure of their websites regularly. Webpage positioning problem (WPP) is about deciding the best locations of the webpages in the hyperlink graph structure of the website. Ant colony optimization (ACO) is among the prominent algorithms to solve the optimization problems. In this regard, this chapter aims to solve the webpage positioning problem by formulating it as quadratic assignment problem (QAP). The solution of this problem by ant colony optimization can already be found in the existing literature, subsequently in this chapter the solution to the problem is found by considering heuristic desirability parameter in ant colony optimization technique. In the end, a comparative analysis of both simple ACO and ACO with heuristic desirability as solutions to WPP problem is performed. The experimental results on artificial and real life datasets reveal that the ACO with heuristic desirability produced better results with most of the problem instances.