메뉴 건너뛰기




Volumn 27, Issue 1, 2005, Pages 43-61

A tabu search algorithm for the pallet loading problem

Author keywords

Heuristics; Packing; Pallet loading; Tabu search

Indexed keywords


EID: 15244351839     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-004-0183-5     Document Type: Article
Times cited : (24)

References (25)
  • 1
    • 0035920337 scopus 로고    scopus 로고
    • Experiments with a strategic oscillation algorithm for the pallet loading problem
    • Amaral A, Wright M (2001) Experiments with a strategic oscillation algorithm for the pallet loading problem. International Journal of Production Research 39-11: 2341-2351
    • (2001) International Journal of Production Research , vol.39 , Issue.11 , pp. 2341-2351
    • Amaral, A.1    Wright, M.2
  • 4
    • 0002893433 scopus 로고
    • An algorithm for two-dimensional cutting problems
    • Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Operations Research 25: 30-44
    • (1977) Operations Research , vol.25 , pp. 30-44
    • Christofides, N.1    Whitlock, C.2
  • 5
    • 13844293039 scopus 로고
    • Ph.D.Thesis. Department of Engineering Production, University of Birmingham
    • De Cani P (1979) Packing problems in theory and practice. Ph.D.Thesis. Department of Engineering Production, University of Birmingham
    • (1979) Packing Problems in Theory and Practice
    • De Cani, P.1
  • 6
    • 0021513214 scopus 로고
    • The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems
    • Dowsland KA (1984) The three-dimensional pallet chart: an analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems. Journal of the Operational Research Society 35: 895-905
    • (1984) Journal of the Operational Research Society , vol.35 , pp. 895-905
    • Dowsland, K.A.1
  • 7
    • 0004573440 scopus 로고
    • Determining an upper bound for a class of rectangular packing problems
    • Dowsland KA (1985) Determining an upper bound for a class of rectangular packing problems. Computers and Operations Research 12: 201-205
    • (1985) Computers and Operations Research , vol.12 , pp. 201-205
    • Dowsland, K.A.1
  • 9
    • 0023331949 scopus 로고
    • A combined data-base and algorithmic approach to the pallet-loading problem
    • Dowsland KA (1987) A combined data-base and algorithmic approach to the pallet-loading problem. Journal of Operational Research Society 38: 341-345
    • (1987) Journal of Operational Research Society , vol.38 , pp. 341-345
    • Dowsland, K.A.1
  • 10
    • 0342732140 scopus 로고    scopus 로고
    • Simple tabu thresholding and the pallet loading problem
    • Osman IH, Kelly JP (eds), Kluwer, Dordrecht
    • Dowsland KA (1996) Simple tabu thresholding and the pallet loading problem. In: Osman IH, Kelly JP (eds) Metaheuristics: theory and applications, pp 379-406. Kluwer, Dordrecht
    • (1996) Metaheuristics: Theory and Applications , pp. 379-406
    • Dowsland, K.A.1
  • 13
    • 21344451992 scopus 로고    scopus 로고
    • A family of genetic algorithms for the pallet loading problem
    • Herbert A, Dowsland KA (1996) A family of genetic algorithms for the pallet loading problem. Annals of Operations Research 63: 415-436
    • (1996) Annals of Operations Research , vol.63 , pp. 415-436
    • Herbert, A.1    Dowsland, K.A.2
  • 14
    • 0000026164 scopus 로고
    • A recursive computational procedure for two-dimensional stock cutting
    • Herz JC (1972) A recursive computational procedure for two-dimensional stock cutting. IBM Journal of Research Development 16: 462-469
    • (1972) IBM Journal of Research Development , vol.16 , pp. 462-469
    • Herz, J.C.1
  • 15
    • 5244374201 scopus 로고
    • Ein Planungssytem zur Optimierung der Palettenbeladung mit kongruenten rechteckigen Versangebinden
    • Isermann H (1987) Ein Planungssytem zur Optimierung der Palettenbeladung mit kongruenten rechteckigen Versangebinden. OR Spektrum 9: 235-249
    • (1987) OR Spektrum , vol.9 , pp. 235-249
    • Isermann, H.1
  • 17
    • 0037480767 scopus 로고    scopus 로고
    • An L-approach for packing (1,w)-rectangles into rectangular and L-shaped pieces
    • Lins L, Lins S, Morabito R (2003) An L-approach for packing (1,w)-rectangles into rectangular and L-shaped pieces. Journal of the Operational Research Society 54: 777-789
    • (2003) Journal of the Operational Research Society , vol.54 , pp. 777-789
    • Lins, L.1    Lins, S.2    Morabito, R.3
  • 18
    • 0032139363 scopus 로고    scopus 로고
    • A simple and effective recursive procedure for the manufacturer's pallet loading problem
    • Morabito R, Morales A (1998) A simple and effective recursive procedure for the manufacturer's pallet loading problem. Journal of the Operational Research Society 49: 819-828
    • (1998) Journal of the Operational Research Society , vol.49 , pp. 819-828
    • Morabito, R.1    Morales, A.2
  • 19
    • 0029634664 scopus 로고
    • How to use structural constraints to compute an upper bound for the pallet loading problem
    • Neliβen J (1995) How to use structural constraints to compute an upper bound for the pallet loading problem. European Journal of Operational Research 84: 662-680
    • (1995) European Journal of Operational Research , vol.84 , pp. 662-680
    • Nelißen, J.1
  • 20
    • 15244358497 scopus 로고    scopus 로고
    • Uma heuristica de busca tabu simples para o problema de carregamento de paletes do produtor
    • Pureza V, Morabito R (2003) Uma heuristica de busca tabu simples para o problema de carregamento de paletes do produtor. Pesquisa Operacional 23: 359-378
    • (2003) Pesquisa Operacional , vol.23 , pp. 359-378
    • Pureza, V.1    Morabito, R.2
  • 24
    • 0018529119 scopus 로고
    • Generating pallet loading patterns: A special case of the two-dimensional cutting stock problem
    • Steudel JH (1979) Generating pallet loading patterns: a special case of the two-dimensional cutting stock problem. Management Science 25: 997-1004
    • (1979) Management Science , vol.25 , pp. 997-1004
    • Steudel, J.H.1
  • 25
    • 0035480434 scopus 로고    scopus 로고
    • A fast algorithm for two-dimensional pallet loading problems of large size
    • Young-Gun G, Maing-Kyu K (2001) A fast algorithm for two-dimensional pallet loading problems of large size. European Journal of Operational Research 134: 193-202
    • (2001) European Journal of Operational Research , vol.134 , pp. 193-202
    • Young-Gun, G.1    Maing-Kyu, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.