Genetic algorithms in forecasting of Internet shops demand
The general aim of this article is to present genetic algorithms as a tool, that can be used in de-mand forecasting in internet shops. First part of article identities factors, which have to be taken into consideration during analysing demand in internet shops, e.g. dispersion of demand, delivery time in-fluence and different e-marketing factors. Specific form of used demand function is shown in the next section of the article. Then genetic algorithm is defined by its genetic operators acting on bit strings (examples of the operators are: crossover, inversion, and mutation) and its method of credit allocation (fitness evaluation and selection). Next the method of identification of the function parameters using genetic algorithms is shown. The next part of article shows appliance of presented genetic algorithm. The advantages and disadvantages of proposed method are shortly discussed in summary.
|Date of creation:||2009|
|Date of revision:||2009|
|Publication status:||Published in Information systems architecture and technology : system analysis in decision aided problems (2009): pp. 59-68|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Chodak, Grzegorz & Kwaśnicki, Witold, 2000. "Genetic algorithms in seasonal demand forecasting," MPRA Paper 34099, University Library of Munich, Germany.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:34034. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If references are entirely missing, you can add them using this form.