Advertisement

Soft Computing

, Volume 20, Issue 5, pp 2077–2089 | Cite as

Solving the shopping plan problem through bio-inspired approaches

  • Francesco Orciuoli
  • Mimmo Parente
  • Autilia VitielloEmail author
Methodologies and Application

Abstract

Blended commerce involves all commerce experiences in which customers make use of different channels (online, offline and mobile) for their purchases to take advantages with respect to their needs and attitudes. This new e-commerce trend is typically characterized by so-called loyalty programmes such as coupons and system points. These mechanisms can be extremely useful for the companies to achieve customer retention and for the customers to obtain discounts. However, loyalty programmes can complicate for customers the evaluation of all offers and the selection of optimal providers (shopping plan) for buying the desired set of products. To face this problem, referred as Shopping Plan Problem, optimization algorithms are emerging as a suitable methodology. This paper is aimed at performing a systematic comparison amongst three bio-inspired optimization approaches, genetic algorithms, memetic ones and ant colony optimization, to detect the best performer for solving the shopping plan problem in a blended shopping scenario.

Keywords

Shopping plan problem Blended commerce Optimization problem Bio-inspired approaches 

References

  1. Acampora G, Gaeta M, Loia V (2011) Combining multi-agent paradigm and memetic computing for personalized and adaptive learning experiences. Comput Intell 27(2):141–165MathSciNetCrossRefGoogle Scholar
  2. Acampora G, Avella P, Loia V, Salerno S, Vitiello A (2011) Improving ontology alignment through memetic algorithms. In Fuzzy systems (FUZZ), 2011 IEEE International conference on IEEE 2011, pp 1783–1790Google Scholar
  3. Acampora G, Kaymak U, Loia V, Vitiello A (2012) Hybridizing genetic algorithms and hill climbing for similarity aggregation in ontology matching. In: Computational intelligence (UKCI), 2012 12th UK workshop on, IEEE 2012, pp 1–6Google Scholar
  4. Acampora G, Loia V, Salerno S, Vitiello A (2012) A hybrid evolutionary approach for solving the ontology alignment problem. Int J Intel Syst 27(3):189–216CrossRefGoogle Scholar
  5. Acampora G, Loia V, Vitiello A (2013) Enhancing ontology alignment through a memetic aggregation of similarity measures. Inf Sci 250:1–20CrossRefGoogle Scholar
  6. Alkan A, Ozcan E (2003) Memetic algorithms for timetabling. In: Evolutionary computation, 2003. CEC’03. The 2003 congress on, volume 3, IEEE, 2003, pp 1796–1802Google Scholar
  7. Baker JE (1985 ) Adaptive selection methods for genetic algorithms. In: Proceedings of an international conference on genetic algorithms and their applications. pp 101–111. Hillsdale, New JerseyGoogle Scholar
  8. D’Aniello G, Loia V, Orciuoli F, Vitiello A (2014) Enhancing an ami-based framework for u-commerce by applying memetic algorithms to plan shopping. In 6-th international conference on intelligent networking and collaborative systems (INCoS-2014), 2014Google Scholar
  9. Dawkins R (2006) The selfish gene. Number 199. Oxford University Press, OxfordGoogle Scholar
  10. Dorigo M, Caro G, Gambardella L (1999) Ant algorithms for discrete optimization. Artif Life 5(2):137–172CrossRefGoogle Scholar
  11. Dorigo M, Di Caro G (1999) New ideas in optimization chapter. The ant colony optimization meta-heuristic. McGraw-Hill Ltd., UK, Maidenhead, UK, England, pp 11–32Google Scholar
  12. Dorigo M, Stutzle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances. In Handbook of metaheuristics. Springer, Berlin, pp 250–285Google Scholar
  13. Ferrante A, Murano A, Parente M (2008) Enriched \(\mu \)-calculi module checking. Logic Methods Comput Sci 4(3):1–21MathSciNetzbMATHGoogle Scholar
  14. Fuchs B, Ritz T, Halbach B, Hartl F (2011) Blended shopping—interactivity and individualization. In ICE-B, pp 47–52, 2011Google Scholar
  15. Fuchs B, Ritz T (2009) Fachbereich Elektrotechnik und Informationstechnik. Blended shopping. In MMS, pp 109–122Google Scholar
  16. Goldberg DE (2002) The design of innovation: lessons from and for competent genetic algorithms. Kluwer Academic Publishers, LondonGoogle Scholar
  17. Gruska J, La Torre S, Parente M (2005) Optimal time and communication solutions of firing squad synchronization problems on square arrays, toruses and rings. In Developments in language theory. pp 200–211. Springer, BerlinGoogle Scholar
  18. Gruska J, La Torre S, Parente M (2007) The firing squad synchronization problem on squares, toruses and rings. Int J Found Comput Sci 18(3):637–654MathSciNetCrossRefzbMATHGoogle Scholar
  19. Holand JH (1975) Adaptation in natural and artificial systems. Ann Arbo, The University of Michigan PressGoogle Scholar
  20. Lordache GV, Bogila MS, Pop F, Stratan C, Cristea V (2007) A decentralized strategy for genetic scheduling in heterogeneous environments. Multiagent Grid Syst 3(4):355–367zbMATHGoogle Scholar
  21. Kumar D, CS Rai (2008) Memetic algorithms for feature selection in face recognition. In Hybrid Intelligent Systems, 2008. HIS’08. Eighth International Conference on, pp 931–934. IEEEGoogle Scholar
  22. La Torre S, Napoli M, Parente D (1998) Synchronization of a line of identical processors at a given time. Fundam Inform 34(1–2):103–128Google Scholar
  23. Nagata Y, Soler D (2012) A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst Appl 39(10):8947–8953CrossRefGoogle Scholar
  24. Napoli M, Parente M, Peron A (2004) Specification and verification of protocols with time constraints. Electron Notes Theor Comput Sci 99:205–227CrossRefGoogle Scholar
  25. Omara Fatma A, Arafa Mona M (2010) Genetic algorithms for task scheduling problem. J Parallel Distrib Comput 70(1):13–22CrossRefzbMATHGoogle Scholar
  26. Rosenberg AL (2007) Cellular antomata. In Parallel and Distributed processing and applications, Springer, Berlin, pp 78–90Google Scholar
  27. Xu Y, Hu J, Hu J, Li K (2014) A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues. Inf Sci 270:255–287MathSciNetCrossRefGoogle Scholar
  28. Zewicz J, Kovalyov MY, Musial J, Wojciechowski A (2010) Internet shopping optimization problem. Int J Appl Math Comput Sci 20(2):385–390zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Francesco Orciuoli
    • 1
  • Mimmo Parente
    • 2
  • Autilia Vitiello
    • 3
    Email author
  1. 1.Dipartimento di InformaticaUniversity of SalernoFiscianoItaly
  2. 2.Dipartimento di InformaticaUniversity of SalernoFiscianoItaly
  3. 3.Department of Computer ScienceUniversity of SalernoFiscianoItaly

Personalised recommendations