Skip to main content

2021 | OriginalPaper | Buchkapitel

A Memetic Evolutionary Algorithm-Based Optimization for Competitive Bid Data Analysis

verfasst von : Pritam Roy

Erschienen in: Evolutionary Computing and Mobile Sustainable Networks

Verlag: Springer Singapore

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

One of the most difficult decision-making problems for buyers is to identify which suppliers to provide contracts to of the biddable items for a competitive event after considering several conditions. This is an example of pure integer linear programming (ILP) problem with cost minimization where all the decision variables, i.e., the quantity of the biddable items to be awarded to suppliers, are always nonnegative integers. Normally for solving ILP, Gomory cutting plane or Branch and Bound technique using the simplex method are applied. But when the problem to be solved is highly constrained and a large number of variables are involved, finding a feasible solution is difficult and that can result in poor performance by these techniques. To address this, an improved memetic meta-heuristic evolutionary algorithm (EA) such as shuffled frog leaping algorithm (SFLA) is utilized to find the optimum solution satisfying all the constraints. The SFLA is a random population-based optimization technique inspired by natural memetics. It performs particle swarm optimization (PSO) like positional improvement in the local search and globally, it employs effective mixing of information using the shuffled complex evolution technique. In this paper, a modified shuffled frog leaping algorithm (MSFLA) is proposed where modification of SFLA is achieved by introducing supplier weightage and supplier acceptability to improve the quality of the solution with a more stable outcome. Simulation results and comparative study on highly constrained and a large number of items and suppliers’ instances from bidding data demonstrate the efficiency of the proposed hybrid meta-heuristic algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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 "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!

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!

Literatur
1.
Zurück zum Zitat Hasker K, Sickles R (2010) eBay in the economic literature: analysis of an auction marketplace. Rev Ind Org 37:3–42CrossRef Hasker K, Sickles R (2010) eBay in the economic literature: analysis of an auction marketplace. Rev Ind Org 37:3–42CrossRef
2.
Zurück zum Zitat Jank W, Zhang S (2011) An automated and data-driven bidding strategy for online auctions. INFORMS J. Comput. 23:238–253MathSciNetCrossRef Jank W, Zhang S (2011) An automated and data-driven bidding strategy for online auctions. INFORMS J. Comput. 23:238–253MathSciNetCrossRef
3.
Zurück zum Zitat Liu SL, Lai KK, Wang SY (2000) Multiple criteria models for evaluation of competitive bidss. IMA J Manag Math 11(3):151–160CrossRef Liu SL, Lai KK, Wang SY (2000) Multiple criteria models for evaluation of competitive bidss. IMA J Manag Math 11(3):151–160CrossRef
4.
Zurück zum Zitat Ghasabi-Oskoei H, Mahdavi-Amiri N (2006) An efficient simplified neural network for solving linear and quadratic programming problems. Appl Math Comput J 452–464. Elsevier Ghasabi-Oskoei H, Mahdavi-Amiri N (2006) An efficient simplified neural network for solving linear and quadratic programming problems. Appl Math Comput J 452–464. Elsevier
5.
Zurück zum Zitat L.R. Arvind Babu and B. Palaniappan, “Artificial Neural Network Based Hybrid Algorithmic Structure for Solving Linear Programming Problems”, International Journal of Computer and Electrical Engineering, Vol. 2, No. 4, August 2010, pp 1793-8163 L.R. Arvind Babu and B. Palaniappan, “Artificial Neural Network Based Hybrid Algorithmic Structure for Solving Linear Programming Problems”, International Journal of Computer and Electrical Engineering, Vol. 2, No. 4, August 2010, pp 1793-8163
6.
Zurück zum Zitat Nasira GM, Ashok Kumar S, Balaji TSS Neural network implementation for integer linear programming problem. Int J Comput Appl 1(18):0975–8887 Nasira GM, Ashok Kumar S, Balaji TSS Neural network implementation for integer linear programming problem. Int J Comput Appl 1(18):0975–8887
7.
Zurück zum Zitat Eusuff MM, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154MathSciNetCrossRef Eusuff MM, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154MathSciNetCrossRef
8.
Zurück zum Zitat Zhang X, Hu X, Cui G, Wang Y, Niu Y (2008) An improved shuffled frog leaping algorithm with cognitive behavior. In: Proceedings of 7th world congress intelligent control and automation 2008 Zhang X, Hu X, Cui G, Wang Y, Niu Y (2008) An improved shuffled frog leaping algorithm with cognitive behavior. In: Proceedings of 7th world congress intelligent control and automation 2008
9.
Zurück zum Zitat Elbeltagi E, Hegazy T, Grierson D (2005) Comparison among five evolutionary based optimization algorithms. Adv Eng Inf 19(1):43–53CrossRef Elbeltagi E, Hegazy T, Grierson D (2005) Comparison among five evolutionary based optimization algorithms. Adv Eng Inf 19(1):43–53CrossRef
10.
Zurück zum Zitat Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE conference on neural networks, vol 4, pp 1942–1948 Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE conference on neural networks, vol 4, pp 1942–1948
11.
Zurück zum Zitat Karthiban MK, Raj JS (2019) Big data analytics for developing secure internet of everything. J ISMAC 1(02):129–136 Karthiban MK, Raj JS (2019) Big data analytics for developing secure internet of everything. J ISMAC 1(02):129–136
12.
Zurück zum Zitat Roy P (2014) A new memetic algorithm with GA crossover technique to solve Single Source Shortest Path (SSSP) problem. In: INDICON 2014 Roy P (2014) A new memetic algorithm with GA crossover technique to solve Single Source Shortest Path (SSSP) problem. In: INDICON 2014
13.
Zurück zum Zitat Roy P, Roy P, Chakrabarti A Solving network-constrained non smooth economic dispatch problems through a gradient-based approach. Appl Soft Comput 13(11):4244–4252. Elsevier Roy P, Roy P, Chakrabarti A Solving network-constrained non smooth economic dispatch problems through a gradient-based approach. Appl Soft Comput 13(11):4244–4252. Elsevier
14.
Zurück zum Zitat Wang Z, Zhang D, Wang B, Chen W (2019) Research on improved strategy of shuffled frog leaping algorithm. In: 2019 IEEE 34rd Youth academic annual conference of Chinese association of automation (YAC) Wang Z, Zhang D, Wang B, Chen W (2019) Research on improved strategy of shuffled frog leaping algorithm. In: 2019 IEEE 34rd Youth academic annual conference of Chinese association of automation (YAC)
Metadaten
Titel
A Memetic Evolutionary Algorithm-Based Optimization for Competitive Bid Data Analysis
verfasst von
Pritam Roy
Copyright-Jahr
2021
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-15-5258-8_84