Skip to main content
Top

2018 | OriginalPaper | Chapter

Design of Library of Metaheuristic Algorithms for Solving the Problems of Discrete Optimization

Authors : Vladislav A. Chekanin, Alexander V. Chekanin

Published in: Advances in Mechanical Engineering

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The paper contains a detailed description of major requirements which should be taken into account in the design of the library of metaheuristic algorithms of discrete optimization. The proposed requirements provide an opportunity to create a large number of different population-based algorithms by the designed library, including classical and modified variations of genetic algorithms, ant colony algorithms, bee algorithms, as well as many other optimization algorithms applicable for solving the problems of discrete optimization.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Literature
1.
go back to reference Johnson DS (2012) A brief history of NP-completeness, 1954–2012. Doc Math Extra Volume ISMP, pp 359–376 Johnson DS (2012) A brief history of NP-completeness, 1954–2012. Doc Math Extra Volume ISMP, pp 359–376
3.
go back to reference Chekanin AV, Chekanin VA (2014) Effective data structure for the multidimensional orthogonal bin packing problems. Adv Mater Res 962–965:2868–2871CrossRefMATH Chekanin AV, Chekanin VA (2014) Effective data structure for the multidimensional orthogonal bin packing problems. Adv Mater Res 962–965:2868–2871CrossRefMATH
4.
go back to reference Chekanin VA, Chekanin AV (2014) Improved data structure for the orthogonal packing problem. Adv Mater Res 945–949:3143–3146CrossRefMATH Chekanin VA, Chekanin AV (2014) Improved data structure for the orthogonal packing problem. Adv Mater Res 945–949:3143–3146CrossRefMATH
5.
go back to reference Chekanin VA, Chekanin AV (2016) Implementation of packing methods for the orthogonal packing problems. J Theor Appl Inf Technol 88(3):421–430MATH Chekanin VA, Chekanin AV (2016) Implementation of packing methods for the orthogonal packing problems. J Theor Appl Inf Technol 88(3):421–430MATH
6.
go back to reference Chekanin VA, Chekanin AV (2017) Deleting objects algorithm for the optimization of orthogonal packing problems. In: Advances in mechanical engineering. Springer International Publishing, pp 27–35 Chekanin VA, Chekanin AV (2017) Deleting objects algorithm for the optimization of orthogonal packing problems. In: Advances in mechanical engineering. Springer International Publishing, pp 27–35
7.
go back to reference Chekanin VA, Chekanin AV (2015) An efficient model for the orthogonal packing problem. Adv Mech Eng 22:33–38MATH Chekanin VA, Chekanin AV (2015) An efficient model for the orthogonal packing problem. Adv Mech Eng 22:33–38MATH
8.
go back to reference Chekanin VA, Chekanin AV (2016) New effective data structure for multidimensional optimization orthogonal packing problems. In: Advances in mechanical engineering. Springer International Publishing, pp 87–92 Chekanin VA, Chekanin AV (2016) New effective data structure for multidimensional optimization orthogonal packing problems. In: Advances in mechanical engineering. Springer International Publishing, pp 87–92
9.
go back to reference Martinez MAA, Clautiaux F, Dell’Amico M, Iori M (2013) Exact algorithms for the bin packing problem with fragile objects. Discret Optim 10(3):210–223MathSciNetCrossRef Martinez MAA, Clautiaux F, Dell’Amico M, Iori M (2013) Exact algorithms for the bin packing problem with fragile objects. Discret Optim 10(3):210–223MathSciNetCrossRef
10.
go back to reference Valiahmetova YuI, Filippova AS (2007) Multi-method genetic algorithm for the decision of problems of orthogonal packing. Inf Technol (Informacionnye Tehnologii) 12:50–56 (in Russian) Valiahmetova YuI, Filippova AS (2007) Multi-method genetic algorithm for the decision of problems of orthogonal packing. Inf Technol (Informacionnye Tehnologii) 12:50–56 (in Russian)
11.
go back to reference Wascher G, Haubner H, Schumann H (2007) An improved typology of cutting and packing problems. EJOR 183(3):1109–1130CrossRefMATH Wascher G, Haubner H, Schumann H (2007) An improved typology of cutting and packing problems. EJOR 183(3):1109–1130CrossRefMATH
12.
go back to reference Karpenko AP (2012) Population algorithms for global continuous optimization. Review of new and little-known algorithms. In: Inf Technol (Informacionnye Tehnologii). vol 7. Appendix, 32 p (in Russian) Karpenko AP (2012) Population algorithms for global continuous optimization. Review of new and little-known algorithms. In: Inf Technol (Informacionnye Tehnologii). vol 7. Appendix, 32 p (in Russian)
13.
go back to reference Shcherbina OA (2014) Metaheuristic algorithms for combinatorial optimization problems (Review). Tavricheskiy vestnik informatiki i matematiki 1:56–72 (in Russian) Shcherbina OA (2014) Metaheuristic algorithms for combinatorial optimization problems (Review). Tavricheskiy vestnik informatiki i matematiki 1:56–72 (in Russian)
14.
go back to reference Garey M, Johnson D (1979) Computers intractability: a guide to the theory of NP-completeness. W.H.Freeman, San Francisco, p 338MATH Garey M, Johnson D (1979) Computers intractability: a guide to the theory of NP-completeness. W.H.Freeman, San Francisco, p 338MATH
15.
go back to reference Chekanin VA, Chekanin AV (2014) Development of the multimethod genetic algorithm for the strip packing problem. Appl Mech Mater 598:377–381CrossRefMATH Chekanin VA, Chekanin AV (2014) Development of the multimethod genetic algorithm for the strip packing problem. Appl Mech Mater 598:377–381CrossRefMATH
16.
go back to reference Chernyak LS (2014) Intellekt roya dlya IT. Otkrytyye sistemy. SUBD 2:41–43 (in Russian) Chernyak LS (2014) Intellekt roya dlya IT. Otkrytyye sistemy. SUBD 2:41–43 (in Russian)
17.
go back to reference Filippova AS (2006) Modeling of evolution algorithms for rectangular packing problems based on block structure technology. In: Inf Technol (Informacionnye Tehnologii). Appendix, 32 p (in Russian) Filippova AS (2006) Modeling of evolution algorithms for rectangular packing problems based on block structure technology. In: Inf Technol (Informacionnye Tehnologii). Appendix, 32 p (in Russian)
18.
go back to reference Gao YQ, Guan HB, Qi ZW, Hou Y, Liu L (2013) A multi-objective ant colony system algorithm for virtual machine placement in cloud computing. J Comput Syst Sci 79(8):1230–1242MathSciNetCrossRefMATH Gao YQ, Guan HB, Qi ZW, Hou Y, Liu L (2013) A multi-objective ant colony system algorithm for virtual machine placement in cloud computing. J Comput Syst Sci 79(8):1230–1242MathSciNetCrossRefMATH
19.
go back to reference Leung SCH, Zhang DF, Zhou CL, Wu T (2012) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput Oper Res 39(1):64–73CrossRefMATH Leung SCH, Zhang DF, Zhou CL, Wu T (2012) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput Oper Res 39(1):64–73CrossRefMATH
20.
go back to reference Nseef SK, Abdullah S, Turky A, Kendall G (2016) An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems. Knowl Based Syst 104:14–23CrossRef Nseef SK, Abdullah S, Turky A, Kendall G (2016) An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems. Knowl Based Syst 104:14–23CrossRef
Metadata
Title
Design of Library of Metaheuristic Algorithms for Solving the Problems of Discrete Optimization
Authors
Vladislav A. Chekanin
Alexander V. Chekanin
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-72929-9_4

Premium Partners