Traveling Salesman Problem: A Case Study of a Scheduling Problem in a Steelmaking Plant

Kai Krämer, Ludger van Elst, Asier Arteaga

2022

Abstract

To be competitive as a company today, it is important to have key competences such as flexibility and the ability to offer a wide range of products and minimize costs. In this article, we report on an steelmaking plant and its scheduling problem. We have interpreted the optimization problem as a travelling salesman problem and show how it can be modelled. To minimize the problem we chose the simulated annealing algorithm and see how the object function can be adapted to consider-factory based constraints and how to fasten the computation time with simple techniques.

Paper Citation

in Harvard Style

Krämer K., van Elst L. and Arteaga A. (2022). Traveling Salesman Problem: A Case Study of a Scheduling Problem in a Steelmaking Plant. In Proceedings of the 3rd International Conference on Innovative Intelligent Industrial Production and Logistics - Volume 1: ETCIIM, ISBN 978-989-758-612-5, pages 291-296. DOI: 10.5220/0011598000003329

in Bibtex Style

@conference{etciim22,
author={Kai Krämer and Ludger van Elst and Asier Arteaga},
title={Traveling Salesman Problem: A Case Study of a Scheduling Problem in a Steelmaking Plant},
booktitle={Proceedings of the 3rd International Conference on Innovative Intelligent Industrial Production and Logistics - Volume 1: ETCIIM,},
year={2022},
pages={291-296},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011598000003329},
isbn={978-989-758-612-5},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 3rd International Conference on Innovative Intelligent Industrial Production and Logistics - Volume 1: ETCIIM,
TI - Traveling Salesman Problem: A Case Study of a Scheduling Problem in a Steelmaking Plant
SN - 978-989-758-612-5
AU - Krämer K.
AU - van Elst L.
AU - Arteaga A.
PY - 2022
SP - 291
EP - 296
DO - 10.5220/0011598000003329