Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

Author： Leung T.W. Chan C.K. Troutt M.D.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.145, Iss.3, 2003-03, pp. : 530-542

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A simulated annealing heuristic for the one-dimensional cutting stock problem

By Chuen-Lung S.C. Hart S.M. Wai M.T.

European Journal of Operational Research, Vol. 93, Iss. 3, 1996-09 ,pp. : 522-535

Elsevier

Access to resources Recommend Favorite

Heuristic algorithms for the three-dimensional bin packing problem

By Lodi A. Martello S. Vigo D.

European Journal of Operational Research, Vol. 141, Iss. 2, 2002-09 ,pp. : 410-420

Elsevier

Access to resources Recommend Favorite

An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles

By Liu D. Teng H.

European Journal of Operational Research, Vol. 112, Iss. 2, 1999-01 ,pp. : 413-420

Elsevier

Access to resources Recommend Favorite

A global optimization algorithm for the three-dimensional packing problem

By Faina L.

European Journal of Operational Research, Vol. 126, Iss. 2, 2000-10 ,pp. : 340-354

Elsevier

Access to resources Recommend Favorite

Approximation algorithms for the oriented two-dimensional bin packing problem

By Lodi A. Martello S. Vigo D.

European Journal of Operational Research, Vol. 112, Iss. 1, 1999-01 ,pp. : 158-166

Elsevier

Access to resources Recommend Favorite