Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
Abstract Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve those achieved by the state of the art heuristics, and for small real case scenarios ILP delivers exact solutions in a reasonable amount of time.
Int. J. Appl. Math. Comput. Sci.