Minimization of off-grade production in multi-site multi-product plants by solving multiple traveling salesman problem

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

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Continuous multi-product 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 increases the flexibility of multi-product 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 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 (Abonyi). For demonstration purposes, we present an illustrative example. The results show that multi-product multi-site 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
JournalJournal of Cleaner Production
DOIs
Publication statusAccepted/In press - Jan 7 2015

Fingerprint

plant product
Traveling salesman problem
Scheduling
Genetic algorithms
genetic algorithm
Chromosomes
MATLAB
Environmental impact
product
Websites
Demonstrations
chromosome
Economics
environmental impact
market
Costs

Keywords

  • MTSP
  • Off-grade production
  • Optimization

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Renewable Energy, Sustainability and the Environment
  • Environmental Science(all)
  • Strategy and Management

Cite this

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

In: Journal of Cleaner Production, 07.01.2015.

Research output: Contribution to journalArticle

@article{871537aaabf24200b2e35e0583e10090,
title = "Minimization of off-grade production in multi-site multi-product plants by solving multiple traveling salesman problem",
abstract = "Continuous multi-product 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 increases the flexibility of multi-product 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 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 (Abonyi). For demonstration purposes, we present an illustrative example. The results show that multi-product multi-site 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.",
keywords = "MTSP, Off-grade production, Optimization",
author = "Andr{\'a}s Kir{\'a}ly and Maria Christidou and Tibor Chov{\'a}n and Evangelos Karlopoulos and J. Abonyi",
year = "2015",
month = "1",
day = "7",
doi = "10.1016/j.jclepro.2015.05.036",
language = "English",
journal = "Journal of Cleaner Production",
issn = "0959-6526",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Minimization of off-grade production in multi-site multi-product plants by solving multiple traveling salesman problem

AU - Király, András

AU - Christidou, Maria

AU - Chován, Tibor

AU - Karlopoulos, Evangelos

AU - Abonyi, J.

PY - 2015/1/7

Y1 - 2015/1/7

N2 - Continuous multi-product 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 increases the flexibility of multi-product 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 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 (Abonyi). For demonstration purposes, we present an illustrative example. The results show that multi-product multi-site 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 multi-product 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 increases the flexibility of multi-product 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 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 (Abonyi). For demonstration purposes, we present an illustrative example. The results show that multi-product multi-site 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.

KW - MTSP

KW - Off-grade production

KW - Optimization

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

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

U2 - 10.1016/j.jclepro.2015.05.036

DO - 10.1016/j.jclepro.2015.05.036

M3 - Article

AN - SCOPUS:84955256518

JO - Journal of Cleaner Production

JF - Journal of Cleaner Production

SN - 0959-6526

ER -