Skip to main content
Top
Published in: Soft Computing 5/2016

25-02-2015 | Methodologies and Application

Solving the shopping plan problem through bio-inspired approaches

Authors: Francesco Orciuoli, Mimmo Parente, Autilia Vitiello

Published in: Soft Computing | Issue 5/2016

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference 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–165MathSciNetCrossRef 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–165MathSciNetCrossRef
go back to reference 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–1790 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–1790
go back to reference 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–6 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–6
go back to reference 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–216CrossRef 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–216CrossRef
go back to reference Acampora G, Loia V, Vitiello A (2013) Enhancing ontology alignment through a memetic aggregation of similarity measures. Inf Sci 250:1–20CrossRef Acampora G, Loia V, Vitiello A (2013) Enhancing ontology alignment through a memetic aggregation of similarity measures. Inf Sci 250:1–20CrossRef
go back to reference 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–1802 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–1802
go back to reference 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 Jersey 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 Jersey
go back to reference 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), 2014 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), 2014
go back to reference Dawkins R (2006) The selfish gene. Number 199. Oxford University Press, Oxford Dawkins R (2006) The selfish gene. Number 199. Oxford University Press, Oxford
go back to reference Dorigo M, Caro G, Gambardella L (1999) Ant algorithms for discrete optimization. Artif Life 5(2):137–172CrossRef Dorigo M, Caro G, Gambardella L (1999) Ant algorithms for discrete optimization. Artif Life 5(2):137–172CrossRef
go back to reference 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–32 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–32
go back to reference Dorigo M, Stutzle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances. In Handbook of metaheuristics. Springer, Berlin, pp 250–285 Dorigo M, Stutzle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances. In Handbook of metaheuristics. Springer, Berlin, pp 250–285
go back to reference Ferrante A, Murano A, Parente M (2008) Enriched \(\mu \)-calculi module checking. Logic Methods Comput Sci 4(3):1–21MathSciNetMATH Ferrante A, Murano A, Parente M (2008) Enriched \(\mu \)-calculi module checking. Logic Methods Comput Sci 4(3):1–21MathSciNetMATH
go back to reference Fuchs B, Ritz T, Halbach B, Hartl F (2011) Blended shopping—interactivity and individualization. In ICE-B, pp 47–52, 2011 Fuchs B, Ritz T, Halbach B, Hartl F (2011) Blended shopping—interactivity and individualization. In ICE-B, pp 47–52, 2011
go back to reference Fuchs B, Ritz T (2009) Fachbereich Elektrotechnik und Informationstechnik. Blended shopping. In MMS, pp 109–122 Fuchs B, Ritz T (2009) Fachbereich Elektrotechnik und Informationstechnik. Blended shopping. In MMS, pp 109–122
go back to reference Goldberg DE (2002) The design of innovation: lessons from and for competent genetic algorithms. Kluwer Academic Publishers, London Goldberg DE (2002) The design of innovation: lessons from and for competent genetic algorithms. Kluwer Academic Publishers, London
go back to reference 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, Berlin 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, Berlin
go back to reference 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–654MathSciNetCrossRefMATH 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–654MathSciNetCrossRefMATH
go back to reference Holand JH (1975) Adaptation in natural and artificial systems. Ann Arbo, The University of Michigan Press Holand JH (1975) Adaptation in natural and artificial systems. Ann Arbo, The University of Michigan Press
go back to reference 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–367MATH 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–367MATH
go back to reference 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. IEEE 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. IEEE
go back to reference 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–128 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–128
go back to reference Nagata Y, Soler D (2012) A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst Appl 39(10):8947–8953CrossRef Nagata Y, Soler D (2012) A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst Appl 39(10):8947–8953CrossRef
go back to reference Napoli M, Parente M, Peron A (2004) Specification and verification of protocols with time constraints. Electron Notes Theor Comput Sci 99:205–227CrossRef Napoli M, Parente M, Peron A (2004) Specification and verification of protocols with time constraints. Electron Notes Theor Comput Sci 99:205–227CrossRef
go back to reference Omara Fatma A, Arafa Mona M (2010) Genetic algorithms for task scheduling problem. J Parallel Distrib Comput 70(1):13–22CrossRefMATH Omara Fatma A, Arafa Mona M (2010) Genetic algorithms for task scheduling problem. J Parallel Distrib Comput 70(1):13–22CrossRefMATH
go back to reference Rosenberg AL (2007) Cellular antomata. In Parallel and Distributed processing and applications, Springer, Berlin, pp 78–90 Rosenberg AL (2007) Cellular antomata. In Parallel and Distributed processing and applications, Springer, Berlin, pp 78–90
go back to reference 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–287MathSciNetCrossRef 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–287MathSciNetCrossRef
go back to reference Zewicz J, Kovalyov MY, Musial J, Wojciechowski A (2010) Internet shopping optimization problem. Int J Appl Math Comput Sci 20(2):385–390MATH Zewicz J, Kovalyov MY, Musial J, Wojciechowski A (2010) Internet shopping optimization problem. Int J Appl Math Comput Sci 20(2):385–390MATH
Metadata
Title
Solving the shopping plan problem through bio-inspired approaches
Authors
Francesco Orciuoli
Mimmo Parente
Autilia Vitiello
Publication date
25-02-2015
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 5/2016
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-015-1625-5

Other articles of this Issue 5/2016

Soft Computing 5/2016 Go to the issue

Premium Partner