2004
DOI: 10.9746/sicetr1965.40.747
|View full text |Cite
|
Sign up to set email alerts
|

A New Approach to Rectangle Packing Problem Based on Stochastic Tabu Search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…Another example of a 2D bin packing approximation algorithm is provided by (Shigehiro, Koshiyama, & Masuda, 2005), which is based on tabu search. In their algorithm, various close permutations of the rectangles formation are explored to find local optima while maintaining the list of previously known optimum solutions.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Another example of a 2D bin packing approximation algorithm is provided by (Shigehiro, Koshiyama, & Masuda, 2005), which is based on tabu search. In their algorithm, various close permutations of the rectangles formation are explored to find local optima while maintaining the list of previously known optimum solutions.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Several heuristic methods have been developed for this problem such as genetic algorithm [9], quasi-human based heuristic [10], tabu search [8], GRASP [11], sequence-pair representation [12], simulated annealing [13], particle swarm optimization [14], greedy [15], ant colony [16], etc. For this problem, a few mathematical formulation models are introduced in the literature.…”
Section: Introductionmentioning
confidence: 99%