Minimization of off-grade production in multisite multiproduct plants by solving multiple traveling salesman problem

András Király, Barbara Farsang, Tibor Chován, Maria Christidou, Evangelos Karlopoulos, J. Abonyi

Research output: Contribution to journalArticle

Abstract

Continuous multiproduct plants allow the production of several products (product grades). During grade transitions off-spec products are produced. The economic losses and the environmental impact of these transitions are sequence dependent, so the amount of off-grade products can be minimized by scheduling the sequence of the production of different products. Applying parallel production sites (m) increases the flexibility of multiproduct plants. Since market demands are changing, the production cycles of these sites should be re-scheduled in certain intervals. Therefore, our task is to design m production cycles that contains all required products by minimizing the total length of grade transitions. Most production scheduling problems such as the one considered in this paper are NP-hard. Our goal is to solve realistic problem instances in no more than a couple of minutes. We show that this problem can be considered as a multiple traveling salesmen problem (mTSP), where the distances between the products are based on the time or costs of the grade transitions. The resulted mTSP has been solved by multi-chromosome based genetic algorithm. The proposed algorithm was implemented in MATLAB and is available at the website of the authors (www.abonyilab.com). For demonstration purposes, we present an illustrative example. The results show that multiproduct multisite scheduling problems can be effectively handled as mTSPs, and the proposed problem-specific representation based genetic algorithm can be used in wide range of optimization problems.

Original languageEnglish
Pages (from-to)1825-1830
Number of pages6
JournalChemical Engineering Transactions
Volume39
Issue numberSpecial Issue
DOIs
Publication statusPublished - 2014

Fingerprint

Traveling salesman problem
Scheduling
Genetic algorithms
Chromosomes
MATLAB
Environmental impact
Websites
Demonstrations
Economics
Costs

ASJC Scopus subject areas

  • Chemical Engineering(all)

Cite this

Minimization of off-grade production in multisite multiproduct plants by solving multiple traveling salesman problem. / Király, András; Farsang, Barbara; Chován, Tibor; Christidou, Maria; Karlopoulos, Evangelos; Abonyi, J.

In: Chemical Engineering Transactions, Vol. 39, No. Special Issue, 2014, p. 1825-1830.

Research output: Contribution to journalArticle

Király, András ; Farsang, Barbara ; Chován, Tibor ; Christidou, Maria ; Karlopoulos, Evangelos ; Abonyi, J. / Minimization of off-grade production in multisite multiproduct plants by solving multiple traveling salesman problem. In: Chemical Engineering Transactions. 2014 ; Vol. 39, No. Special Issue. pp. 1825-1830.
@article{2e05efc2965a4358844a90ba34beb2d1,
title = "Minimization of off-grade production in multisite multiproduct plants by solving multiple traveling salesman problem",
abstract = "Continuous multiproduct plants allow the production of several products (product grades). During grade transitions off-spec products are produced. The economic losses and the environmental impact of these transitions are sequence dependent, so the amount of off-grade products can be minimized by scheduling the sequence of the production of different products. Applying parallel production sites (m) increases the flexibility of multiproduct plants. Since market demands are changing, the production cycles of these sites should be re-scheduled in certain intervals. Therefore, our task is to design m production cycles that contains all required products by minimizing the total length of grade transitions. Most production scheduling problems such as the one considered in this paper are NP-hard. Our goal is to solve realistic problem instances in no more than a couple of minutes. We show that this problem can be considered as a multiple traveling salesmen problem (mTSP), where the distances between the products are based on the time or costs of the grade transitions. The resulted mTSP has been solved by multi-chromosome based genetic algorithm. The proposed algorithm was implemented in MATLAB and is available at the website of the authors (www.abonyilab.com). For demonstration purposes, we present an illustrative example. The results show that multiproduct multisite scheduling problems can be effectively handled as mTSPs, and the proposed problem-specific representation based genetic algorithm can be used in wide range of optimization problems.",
author = "Andr{\'a}s Kir{\'a}ly and Barbara Farsang and Tibor Chov{\'a}n and Maria Christidou and Evangelos Karlopoulos and J. Abonyi",
year = "2014",
doi = "10.3303/CET1439305",
language = "English",
volume = "39",
pages = "1825--1830",
journal = "Chemical Engineering Transactions",
issn = "1974-9791",
publisher = "AIDIC-Italian Association of Chemical Engineering",
number = "Special Issue",

}

TY - JOUR

T1 - Minimization of off-grade production in multisite multiproduct plants by solving multiple traveling salesman problem

AU - Király, András

AU - Farsang, Barbara

AU - Chován, Tibor

AU - Christidou, Maria

AU - Karlopoulos, Evangelos

AU - Abonyi, J.

PY - 2014

Y1 - 2014

N2 - Continuous multiproduct plants allow the production of several products (product grades). During grade transitions off-spec products are produced. The economic losses and the environmental impact of these transitions are sequence dependent, so the amount of off-grade products can be minimized by scheduling the sequence of the production of different products. Applying parallel production sites (m) increases the flexibility of multiproduct plants. Since market demands are changing, the production cycles of these sites should be re-scheduled in certain intervals. Therefore, our task is to design m production cycles that contains all required products by minimizing the total length of grade transitions. Most production scheduling problems such as the one considered in this paper are NP-hard. Our goal is to solve realistic problem instances in no more than a couple of minutes. We show that this problem can be considered as a multiple traveling salesmen problem (mTSP), where the distances between the products are based on the time or costs of the grade transitions. The resulted mTSP has been solved by multi-chromosome based genetic algorithm. The proposed algorithm was implemented in MATLAB and is available at the website of the authors (www.abonyilab.com). For demonstration purposes, we present an illustrative example. The results show that multiproduct multisite scheduling problems can be effectively handled as mTSPs, and the proposed problem-specific representation based genetic algorithm can be used in wide range of optimization problems.

AB - Continuous multiproduct plants allow the production of several products (product grades). During grade transitions off-spec products are produced. The economic losses and the environmental impact of these transitions are sequence dependent, so the amount of off-grade products can be minimized by scheduling the sequence of the production of different products. Applying parallel production sites (m) increases the flexibility of multiproduct plants. Since market demands are changing, the production cycles of these sites should be re-scheduled in certain intervals. Therefore, our task is to design m production cycles that contains all required products by minimizing the total length of grade transitions. Most production scheduling problems such as the one considered in this paper are NP-hard. Our goal is to solve realistic problem instances in no more than a couple of minutes. We show that this problem can be considered as a multiple traveling salesmen problem (mTSP), where the distances between the products are based on the time or costs of the grade transitions. The resulted mTSP has been solved by multi-chromosome based genetic algorithm. The proposed algorithm was implemented in MATLAB and is available at the website of the authors (www.abonyilab.com). For demonstration purposes, we present an illustrative example. The results show that multiproduct multisite scheduling problems can be effectively handled as mTSPs, and the proposed problem-specific representation based genetic algorithm can be used in wide range of optimization problems.

UR - http://www.scopus.com/inward/record.url?scp=84908112474&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908112474&partnerID=8YFLogxK

U2 - 10.3303/CET1439305

DO - 10.3303/CET1439305

M3 - Article

AN - SCOPUS:84908112474

VL - 39

SP - 1825

EP - 1830

JO - Chemical Engineering Transactions

JF - Chemical Engineering Transactions

SN - 1974-9791

IS - Special Issue

ER -