Control of discrete event systems by means of discrete optimization and disjunctive colored PNs: Application to manufacturing facilities

  1. Latorre-Biel, J.-I. 1
  2. Jiménez-Macías, E. 2
  3. Pérez De La Parte, M. 2
  4. Blanco-Fernández, J. 2
  5. Martínez-Cámara, E. 2
  1. 1 Universidad Pública de Navarra
    info

    Universidad Pública de Navarra

    Pamplona, España

    ROR https://ror.org/02z0cah89

  2. 2 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

Revista:
Abstract and Applied Analysis

ISSN: 1085-3375

Año de publicación: 2014

Volumen: 2014

Páginas: 1-16

Tipo: Artículo

beta Ver similares en nube de resultados
DOI: 10.1155/2014/821707 SCOPUS: 2-s2.0-84903553230 WoS: WOS:000337815100001 GOOGLE SCHOLAR lock_openAcceso abierto editor

Otras publicaciones en: Abstract and Applied Analysis

Repositorio institucional: lock_openAcceso abierto Editor

Resumen

Artificial intelligence methodologies, as the core of discrete control and decision support systems, have been extensively applied in the industrial production sector. The resulting tools produce excellent results in certain cases; however, the NP-hard nature of many discrete control or decision making problems in the manufacturing area may require unaffordable computational resources, constrained by the limited available time required to obtain a solution. With the purpose of improving the efficiency of a control methodology for discrete systems, based on a simulation-based optimization and the Petri net (PN) model of the real discrete event dynamic system (DEDS), this paper presents a strategy, where a transformation applied to the model allows removing the redundant information to obtain a smaller model containing the same useful information. As a result, faster discrete optimizations can be implemented. This methodology is based on the use of a formalism belonging to the paradigm of the PN for describing DEDS, the disjunctive colored PN. Furthermore, the metaheuristic of genetic algorithms is applied to the search of the best solutions in the solution space. As an illustration of the methodology proposal, its performance is compared with the classic approach on a case study, obtaining faster the optimal solution. © 2014 Juan-Ignacio Latorre-Biel et al.