Internet shopping optimization; integer linear programming; cellular processing algorithm
Abstract :
[en] 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.
Disciplines :
Computer science
Author, co-author :
Lopez Loces, Mario
Musial, Jedrzej
PECERO, Johnatan ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Fraire, Hector
Blazewicz, Jacek
BOUVRY, Pascal ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
yes
Language :
English
Title :
Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
Publication date :
01 March 2016
Journal title :
International Journal of Applied Mathematics and Computer Science
ISSN :
0867-857X
eISSN :
1641-876X
Publisher :
University of Zielona Gora. Institute of Control and Computation Engineering, Zielona Gora, Poland
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
Similar publications
Sorry the service is unavailable at the moment. Please try again later.