Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
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 a...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2016-06-01
|
| Series: | International Journal of Applied Mathematics and Computer Science |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/amcs-2016-0028 |
| _version_ | 1818715937737539584 |
|---|---|
| author | Lopez-Loces Mario C. Musial Jedrzej Pecero Johnatan E. Fraire-Huacuja Hector J. Blazewicz Jacek Bouvry Pascal |
| author_facet | Lopez-Loces Mario C. Musial Jedrzej Pecero Johnatan E. Fraire-Huacuja Hector J. Blazewicz Jacek Bouvry Pascal |
| author_sort | Lopez-Loces Mario C. |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-17T19:11:18Z |
| format | Article |
| id | doaj.art-aa0247d386664a3180ae236006297978 |
| institution | Directory Open Access Journal |
| issn | 2083-8492 |
| language | English |
| last_indexed | 2024-12-17T19:11:18Z |
| publishDate | 2016-06-01 |
| publisher | Sciendo |
| record_format | Article |
| series | International Journal of Applied Mathematics and Computer Science |
| spelling | doaj.art-aa0247d386664a3180ae2360062979782022-12-21T21:35:52ZengSciendoInternational Journal of Applied Mathematics and Computer Science2083-84922016-06-0126239140610.1515/amcs-2016-0028amcs-2016-0028Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costsLopez-Loces Mario C.0Musial Jedrzej1Pecero Johnatan E.2Fraire-Huacuja Hector J.3Blazewicz Jacek4Bouvry Pascal5National 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, MexicoInstitute of Computing Science Poznań University of Technology, ul. Piotrowo 2, 60-965 Poznań, PolandComputer Science and Communications Research Unit University of Luxembourg, 6, rue Richard Coudenhove-Kalergi, L-1359 Luxembourg, LuxembourgNational 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, MexicoInstitute of Computing Science Poznań University of Technology, ul. Piotrowo 2, 60-965 Poznań, PolandComputer Science and Communications Research Unit University of Luxembourg, 6, rue Richard Coudenhove-Kalergi, L-1359 Luxembourg, LuxembourgInternet 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.https://doi.org/10.1515/amcs-2016-0028internet shopping optimizationinteger linear programmingcellular processing algorithmheuristic algorithmsoptimization in e-commerce |
| spellingShingle | Lopez-Loces Mario C. Musial Jedrzej Pecero Johnatan E. Fraire-Huacuja Hector J. Blazewicz Jacek Bouvry Pascal Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs International Journal of Applied Mathematics and Computer Science internet shopping optimization integer linear programming cellular processing algorithm heuristic algorithms optimization in e-commerce |
| title | Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs |
| title_full | Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs |
| title_fullStr | Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs |
| title_full_unstemmed | Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs |
| title_short | Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs |
| title_sort | exact and heuristic approaches to solve the internet shopping optimization problem with delivery costs |
| topic | internet shopping optimization integer linear programming cellular processing algorithm heuristic algorithms optimization in e-commerce |
| url | https://doi.org/10.1515/amcs-2016-0028 |
| work_keys_str_mv | AT lopezlocesmarioc exactandheuristicapproachestosolvetheinternetshoppingoptimizationproblemwithdeliverycosts AT musialjedrzej exactandheuristicapproachestosolvetheinternetshoppingoptimizationproblemwithdeliverycosts AT pecerojohnatane exactandheuristicapproachestosolvetheinternetshoppingoptimizationproblemwithdeliverycosts AT frairehuacujahectorj exactandheuristicapproachestosolvetheinternetshoppingoptimizationproblemwithdeliverycosts AT blazewiczjacek exactandheuristicapproachestosolvetheinternetshoppingoptimizationproblemwithdeliverycosts AT bouvrypascal exactandheuristicapproachestosolvetheinternetshoppingoptimizationproblemwithdeliverycosts |