Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs

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 a...

Full description

Saved in:
Bibliographic Details
Published in:International journal of applied mathematics and computer science 2016-06, Vol.26 (2), p.391-406
Main Authors: Lopez-Loces, Mario C., Musial, Jedrzej, Pecero, Johnatan E., Fraire-Huacuja, Hector J., Blazewicz, Jacek, Bouvry, Pascal
Format: Article
Language:English
Subjects:
cellular processing algorithm
heuristic algorithms
integer linear programming
Internet shopping optimization
optimization in e-commerce
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2083-8492
1641-876X
2083-8492
DOI:10.1515/amcs-2016-0028