Application of Genetic Algorithm to Minimize the Number of Objects Processed and Setup in a One-Dimensional Cutting Stock Problem

Publisher： IGI Global_journal

E-ISSN： 1942-3608|2|1|34-48

ISSN： 1942-3594

Source： International Journal of Applied Evolutionary Computation (IJAEC), Vol.2, Iss.1, 2011-01, pp. : 34-48

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 Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem

By  

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 1, Iss. 2, 2010-04 ,pp. : 34-49

IGI Global_journal

Access to resources Recommend Favorite

On the one-dimensional stock cutting problem in the paper tube industry

By Matsumoto Kazuki  

Journal of Scheduling, Vol. 14, Iss. 3, 2011-06 ,pp. : 281-290

Springer Publishing Company

Access to resources Recommend Favorite

Remote service to solve the two-dimensional cutting stock problem: an application to the Canary Islands costume

By Armas Jesica de   Leon Coromoto   Miranda Gara   Segura Carlos  

International Journal of Web and Grid Services, Vol. 4, Iss. 3, 2008-11 ,pp. : 342-351

Inderscience Publishers

Access to resources Recommend Favorite

A new heuristic algorithm for the one-dimensional bin-packing problem

By Gupta J. N. D.   Ho J. C.  

Production Planning and Control, Vol. 10, Iss. 6, 1999-09 ,pp. : 598-603

Taylor & Francis Ltd

Access to resources Recommend Favorite

Shadow price based genetic algorithms for the cutting stock problem

By Shen Gang   Zhang Yan-Qing  

International Journal of Artificial Intelligence and Soft Computing, Vol. 3, Iss. 1, 2012-07 ,pp. : 50-69

Inderscience Publishers

Access to resources Recommend Favorite