How to Efficiently Solve Internet Shopping Optimization Problem with Price Sensitive Discounts?

Jedrzej Musial, Johnatan E. Pecero, Mario C. Lopez, Hector J. Fraire, Pascal Bouvry, Jacek Blazewicz

2014

Abstract

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.

References

  1. Blazewicz, J., Bouvry, P., Kovalyov, M., and Musial, J. (2014). Internet shopping with price sensitive discounts. 4OR-Q J Oper Res, 12(1):35-48.
  2. Blazewicz, J., Kovalyov, M., Musial, J., Urbanski, A., and Wojciechowski, A. (2010). Internet shopping optimization problem. Int. J. Appl. Math. Comput. Sci., 20(2):385-390.
  3. Braun, T., Siegel, H., Beck, N., Bölöni, L., Maheswaran, M., Reuther, A., Robertson, J., Theys, M., Yao, B., Hensgen, D., et al. (2001). A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed computing, 61(6):810-837.
  4. Clay, K., Krishnan, R., and Wolff, E. (2001). Prices and price dispersion on the web: Evidence from the online book industry. NBER Working Papers 8271, National Bureau of Economic Research, Inc.
  5. Cormen, T., Leiserson, C., Rivest, R., and Stein, C. (2001). Introduction to Algorithms. McGraw-Hill Higher Education, 2nd edition.
  6. Eiselt, H. and Sandblom, C. (2004). Decision analysis, location models, and scheduling problems. SpringerVerlag, Berlin-Heidelberg-New York.
  7. Garey, M. and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NPCompleteness. New York, Freeman.
  8. Ibarra, O. H. and Kim, C. E. (1977). Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. ACM, 24:280-289.
  9. Iyigun, C. and Ben-Israel, A. (2010). A generalized weiszfeld method for the multi-facility location problem. Oper. Res. Lett., 38(3):207-214.
  10. Krarup, J., Pisinger, D., and Plastriab, F. (2002). Discrete location problems with push-pull objectives. Discrete Applied Mathematics, 123:363-378.
  11. Land, A. and Doig, A. (1960). An automatic method for solving discrete programming problems. Econometrica,, 28:497-520.
  12. Lee, H.-G. (1998). Do electronic marketplaces lower the price of goods? Commun. ACM, 41(1):73-80.
  13. Luxembourg-Embassy-Copenhagen (2005). E-commerce luxembourg.
  14. Marszalkowski, J. and Drozdowski, M. (2013). Optimization of column width in website layout for advertisement fit. European Journal of Operational Research, 226(3):592-601.
  15. Melo, M., Nickel, S., and Saldanha-da Gama, F. (2009). Facility location and supply chain management - a review. European Journal of Operational Research, 196(2):401-412.
  16. Musial, J. (2012). Applications of Combinatorial Optimization for Online Shopping. NAKOM, Poznan, Poland, 1st edition.
  17. Revelle, C., Eiselt, H., and Daskin, M. (2008). A bibliography for some fundamental problem categories in discrete location science. European Journal of Operational Research, 184(3):817-848.
  18. Terán-Villanueva, J. D., Huacuja, H. J. F., Valadez, J. M. C., Pazos Rangel, R. A., Soberanes, H. J. P., and Flores, J. A. M. (2013). Cellular processing algorithms. In Melin, P. and Castillo, O., editors, Soft Computing Applications in Optimization, Control, and Recognition, volume 294 of Studies in Fuzziness and Soft Computing, pages 53-74. Springer Berlin Heidelberg.
  19. Timmers, P. (1998). Business Models for Electronic Markets. Electronic Markets, (2):3-8.
  20. Wojciechowski, A. and Musial, J. (2009). A customer assistance system: Optimizing basket cost. Foundations of Computing and Decision Sciences, 34(1):59-69.
  21. Wojciechowski, A. and Musial, J. (2010). Towards optimal multi-item shopping basket management: Heuristic approach. In Meersman, R., Dillon, T., and Herrero, P., editors, On the Move to Meaningful Internet Systems: OTM 2010 Workshops, volume 6428 of Lecture Notes in Computer Science, pages 349-357. Springer Berlin / Heidelberg.
  22. Wu, M., Shu, W., and Zhang, H. (2000). Segmented min-min: A static mapping algorithm for meta-tasks on heterogeneous computing systems. In Heterogeneous Computing Workshop, 2000.(HCW 2000) Proceedings. 9th, pages 375-385. IEEE.
Download


Paper Citation


in Harvard Style

Musial J., Pecero J., Lopez M., Fraire H., Bouvry P. and Blazewicz J. (2014). How to Efficiently Solve Internet Shopping Optimization Problem with Price Sensitive Discounts? . In Proceedings of the 11th International Conference on e-Business - Volume 1: ICE-B, (ICETE 2014) ISBN 978-989-758-043-7, pages 209-215. DOI: 10.5220/0005112602090215


in Bibtex Style

@conference{ice-b14,
author={Jedrzej Musial and Johnatan E. Pecero and Mario C. Lopez and Hector J. Fraire and Pascal Bouvry and Jacek Blazewicz},
title={How to Efficiently Solve Internet Shopping Optimization Problem with Price Sensitive Discounts?},
booktitle={Proceedings of the 11th International Conference on e-Business - Volume 1: ICE-B, (ICETE 2014)},
year={2014},
pages={209-215},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005112602090215},
isbn={978-989-758-043-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Conference on e-Business - Volume 1: ICE-B, (ICETE 2014)
TI - How to Efficiently Solve Internet Shopping Optimization Problem with Price Sensitive Discounts?
SN - 978-989-758-043-7
AU - Musial J.
AU - Pecero J.
AU - Lopez M.
AU - Fraire H.
AU - Bouvry P.
AU - Blazewicz J.
PY - 2014
SP - 209
EP - 215
DO - 10.5220/0005112602090215