EXACT AND HEURISTIC APPROACHES TO SOLVE THE INTERNET SHOPPING OPTIMIZATION PROBLEM WITH DELIVERY COSTS

被引：8

作者：

Lopez-Loces, Mario C. ^{[1
]}

Musial, Jedrzej ^{[2
]}

Pecero, Johnatan E. ^{[3
]}

Fraire-Huacuja, Hector J. ^{[1
]}

Blazewicz, Jacek ^{[2
,4
]}

Bouvry, Pascal ^{[3
]}

机构：

[1] Natl Inst Technol Mexico, Natl Inst Technol Ciudad Madero, V 1o Mayo Esq Sor Juana Ines de la Cruz S-N, Cd Madero 89440, Tamaulipas, Mexico

[2] Poznan Univ Tech, Inst Comp Sci, Ul Piotrowo 2, PL-60965 Poznan, Poland

[3] Univ Luxembourg, Comp Sci & Commun Res Unit, 6 Rue Richard Coudenhove Kalergi, L-1359 Luxembourg, Luxembourg

[4] Polish Acad Sci, Inst Bioorgan Chem, Ul Z Noskowskiego 12-14, PL-61704 Poznan, Poland

来源：

INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE | 2016年 / 26卷 / 02期

关键词：

Internet shopping optimization; integer linear programming; cellular processing algorithm; heuristic algorithms; optimization in e-commerce; QUANTITY DISCOUNT; FACILITY LOCATION; PRICE DISPERSION; SYSTEMS; SEARCH; ALGORITHMS; MANAGEMENT; MARKETS;

D O I：

10.1515/amcs-2016-0028

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：391 / 406

页数：16