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

Mersin, Kadir; Nur, Cemile

dc.contributor.author	Mersin, Kadir
dc.contributor.author	Nur, Cemile
dc.date.accessioned	2019-08-20T10:20:00Z
dc.date.available	2019-08-20T10:20:00Z
dc.date.issued	2019-6-30	en_US
dc.identifier.issn	2149-0104
dc.identifier.issn	2149-5262
dc.identifier.uri	https://hdl.handle.net/11363/1394
dc.description.abstract	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.	en_US
dc.language.iso	eng	en_US
dc.publisher	İstanbul Gelişim Üniversitesi Yayınları / Istanbul Gelisim University Press	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	Traveling Salesman Problem	en_US
dc.subject	Draft Limit	en_US
dc.subject	Maritime Transportation	en_US
dc.title	Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit	en_US
dc.type	article	en_US
dc.relation.ispartof	International Journal of Engineering Technologies	en_US
dc.department	İktisadi İdari ve Sosyal Bilimler Fakültesi	en_US
dc.identifier.volume	5	en_US
dc.identifier.issue	2	en_US
dc.identifier.startpage	78	en_US
dc.identifier.endpage	83	en_US
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı	en_US