Autor:

Lopez-Loces, Mario C. ; Musiał, Jędrzej ; Pecero, Johnatan E. ; Fraire-Huacuja, Hector J. ; Blazewicz, Jacek ; Bouvry, Pascal

Współtwórca:

Korbicz, Józef (1951- ) - red. ; Uciński, Dariusz - red.

Tytuł:

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

Tytuł publikacji grupowej:

AMCS, Volume 26 (2016)

Temat i słowa kluczowe:

Internet shopping optimization ; integer linear programming ; cellular processing algorithm ; heuristic algorithms ; optimization in e-commerce

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.

Wydawca:

Zielona Góra: Uniwersytet Zielonogórski

Data wydania:

2016

Typ zasobu:

artykuł

DOI:

10.1515/amcs-2016-0028

Strony:

391-406

Źródło:

AMCS, volume 26, number 2 (2016) ; kliknij tutaj, żeby przejść

Jezyk:

eng

Licencja CC BY 4.0:

kliknij tutaj, żeby przejść

Prawa do dysponowania publikacją:

Biblioteka Uniwersytetu Zielonogórskiego