Turkish cashier problem with time windows and its solution by Migrating bird optimization algorithm

Name: Turkish cashier problem with time windows and its solution by Migrating bird optimization algorithm
Author: Bassaleh, Ahmad, Duman, Ekrem

İsim	Turkish cashier problem with time windows and its solution by Migrating bird optimization algorithm
Yazar	Bassaleh, Ahmad, Duman, Ekrem
Basım Tarihi:	2023
Basım Yeri	- IEEE
Konu	Matheuristics, Metaheursitics, Migrating birds optimization, TSP applications
Tür	Belge
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	979-835031254-6
Kayıt Numarası	25afce5c-2759-46c0-b82e-d7fd9cd9320a
Lokasyon	Industrial Engineering
Tarih	2023
Örnek Metin	A new application of the traveling salesman problem referred to as the Turkish cashier problem (TCP) was recently introduced in literature. The problem revolved around a cashier that must visit several locations and return to his office. To complete his visits, he can use taxis or public transportation and the objective is to minimize the total transportation cost. To make this problem more practical, we took time into consideration by adding a soft time interval for each location obligating the cashier to make his visit within. If he fails to visit within the adequate time, a penalty must be paid. We name this problem as the TCP with time windows (TCPwTW). A metaheuristic algorithm known as the Migrating Birds Optimization (MBO) algorithm coupled with mathematical programming was developed to solve TCPwTW. We attempted to find the exact optimum using an exact solver where for complex problems, optimal solutions cannot be found. The quantitative study reveals that for problems having a loose time interval, the Solver serves as the best approach. On the other hand, for problems having tight time intervals, the best solutions can be obtained by the matheuristic.
DOI	10.1109/ICOA58279.2023.10336418

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Turkish cashier problem with time windows and its solution by Migrating bird optimization algorithm

Yazar Bassaleh, Ahmad, Duman, Ekrem

Basım Tarihi 2023

Basım Yeri - IEEE

Konu Matheuristics, Metaheursitics, Migrating birds optimization, TSP applications

Tür Belge

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 979-835031254-6

Kayıt Numarası 25afce5c-2759-46c0-b82e-d7fd9cd9320a

Lokasyon Industrial Engineering

Tarih 2023

Örnek Metin A new application of the traveling salesman problem referred to as the Turkish cashier problem (TCP) was recently introduced in literature. The problem revolved around a cashier that must visit several locations and return to his office. To complete his visits, he can use taxis or public transportation and the objective is to minimize the total transportation cost. To make this problem more practical, we took time into consideration by adding a soft time interval for each location obligating the cashier to make his visit within. If he fails to visit within the adequate time, a penalty must be paid. We name this problem as the TCP with time windows (TCPwTW). A metaheuristic algorithm known as the Migrating Birds Optimization (MBO) algorithm coupled with mathematical programming was developed to solve TCPwTW. We attempted to find the exact optimum using an exact solver where for complex problems, optimal solutions cannot be found. The quantitative study reveals that for problems having a loose time interval, the Solver serves as the best approach. On the other hand, for problems having tight time intervals, the best solutions can be obtained by the matheuristic.

DOI 10.1109/ICOA58279.2023.10336418