Enhancing an AmI-Based Framework for U-commerce by Applying Memetic Algorithms to Plan Shopping

Thanks to the phenomenal proliferation of the electronic commerce, the number of Internet shops increases more and more each year. This increasing forces strong competition on the market by leading to low prices for customers, but, at the same time, it represents a problem for customers since it makes difficult to manually compare all the product offers and decide a shopping plan. This scenario is furthermore made complex by a recent business strategy adopted in e-commerce scenario: the loyalty program such as point systems and coupons. In order to face the shopping plan problem in these new loyalty program scenarios, a recently proposed AmI-based framework for u-commerce introduces the exploitation of evolutionary algorithms, and, in particular, genetic ones. However, in spite of their successfully application to several complex problems, genetic algorithms are inherently characterized by premature convergence. Therefore, this paper proposes to replace the exploited evolutionary approach with the application of memetic algorithms for solving the shopping plan problem. As shown by a statistical test, our approach significantly improves the above AmI-based framework for u-commerce.

[1]  R. Lewontin ‘The Selfish Gene’ , 1977, Nature.

[2]  Gregory M. P. O'Hare,et al.  Easishop: Ambient intelligence assists everyday shopping , 2008, Inf. Sci..

[3]  F. Wilcoxon Individual Comparisons by Ranking Methods , 1945 .

[4]  Giovanni Acampora,et al.  Enhancing ontology alignment through a memetic aggregation of similarity measures , 2013, Inf. Sci..

[5]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

[7]  Mimmo Parente,et al.  Enriched µ-Calculi Module Checking , 2007, Log. Methods Comput. Sci..

[8]  Dinesh Kumar,et al.  Memetic Algorithms for Feature Selection in Face Recognition , 2008, 2008 Eighth International Conference on Hybrid Intelligent Systems.

[9]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

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

[11]  Poonam Garg,et al.  A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algorithm , 2010, ArXiv.

[12]  Margherita Napoli,et al.  Specification and Verification of Protocols With Time Constraints , 2004, Electron. Notes Theor. Comput. Sci..

[13]  Giovanni Acampora,et al.  A hybrid evolutionary approach for solving the ontology alignment problem , 2012, Int. J. Intell. Syst..

[14]  Mimmo Parente,et al.  Enriched MU-Calculi Module Checking , 2008, ArXiv.

[15]  A. Alkan,et al.  Memetic algorithms for timetabling , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[16]  Anjali Gupta E-COMMERCE : ROLE OF E-COMMERCE IN TODAY'S BUSINESS , 2014 .

[17]  Matteo Gaeta,et al.  A genetic approach to plan shopping in the AmI-based Blended Commerce , 2013, 2013 IEEE International Symposium on Industrial Electronics.

[18]  James E. Baker,et al.  Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[19]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[20]  Giovanni Acampora,et al.  Improving ontology alignment through memetic algorithms , 2011, 2011 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2011).