<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></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.

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

National Institute of Technology of Ciudad Madero, National Institute of Technology of Mexico v. 1o. de Mayo esq. Sor Juana Inés de la Cruz s/n, Col. Los Mangos C.P. 89440, Cd. Madero, Tamaulipas, Mexico

Institute of Computing Science Poznań University of Technology, ul. Piotrowo 2, 60-965 Poznań, Poland

Computer Science and Communications Research Unit University of Luxembourg, 6, rue Richard Coudenhove-Kalergi, L-1359 Luxembourg, Luxembourg

Institute of Bioorganic Chemistry Polish Academy of Sciences, ul. Z. Noskowskiego 12/14, 61-704 Poznań, Poland

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

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

Pubblicato online: 02 lug 2016

Pagine: 391 - 406

Ricevuto: 21 mar 2015

Accettato: 20 dic 2015

DOI: https://doi.org/10.1515/amcs-2016-0028

Parole chiave
Internet shopping optimization, integer linear programming, cellular processing algorithm, heuristic algorithms, optimization in e-commerce

© by Jedrzej Musial

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

Pubblicato online: 02 lug 2016

Pagine: 391 - 406

Ricevuto: 21 mar 2015

Accettato: 20 dic 2015

DOI: https://doi.org/10.1515/amcs-2016-0028

Parole chiaveInternet shopping optimization, integer linear programming, cellular processing algorithm, heuristic algorithms, optimization in e-commerce

© by Jedrzej Musial

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Parole chiave
Internet shopping optimization, integer linear programming, cellular processing algorithm, heuristic algorithms, optimization in e-commerce