메뉴 건너뛰기




Volumn 3611, Issue PART II, 2005, Pages 1229-1238

Ant colony search algorithms for optimal packing problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

EID: 26844501732     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539117_164     Document Type: Conference Paper
Times cited : (9)

References (11)
  • 4
    • 0035385251 scopus 로고    scopus 로고
    • An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives
    • McMullen, PR.: An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. Artificial Intelligence (2001) 309-317
    • (2001) Artificial Intelligence , pp. 309-317
    • McMullen, P.R.1
  • 5
  • 8
    • 0041526702 scopus 로고    scopus 로고
    • Packing of polygons using genetic simulated annealing algorithm
    • Chen Yong, Tang Min, Tong Ruofeng, Dong Jinxiang.: Packing of Polygons Using Genetic Simulated Annealing Algorithm. Journal of CAD & CG (2003), Vol, 15 598-603, 609.
    • (2003) Journal of CAD & CG , vol.15 , pp. 598-603
    • Chen, Y.1    Tang, M.2    Tong, R.3    Dong, J.4
  • 9
    • 0033131702 scopus 로고    scopus 로고
    • Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
    • Ramesh, Babu, A, Ramesh Babu N.: Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. International Journal of Production Research (1999) 1925-1643.
    • (1999) International Journal of Production Research , pp. 1925-11643
    • Ramesh Babu, A.1    Ramesh Babu, N.2
  • 10
    • 0344011675 scopus 로고    scopus 로고
    • Two genetic algorithms to solve a layout problem in the fashion industry
    • Martens, J.: Two genetic algorithms to solve a layout problem in the fashion industry. European Journal of Operational Research (2004) 304-322.
    • (2004) European Journal of Operational Research , pp. 304-322
    • Martens, J.1
  • 11
    • 0030415037 scopus 로고    scopus 로고
    • Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing
    • Han, G.: Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing. Journal of Engineering Manufacture (1996) 509-519.
    • (1996) Journal of Engineering Manufacture , pp. 509-519
    • Han, G.1


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