Author
Duman, T., Duman, Ekrem
Publication Date
2023-07
Publication Place
-
Springer
Subject
Asymmetric TSP, Cook scheduling, Heuristics, MBO, Simulated annealing
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
1864-5909
Record ID
9c52bdd5-b10b-4d78-9d95-50e49f7fe140
Library Location
Industrial Engineering
Date
2023-07
Sample Text
In this study, we first introduce a new application of the asymmetric traveling salesman problem which is about a small restaurant with one cook and a single stove. Once a meal has started cooking on the stove, the cook prepares the next meal on the table where the preparation time is dependent on the previous meal prepared. For the solution of this problem, besides several simple construction algorithms and a new version of the simulated annealing (SA) algorithm, we focus on enhanced versions of the recently introduced migrating birds optimization (MBO) algorithm. The original MBO algorithm might suffer from early convergence. Here we introduce several different ways of handling this problem. The extensive numerical experimentation conducted shows the superiority of the enhanced MBO over the original MBO (about 2.62 per cent) and over the SA algorithm (about 1.05 per cent).
DOI
10.1007/s12065-023-00858-8
