Mersin, KadirNur, Cemile2019-08-202019-08-202019-6-302149-01042149-5262https://hdl.handle.net/11363/1394In 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.eninfo:eu-repo/semantics/openAccessAttribution-NonCommercial-NoDerivs 3.0 United StatesTraveling Salesman ProblemDraft LimitMaritime TransportationArticle527883