Artikel
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and developed for this type of the complex and large-sized problem. To evaluate the efficiency of these proposed approaches, several problems are solved using SA and TS, and then the related results are compared. The results show that the proposed SA gives good results in terms of objective function values rather than TS.
- Sprache
-
Englisch
- Erschienen in
-
Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 8 ; Year: 2012 ; Pages: 1-8 ; Heidelberg: Springer
- Klassifikation
-
Management
- Thema
-
one-dimensional cutting stock problem
mathematical model
simulated annealing
tabu search
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Jahromi, Meghdad HMA
Tavakkoli-Moghaddam, Reza
Makui, Ahmad
Shamsi, Abbas
- Ereignis
-
Veröffentlichung
- (wer)
-
Springer
- (wo)
-
Heidelberg
- (wann)
-
2012
- DOI
-
doi:10.1186/2251-712X-8-24
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:42 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Artikel
Beteiligte
- Jahromi, Meghdad HMA
- Tavakkoli-Moghaddam, Reza
- Makui, Ahmad
- Shamsi, Abbas
- Springer
Entstanden
- 2012
Ähnliche Objekte (12)
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Applied simulated annealing
Intelligent optimisation techniques : genetic algorithms, tabu search, simulated annealing and neural networks
Dreidimensionale Packprobleme : Lösungsverfahren basierend auf den Meta-Heuristiken simulated annealing und Tabu-Suche
Voll datenparalleles simulated annealing
Solving NP-complete Problems with Metaheuristics: An Introduction to Tabu Search, Simulated Annealing and Late Acceptance
Finite time bounds for Simulated Annealing
Classical Simulated Annealing Using Quantum Analogues
Some Remarks on Replicated Simulated Annealing
Default reasoning, uncertain reasoning, and simulated annealing
Die Lösung eines Rundreiseproblems mit Simulated Annealing
Enhancing heuristic bubble algorithm with simulated annealing
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Applied simulated annealing
Intelligent optimisation techniques : genetic algorithms, tabu search, simulated annealing and neural networks
Dreidimensionale Packprobleme : Lösungsverfahren basierend auf den Meta-Heuristiken simulated annealing und Tabu-Suche
Voll datenparalleles simulated annealing
Solving NP-complete Problems with Metaheuristics: An Introduction to Tabu Search, Simulated Annealing and Late Acceptance
Finite time bounds for Simulated Annealing
Classical Simulated Annealing Using Quantum Analogues
Some Remarks on Replicated Simulated Annealing
Default reasoning, uncertain reasoning, and simulated annealing
Die Lösung eines Rundreiseproblems mit Simulated Annealing
Enhancing heuristic bubble algorithm with simulated annealing
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Applied simulated annealing
Intelligent optimisation techniques : genetic algorithms, tabu search, simulated annealing and neural networks
Dreidimensionale Packprobleme : Lösungsverfahren basierend auf den Meta-Heuristiken simulated annealing und Tabu-Suche
Voll datenparalleles simulated annealing
Solving NP-complete Problems with Metaheuristics: An Introduction to Tabu Search, Simulated Annealing and Late Acceptance
Finite time bounds for Simulated Annealing
Classical Simulated Annealing Using Quantum Analogues
Some Remarks on Replicated Simulated Annealing
Default reasoning, uncertain reasoning, and simulated annealing
Die Lösung eines Rundreiseproblems mit Simulated Annealing