Skip to main content
SpringerLink
Log in

Substitution Tasks Method for Discrete Optimization

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7895))

Included in the following conference series:

Abstract

The aim of the paper is to present a novel heuristic optimization method for discrete dynamic optimization problems. The method has been named substitution tasks method (ST method). According to the method, a solution is generated by means of sequence of dynamically created local optimization tasks so-called substitution tasks. The method is based on formal algebraic-logical meta model of multistage decision process (ALMM of MDP), that is given in the paper. The paper presents a formal approach for designing constructive algorithms that are based on the method. A general idea of creating substitution tasks for different optimization problems is given. Then creation of substitution tasks, based on automatic analisys of set of non-admissible states is proposed. To illustrate the presented ideas, a scheduling algorithm for a particular NP-hard problem is given and results of computer experiments are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bocewicz, G., Wójcik, R., Banaszak, Z.A.: Reachability of Cyclic Steady States Space: Declarative Modeling Approach. In: Nguyen, N.-T., Hoang, K., Jędrzejowicz, P. (eds.) ICCCI 2012, Part II. LNCS, vol. 7654, pp. 233–243. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Bocewicz, G., Wójcik, R., Banaszak, Z.: Knowledge Base Admissibility: An Ontology Perspective. In: Grzech, A., et al. (eds.) Information Systems Architecture and Technology, Networks Design and Analysis, pp. 13–22. Publishing house of Wrocaw University of Technology, Wrocaw (2012)

    Google Scholar 

  3. Dudek-Dyduch, E.: Control of discrete event processes - branch and bound method. In: Proc. of IFAC/Ifors/Imacs Symposium Large Scale Systems: Theory and Applications, Chinese Association of Automation, vol. 2, pp. 573–578 (1992)

    Google Scholar 

  4. Dudek-Dyduch, E.: Formalization and Analysis of Problems of Discrete Manufacturing Processes. Scientific Bulletin of AGH University, Automatics 54 (1990) (in Polish)

    Google Scholar 

  5. Dudek-Dyduch, E.: Learning based algorithm in scheduling. Journal of Intelligent Manufacturing 11(2), 135–143 (2000)

    Article  Google Scholar 

  6. Dudek-Dyduch, E., Dutkiewicz, L.: Substitution task method for NP-hard scheduling problems. Scientific Bulletin of Silesian University of Technology no.1726. Automatics 143, 57–66(2006) (in Polish)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  8. Dudek-Dyduch, E., Fuchs-Seliger, S.: Approximate algorithms for some tasks in management and economy. System, Modelling, Control 1(7) (1993)

    Google Scholar 

  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, vol. 6923, pp. 290–300. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Dudek-Dyduch, E., Kucharska, E.: Optimization learning method for discrete process control. In: ICINCO 2011: Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics, vol. 1 (2011)

    Google Scholar 

  11. Dutkiewicz, L.: Two-Level Algorithms for Optimization of Production Processes with Resources Depending on System State. PhD thesis (2005) (in Polish)

    Google Scholar 

  12. Dutkiewicz, L.: Two-level algorithms for scheduling problem. Selected Problems of Computer Science. In: Rutkowska, D., et al. (eds.) Selected Problems of Computer Science, pp. 139–144. Academic Publishing House EXIT, Warsaw (2005)

    Google Scholar 

  13. Dutkiewicz, L., Kucharska, E.: Model of scheduling problem with state dependent resources. Semiannual: Automatics, AGH University of Science and Technology 9(1-2), 67–77 (2005)

    Google Scholar 

  14. Gorczyca, M., Janiak, A.: Resource level minimization in the discretre-continuous scheduling. European Journal of Operational Research 203(1) (2010)

    Google Scholar 

  15. Janiak, A., Janiak, W., Kovalyov, M.Y., Kozan, E., Pesch, E.: Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Information Sciences (in press), doi:10.1016/j.ins.2012.10.024

    Google Scholar 

  16. Kucharska, E., Dudek-Dyduch, E.: Extended Learning Method for Designation of Co-operation. Transactions on Computational Collective Intelligence (to appear)

    Google Scholar 

  17. Kucharska, E., Dutkiewicz, L.: Heuristic search of solution tree for scheduling problem with parallel machines. Semiannual: Automatics, AGH University of Science and Technology 12(3) (2008) (in Polish)

    Google Scholar 

  18. Sękowski, H., Dudek-Dyduch, E.: Knowledge based model for scheduling in failure modes. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2012, Part II. LNCS, vol. 7268, pp. 591–599. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AGH University of Science and Technology, al. Mickiewicza 30, 30-059, Cracow, Poland

    Ewa Dudek-Dyduch & Lidia Dutkiewicz

Authors
  1. Ewa Dudek-Dyduch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lidia Dutkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Armii Krajowej 36, 42-200, Częstochowa, Poland

    Leszek Rutkowski , Marcin Korytkowski  & Rafał Scherer ,  & 

  2. AGH University of Science and Technology, Michiewicza 30, 30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, University of California, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Electrical and Computer Engineering, University of Louisville, 405 Lutz Hall, 40292, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dudek-Dyduch, E., Dutkiewicz, L. (2013). Substitution Tasks Method for Discrete Optimization. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2013. Lecture Notes in Computer Science(), vol 7895. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38610-7_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38610-7_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38609-1

  • Online ISBN: 978-3-642-38610-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation