Have a personal or library account? Click to login
Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs Cover

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

Open Access
|Jul 2016

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.

DOI: https://doi.org/10.1515/amcs-2016-0028 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 391 - 406
Submitted on: Mar 21, 2015
Accepted on: Dec 20, 2015
Published on: Jul 2, 2016
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2016 Mario C. Lopez-Loces, Jedrzej Musial, Johnatan E. Pecero, Hector J. Fraire-Huacuja, Jacek Blazewicz, Pascal Bouvry, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.