Skip to main content
SpringerLink
Log in

DSOMA—Discrete Self Organising Migrating Algorithm

  • Chapter
  • First Online:
Self-Organizing Migrating Algorithm

Part of the book series: Studies in Computational Intelligence ((SCI,volume 626))

Abstract

A discrete Self Organising Migrating Algorithm (DSOAM) is described in this chapter. This variant is specifically designed for the permutative based combinatorial optimisation problem, where the problem domain in generally NP-Hard. Specific sampling between individuals in the search space is introduced as a means of constructing new feasible individuals. These feasible solutions are improved using 2-Opt routines. DSOMA has proven successful in solving manufacturing scheduling and assignment problems.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Askarzadeh, A.: A discrete chaotic harmony search-based simulated annealing algorithm for optimum design of pv/wind hybrid system. Sol. Energy 97(0), 93–101 (2013)

    Google Scholar 

  2. Davendra, D., Zelinka, I.: Optimization of quadratic assignment problem using self-organising migrating algorithm. Comput. Inform. 28, 169–180 (2009)

    Google Scholar 

  3. Davendra, D., Zelinka, I., Bialic-Davendra, M., Senkerik, R., Jasek, R.: Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait makespan. Math. Comput. Modell. 57(12), 100–110 (2013) (Mathematical and Computer Modelling in Power Control and Optimization)

    Google Scholar 

  4. Drezne, Z.: A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput. 115, 320–330 (2003)

    Article  Google Scholar 

  5. Gambardella, L., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. Int. J. Oper. Res. 50, 167–176 (1999)

    MATH  Google Scholar 

  6. Gao, K., Suganthan, P., Pan, Q., Chua, T., Cai, T., Chong, C.: Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf. Sci. 289, 76–90 (2014)

    Article  MathSciNet  Google Scholar 

  7. Institute, C.M.: Millennium problems (2015). http://www.claymath.org/millennium-problems

  8. Lin, F., Kao, C.: Hsu: applying the genetic approach to simulated annealing in solving np- hard problems. IEEE Trans. Syst. Man Cybern. B Cybern. 23, 1752–1767 (1993)

    Article  Google Scholar 

  9. Onwubolu, G., Davendra, D.: Scheduling flow shops using differential evolution algorithm. Euro. J. Oper. Res. 171, 674–679 (2006)

    Article  MATH  Google Scholar 

  10. Onwubolu, G., Davendra, D.: Differential evolution: a handbook for global permutation-based combinatorial optimization. Springer, Germany (2009)

    Book  Google Scholar 

  11. Pan, Q., Tasgetiren, M., Liang, Y.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Oper. Res. 35(9), 2807–2839 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Pan, Q.K., Wang, L., Li, J.Q., Duan, J.H.: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45, 42–56 (2014)

    Article  Google Scholar 

  13. Reeves, C.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22, 5–13 (1995)

    Article  MATH  Google Scholar 

  14. Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443–455 (1991)

    Article  MathSciNet  Google Scholar 

  15. Tasgetiren, M., Sevkli, M., Liang, Y.C., Gencyilmaz, G.: Particle swamp optimization algorithm for permutative flowshops sequencing problems. In: 4th International Workshops on Ant Algorithms and Swamp Intelligence, pp. 389–390. Brussel, Belgium (2004)

    Google Scholar 

  16. Tasgetiren, M.F., Pan, Q.K., Suganthan, P., Chen, A.H.L.: A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf. Sci. 181(16), 3459–3475 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The following grants are acknowledged for the financial support provided for this research: Grant Agency of the Czech Republic—GACR P103/15/06700S, VSB SGS grants of SP2015/141 and SP2015/142, research project NPU I No. MSMT-7778/2014 by the Ministry of Education of the Czech Republic, European Regional Development Fund under the Project CEBIA-Tech No. CZ.1.05/2.1.00/03.0089 and partially by the Internal Grant Agency of Tomas Bata University under the project No. IGA/FAI/2015/057.

Author information

Authors and Affiliations

  1. Department of Computer Science, Central Washington University, 400 E. University Way, Ellensburg, WA, 98926-7520, USA

    Donald Davendra

  2. Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VSB-Technical University of Ostrava, 17. Listopadu 15, 708 33, Ostrava-Poruba, Czech Republic

    Donald Davendra & Ivan Zelinka

  3. Department of Informatics and Artificial Intelligence, Faculty of Applied Informatics, Tomas Bata University in Zlin, Nad Stranemi 4511, 76005, Zlin, Czech Republic

    Michal Pluhacek & Roman Senkerik

Authors
  1. Donald Davendra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivan Zelinka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michal Pluhacek
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Roman Senkerik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Donald Davendra .

Editor information

Editors and Affiliations

  1. Faculty of Ele. Eng. & Computer Sci, Dep. of Comp. Sci. Central Washington Un, Ellensburg, Czech Republic

    Donald Davendra

  2. Faculty of Ele.Eng. & Comp. Sci., VŠB-Technical University of Ostrav, Ostrava-Poruba, Czech Republic

    Ivan Zelinka

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Davendra, D., Zelinka, I., Pluhacek, M., Senkerik, R. (2016). DSOMA—Discrete Self Organising Migrating Algorithm. In: Davendra, D., Zelinka, I. (eds) Self-Organizing Migrating Algorithm. Studies in Computational Intelligence, vol 626. Springer, Cham. https://doi.org/10.1007/978-3-319-28161-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28161-2_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28159-9

  • Online ISBN: 978-3-319-28161-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation