Ponencia
Solving the Bin-Packing Problem by Means of Tissue P System with 2-Division
Autor/es | Christinal, Hepzibah A.
John, Rose Rani Chandy, D. Abraham Gutiérrez Naranjo, Miguel Ángel |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2017 |
Fecha de depósito | 2018-04-09 |
Publicado en |
|
ISBN/ISSN | 978-3-319-58186-6 0302-9743 |
Resumen | The ability of tissue P systems with 2-division for solving
NP problems in polynomial time is well-known and many solutions can
be found in the literature to several of such problems. Nonetheless, there
are very few ... The ability of tissue P systems with 2-division for solving NP problems in polynomial time is well-known and many solutions can be found in the literature to several of such problems. Nonetheless, there are very few papers devoted to the Bin-packing problem. The reason may be the difficulties for dealing with different number of bins, capacity and number of objects by using exclusively division rules that produce two offsprings in each application. In this paper we present the design of a family of tissue P systems with 2 division which solves the Bin-packing problem in polynomial time by combining design techniques which can be useful for further research. |
Cita | Christinal, H.A., John, R.R., Chandy, D.A. y Gutiérrez Naranjo, M.Á. (2017). Solving the Bin-Packing Problem by Means of Tissue P System with 2-Division. En UCNC 2017: 16th International Conference on Unconventional Computation and Natural Computation (170-181), Fayetteville, AR, USA: Springer. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Solving the Bin-Packing Problem.pdf | 244.9Kb | [PDF] | Ver/ | |