Trajectory metaheuristics for the internet shopping optimization problem

Abstract

In this chapter we propose two trajectory-based heuristics, particularly Simulated Annealing and Tabu Search, to solve instances of the Internet Shopping Optimisation Problem (ISOP). Since these metaheuristics are relatively less costly in terms of computational resources such as CPU time and memory, compared to population-based metaheuristics, but with a better performance than simpler heuristics, its use in the context of internet shopping is relevant. In such context the user of the service expects good quality solutions, while the provider wants to maintain the use of resources at a low level.