How to efficiently solve Internet Shopping Optimization Problem with price sensitive discounts?

In this paper we deal with the Internet Shopping Optimization Problem. An extended model that includes price sensitive discounts is considered. A set of algorithms to solve the Internet Shopping Optimization Problem with Price Sensitivity Discounts (ISOPwD) is introduced. The algorithms are designed to consider a different solution quality regarding computational time and results close to the optimum solution. Simulations based on real world data assess the new set of heuristics. The results of the proposed algorithms were compared with the optimal solutions, computed by a branch and bound algorithm. The scalability is evaluated by increasing the problem sizes. Computational experiments are performed and their results are carefully analyzed and discussed. The paper should be perceived as a work in progress - position paper.

[1]  Ho Geun Lee,et al.  Do electronic marketplaces lower the price of goods? , 1998, CACM.

[2]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[3]  Hong Zhang,et al.  Segmented min-min: a static mapping algorithm for meta-tasks on heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[4]  Paul Timmers,et al.  Business Models for Electronic Markets , 1998, Electron. Mark..

[5]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[6]  Juan Martín Carpio Valadez,et al.  Cellular Processing Algorithms , 2013, Soft Computing Applications in Optimization, Control, and Recognition.

[7]  Adam Wojciechowski,et al.  A customer assistance system: optimizing basket cost , 2009 .

[8]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[9]  Jacek Blazewicz,et al.  E-Commerce Evaluation - Multi-Item Internet Shopping. Optimization and Heuristic Algorithms , 2010, OR.

[10]  Adam Wojciechowski,et al.  Towards Optimal Multi-item Shopping Basket Management: Heuristic Approach , 2010, OTM Workshops.

[11]  Jedrzej Musial,et al.  Applications of Combinatorial Optimization for Online Shopping , 2013 .

[12]  Frank Plastria,et al.  Discrete location problems with push-pull objectives , 2002, Discret. Appl. Math..

[13]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[14]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[15]  R. Krishnan,et al.  Prices and Price Dispersion on the Web: Evidence from the Online Book Industry , 2001 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Maciej Drozdowski,et al.  Optimization of column width in website layout for advertisement fit , 2013, Eur. J. Oper. Res..

[18]  Francisco Saldanha-da-Gama,et al.  Facility location and supply chain management - A review , 2009, Eur. J. Oper. Res..

[19]  Cem Iyigun,et al.  A generalized Weiszfeld method for the multi-facility location problem , 2010, Oper. Res. Lett..

[20]  Pascal Bouvry,et al.  Internet shopping with price sensitive discounts , 2014, 4OR.

[21]  Jacek Blazewicz,et al.  Internet shopping optimization problem , 2010, Int. J. Appl. Math. Comput. Sci..

[22]  Horst A. Eiselt,et al.  Decision analysis, location models, and scheduling problems , 2003 .

[23]  Horst A. Eiselt,et al.  A bibliography for some fundamental problem categories in discrete location science , 2008, Eur. J. Oper. Res..