Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit

Küçük Resim

Dosyalar

4.pdf (222.46 KB)

Tarih

2019-6-30

Yazarlar

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

İstanbul Gelişim Üniversitesi Yayınları / Istanbul Gelisim University Press

Erişim Hakkı

info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivs 3.0 United States

Özet

In this paper, we determine the order of the ports to be reached with the help of graph theory and establish Hamilton cycles. We obtain sub-solutions and solution sets with the help of these cycles. Moreover, we prove some relations about the draft limit and the demand of the port. Finally we present some examples.

Açıklama

Anahtar Kelimeler

Traveling Salesman Problem, Draft Limit, Maritime Transportation

Kaynak

International Journal of Engineering Technologies

WoS Q Değeri

Scopus Q Değeri

Cilt

5

Sayı

2

Künye

Bağlantı

https://hdl.handle.net/11363/1394

Koleksiyon

IJET Vol. 5, Issue 2, June 2019