Pasar al contenido principal

APLICACIONES LOGISTICAS E INDUSTRIALES DE LOS PROBLEMAS DE EMPAQUETAMIENTO Y CORTE

DPI2011-24977

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2011
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT DE VALÈNCIA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A decomposition approach to dual shuttle automated storage and retrieval systems

  • Wauters, Tony
  • Chirstiaens, Jan
  • ALVAREZ-VALDES, RAMÓN
  • Vauden Berghe, Greet
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
[EN] Automated Storage and Retrieval Systems (AS/RS) have become vital in today¿s distribution and production environments, however it remains necessary to equip them with more efficient operational control policies. Motivated by real situations encountered by companies employing AS/RS, the present paper studies a miniload AS/RS system, with a dual shuttle crane in which a set of storage and retrieval requests must be scheduled such that the prioritized waiting time is minimized. Dual shuttle cranes have received minimal academic attention and thus continue to pose new problems that must be solved. The miniload AS/RS problem is addressed by decomposing it into a location assignment and sequencing problem. Different heuristic strategies are introduced for making the assignments, while a general mathematical model and efficient branch and bound procedure are proposed for optimizing the sequence. Additionally, a fast metaheuristic capable of solving larger instances is also developed. A set of realworld based benchmarks with varying characteristics is generated to evaluate the proposed methods. Very small instances prove the only for which optimal sequences are found in reasonable calculation time. Experimental results demonstrate the effectiveness of the heuristic decomposition method., This study has been partially supported by the Spanish Ministry of Economy and Competitiveness with the projects DPI2011-24977 and DPI2014-53665-P, DPI2012-36243-C02-01, DPI2015-65895-R co-financed by FEDER funds and by Generalitat Valenciana, PROMETEO/2013/049. Partially supported by FWO (Belgium) travel grant V448915N. Editorial consultation provided by Luke Connolly (KU Leuven)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Matheuristics for the irregular bin packing problem with free rotations

  • Martínez-Sykora, A.
  • Álvarez-Valdes Olaguibel, Ramón
  • Bennell, J.A.
  • Ruiz García, Rubén
  • Tamarit, J.M.
[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientations as in the case of the garment industry. We explicitly model the assignment of pieces to bins and compare with the more common strategy of packing bins sequentially. There are very few papers in the literature that address the bin packing problem with irregular pieces and to our knowledge this is the first to additionally consider free rotation of pieces with bin packing. We propose several Integer Programing models to determine the association between pieces and bins and then we use a Mixed Integer Programing model for placing the pieces into the bins. The computational results show that the algorithm obtains high quality results in sets of instances with different properties. We have used both industry data and the available data in the literature of 2D irregular strip packing and bin packing problems. (C) 2016 Elsevier B.V. All rights reserved., This study has been partially supported by the Spanish Ministry of Economy and Competitiveness, DPI2011-24977, and by the Generalitat Valenciana, PROMETEO/2013/049.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics

  • Alvarez Valdes, Ramón
  • Tamarit, J.M.
  • Villa Juliá, Mª Fulgencia
We consider the problem of scheduling a set of jobs on a set of identical parallel machines where the objective is to minimize the total weighted earliness and tardiness penalties with respect to a common due date. We propose a hybrid heuristic algorithm for constructing good solutions, combining priority rules for assigning jobs to machines and a local search with exact procedures for solving the one-machine subproblems. These solutions are then used in two metaheuristic frameworks, Path Relinking and Scatter Search, to obtain high quality solutions for the problem. The algorithms are tested on a large number of test instances to assess the efficiency of the proposed strategies. The results show that our algorithms consistently outperform the best reported results for this problem., This study has been partially supported by the Spanish Ministry of Science and Technology, DPI2011-24977, and by Generalitat Valenciana, PROMETEO/2013/049.