Advertisement

Extended Learning Method for Designation of Co-operation

  • Edyta Kucharska
  • Ewa Dudek-Dyduch
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8615)

Abstract

The aim of the paper is to present a new machine learning method for determining intelligent co-operation at project realization. The method uses local optimization task of a special form and is based on learning idea. Additionally, the information gathered during a searching process is used to prune non-perspective solutions. The paper presents a formal approach to creation of constructive algorithms that use a sophisticated local optimization and are based on a formal definition of multistage decision process. It also proposes a general conception of creation local optimization tasks for different problems as well as a conception of local optimization task modification on basis of acquired information. To illustrate the conceptions, the learning algorithm for NP-hard scheduling problem is presented as well as results of computer experiments.

Keywords

Machine learning Learning in scheduling Algebraic-logical model (ALM) Learning based on ALM Local search techniques Optimization of co-operation Project management Multistage decision process 

References

  1. 1.
    Bolc, L., Cytowski, J.: Search Methods for Artificial Intelligence. Academic Press, London (1992)zbMATHGoogle Scholar
  2. 2.
    Cherkassky, V., Mulier, F.: Learning from Data: Concepts, Theory, and Methods. Wiley, New York (2007)CrossRefGoogle Scholar
  3. 3.
    Dudek-Dyduch, E.: Formalization and analysis of problems of discrete manufacturing processes. Automatics, vol. 54, (in Polish) (1990) (Scientific bulletin of AGH University)Google Scholar
  4. 4.
    Dudek-Dyduch, E.: Control of discrete event processes - branch and bound method. In: Proceedings of IFAC/Ifors/Imacs Symposium Large Scale Systems: Theory and Applications, Chinese Association of Automation, vol. 2, pp. 573–578 (1992)Google Scholar
  5. 5.
    Dudek-Dyduch, E.: Learning based algorithm in scheduling. J. Intell. Manuf. 11(2), 135–143 (2000)CrossRefGoogle Scholar
  6. 6.
    Dudek-Dyduch, E., Dutkiewicz, L.: Substitution task method for NP-hard scheduling problems. Automatics vol. 143, pp. 57–66 (in Polish) (2006) (Scientific bulletin of Silesian University of Technology)Google Scholar
  7. 7.
    Dudek-Dyduch, E., Dyduch, T.: Learning algorithms for scheduling using knowledge based model. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 1091–1100. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Dudek-Dyduch, E., Fuchs-Seliger, S.: Approximate algorithms for some tasks in management and economy. Syst. Model. Control. 1(7), 148–152 (1993)Google Scholar
  9. 9.
    Dudek-Dyduch, E., Kucharska, E.: Learning method for co-operation. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part II. LNCS(LNAI), vol. 6923, pp. 290–300. Springer, Heidelberg (2011). ISSN 0302-9743, ISBN 978-3-642-23937-3Google Scholar
  10. 10.
    Flach, P.: Machine Learning: The Art and Science of Algorithms that Make Sense of Data. Cambridge University Press, Cambridge (2012)CrossRefGoogle Scholar
  11. 11.
    Jędrzejowicz, P.: A-teams and their applications. In: Nguyen, N.T., Kowalczyk, R., Chen, S.M., et al. (eds.) ICCCI 2009. LNCS, vol. 5796, pp. 36–50. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  12. 12.
    Kolish, R., Drexel, A.: Adaptive Search for Solving Hard Project Scheduling Problems. Naval Research Logistics, vol.42 (1995)Google Scholar
  13. 13.
    Kucharska, E.: Application of an algebraic-logical model for optimization of scheduling problems with retooling time depending on system state. Ph.D. thesis (in Polish) (2006)Google Scholar
  14. 14.
    Priore, P., de la Fuente, D., Puente, J., Parreño, J.: A comparison of machine-learning algorithms for dynamic scheduling of flexible manufacturing systems. Eng. Appl. Artif. Intell. 19(3), 247–255 (2006)CrossRefGoogle Scholar
  15. 15.
    Sprecher, A., Kolish, R., Drexel, A.: Semiactive, active and not delay schedules for the resource constrained project scheduling problem. Eur. J. Oper. Res. 80, 94–102 (1993)CrossRefGoogle Scholar
  16. 16.
    Śnieżyński, B.: Resource management in a multi-agent system by means of reinforcement learning and supervised rule learning. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007, Part II. LNCS, vol. 4488, pp. 864–871. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  17. 17.
    Tadeusiewicz, R.: New trends in neurocybernetics. Comput. Meth. Mater. Sci. 10(1), 1–7 (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Department of Automatics and Biomedical EngineeringAGH University of Science and TechnologyKrakowPoland

Personalised recommendations