{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:33:05Z","timestamp":1742992385954,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811033247"},{"type":"electronic","value":"9789811033254"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-3325-4_19","type":"book-chapter","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T10:24:18Z","timestamp":1491992658000},"page":"188-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Multi-objective Two Dimensional Rectangle Packing Problem"],"prefix":"10.1007","author":[{"given":"Amandeep Kaur","family":"Virk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kawaljeet","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1016\/j.eswa.2007.10.043","volume":"36","author":"HH Yang","year":"2009","unstructured":"Yang, H.H., Lin, C.L.: On genetic algorithms for shoe making nesting. A Taiwan Case Expert Syst. Appl. 36(2), 1134\u20131141 (2009)","journal-title":"A Taiwan Case Expert Syst. Appl."},{"key":"19_CR2","unstructured":"Selow, R., Junior, F.N., Heitor, S., Lopes, H.S.: Genetic algorithms for the nesting problem in the packing industry. In: The International Multi Conference of Engineers and Computer Scientists (IMECS), pp. 1\u20136 (2007)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.cor.2007.10.019","volume":"36","author":"C Yaodong","year":"2009","unstructured":"Yaodong, C., Yiping, L.: Heuristic algorithm for a cutting stock problem in the steel bridge construction. Comput. Oper. Res. 36, 612\u2013622 (2009)","journal-title":"Comput. Oper. Res."},{"key":"19_CR4","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1012590107280","volume":"16","author":"E Hopper","year":"2001","unstructured":"Hopper, E., Turton, B.C.H.: A review of the application of metaheuristic algorithms to 2D strip packing problems. Artif. Intell. Rev. 16, 257\u2013300 (2001)","journal-title":"Artif. Intell. Rev."},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1631\/jzus.2006.A0570","volume":"7","author":"HY Liu","year":"2006","unstructured":"Liu, H.Y., He, Y.J.: Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle. J. Zhejiang Univ.\u2013Sci. 7(4), 570\u2013576 (2006)","journal-title":"J. Zhejiang Univ.\u2013Sci."},{"key":"19_CR7","first-page":"2203","volume":"4","author":"K Singh","year":"2009","unstructured":"Singh, K., Jain, L.: Optimal solution for 2-D Rectangle Packing Problem. Int. J. Appl. Eng. Res. 4, 2203\u20132222 (2009)","journal-title":"Int. J. Appl. Eng. Res."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0360-8352(01)00021-3","volume":"40","author":"TW Leung","year":"2001","unstructured":"Leung, T.W., Yung, C.H., Troutt, M.D.: Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Comput. Ind. Eng. 40, 201\u2013214 (2001)","journal-title":"Comput. Ind. Eng."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G Wascher","year":"2007","unstructured":"Wascher, G., Hausner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR10","unstructured":"Uday, A., Goodman, E.D., Debnath, A.A.: Nesting of irregular shapes using feature matching and parallel genetic algorithms. In: Genetic and Evolutionary Computation Conference Late Breaking Papers, San Francisco, California, USA, pp. 429\u2013434 (2001)"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ijpe.2013.04.040","volume":"145","author":"J.A Bennell","year":"2013","unstructured":"Bennell, J.A.,  Lee. L.S., Potts, C.N.: A genetic algorithm for two-dimensional bin packing with due dates.  Int. J. Prod.  Econ. 145(2), 547\u2013560 (2013)","journal-title":"Int. J. Prod.  Econ."}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of Sixth International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3325-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T14:12:20Z","timestamp":1558447940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3325-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811033247","9789811033254"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3325-4_19","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"13 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}