Pasar al contenido principal

METAHEURISTICOS PARA PROBLEMAS DE LOGISTICA DEL TRANSPORTE CON MULTIPLES CRITERIOS. APLICACIONES A PROBLEMAS REALES EN TRANSPORTE URBANO Y DE RESIDUOS

ECO2013-47129-C4-4-R

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2013
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Educación, Formación Profesional y Universidades
Centro beneficiario UNIVERSIDAD DE ZARAGOZA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

Repositorio Institucional de la Universidad de Burgos (RIUBU)
Datos de investigación Set de datos (Dataset)

Dataset of the paper “Grouping products for the optimization of production processes: A case in the steel manufacturing industry”. European Journal of Operational Research, 286(1), 190-202

  • Casado Yusta, Silvia
  • Laguna, Manuel
  • Pacheco Bonrostro, Joaquín
  • Puche Regaliza, Julio César
The optimization of a production process is often based on the efficient utilization of the production facility and equipment. In particular, reducing the time to change from producing one product to another is critical to the fulfillment of demand at a minimum cost. We study the production of steel coils in the context of searching for groups of products with similar characteristics in order to create production batches that minimize the cost of fulfilling production orders originated by a known demand. We formulate the problem as mixed-integer program and develop a heuristic solution procedure. We show that a simplified version of the problem is equivalent to the clique partition problem, which in turn is equivalent to the graph-coloring problem. Computational experiments show that the heuristic procedure is effective in finding high-quality solutions to both the clique partition problem and the original grouping problem that includes additional costs., This work was partially supported by FEDER funds and the Spanish Ministry of Economy and Competitiveness (Projects ECO2013-47129-C4-3-R and ECO2016-76567-C4-2-R), the Regional Government of Castilla y León, Spain (Project BU329U14 and BU071G19), and the Regional Government of Castilla y León and FEDER funds (Project BU062U16).