Author
Duman, Ekrem, Bassaleh, Ahmad
Publication Date
2024-01-01
Publication Place
-
EDP Sciences
Subject
Simulated annealing, Migrating birds optimization, Metaheuristics, Matheuristics, TSP applications
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
0399-0559
Record ID
6bb62922-a591-4b9b-a685-e8ec76745d0f
Library Location
Industrial Engineering
Date
2024-01-01
Sample Text
Turkish Cashier Problem (TCP) is a new application area of the traveling salesman problem that was introduced to the literature recently. In this problem, the cashier can use public transportation or take a taxi where the cashier must visit multiple customer locations while minimizing the total transportation cost. In this study, we introduce a more realistic version of this problem where time has been integrated. This aspect is achieved by imposing time intervals within which the cashier must visit the customers. We name this problem as the TCP with time windows (TCPwTW). We develop several matheuristic algorithms to solve the TCPwTW: a modified version of the Simplify and Conquer (SAC) algorithm that was suggested for the TCP, simulated annealing (SA), original and modified versions of the migrating birds optimization (MBO) algorithm coupled with mathematical programming. We also tried to find the exact optimum using a Solver where for complex problems, only lower bounds were found. Numerical experimentation reveals that while for problems with loose time intervals, an exact solver can be considered. Once the time intervals tighten up, the best solutions can be obtained using matheuristics involving SA and MBO.
DOI
10.1051/ro/2024084
Cilt
58
