Research Article
BibTex RIS Cite

Year 2019, Volume: 5 Issue: 2, 78 - 83, 30.06.2019

Kadir Mersin , Cemile Nur

Abstract

References

  • Battara, M. Erdogan, G., Laporte G., jestvang, Vigo, D.(2010). The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs Transportation Science, 44(3): 383-99
  • Cordeau, J-F, Iori, M., Laporte, G., Salazar Gonzalez, JJ. (2010). A branch and cut agorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks ; 55(1):46-59
  • Fagerholt, K. and Christiansen, M. (2000). A traveling salesman problem with allocation, time window and precedence constraints - an application to ship scheduling. International Transactions in Operational Research, 7 , 231-244.
  • Erdogan, G., Cordeau, J-F., Laporte G. (2009). The pickup and delivery traveling salesman problem with firs in first out loading. Computers & Operations Research, ; 36(6):1800-8
  • Felipe, A., Ortuno, MT., Tirado, G. (2009). The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Computers & Operations Research, ; 36(11):2983-93
  • Henning, F. (2010). Optimization in maritime transportation: crude oil tanker routing and scheduling. PhD thesis. Norwegian University of Science and Technology;Iori, M., Martello, S. (2010). Routing problems with loading constraints. TOP; 18(1):4-27
  • Petersen, HL., Madsen OBG. (2009). The double traveling salesman problem with multiple stacks-formulation and heuristic solution approaches. European Journal of Operational Research ;198(1):139-47
  • Rakke, J. G., Christiansen, M., Fagerholt, K. and Laporte, G. (2012). The traveling salesman problem with draft limits. Computers & Operations Research, 39 (9) , 2161-2167.
  • Song J-H, Furman, KC. (2010). A maritime inventory routing problem: practical approach. Computers & Operations Research,

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

Year 2019, Volume: 5 Issue: 2, 78 - 83, 30.06.2019

Kadir Mersin , Cemile Nur

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.

Keywords

Travelling salesman problem Draft Limit Maritime Transportation

References

  • Battara, M. Erdogan, G., Laporte G., jestvang, Vigo, D.(2010). The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs Transportation Science, 44(3): 383-99
  • Cordeau, J-F, Iori, M., Laporte, G., Salazar Gonzalez, JJ. (2010). A branch and cut agorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks ; 55(1):46-59
  • Fagerholt, K. and Christiansen, M. (2000). A traveling salesman problem with allocation, time window and precedence constraints - an application to ship scheduling. International Transactions in Operational Research, 7 , 231-244.
  • Erdogan, G., Cordeau, J-F., Laporte G. (2009). The pickup and delivery traveling salesman problem with firs in first out loading. Computers & Operations Research, ; 36(6):1800-8
  • Felipe, A., Ortuno, MT., Tirado, G. (2009). The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Computers & Operations Research, ; 36(11):2983-93
  • Henning, F. (2010). Optimization in maritime transportation: crude oil tanker routing and scheduling. PhD thesis. Norwegian University of Science and Technology;Iori, M., Martello, S. (2010). Routing problems with loading constraints. TOP; 18(1):4-27
  • Petersen, HL., Madsen OBG. (2009). The double traveling salesman problem with multiple stacks-formulation and heuristic solution approaches. European Journal of Operational Research ;198(1):139-47
  • Rakke, J. G., Christiansen, M., Fagerholt, K. and Laporte, G. (2012). The traveling salesman problem with draft limits. Computers & Operations Research, 39 (9) , 2161-2167.
  • Song J-H, Furman, KC. (2010). A maritime inventory routing problem: practical approach. Computers & Operations Research,
There are 9 citations in total.

Details

Primary Language English
Subjects Engineering
Journal Section Makaleler
Authors

Kadir Mersin 0000-0003-3999-6960

Cemile Nur This is me 0000-0001-7375-3474

Publication Date June 30, 2019
Acceptance Date May 26, 2019
Published in Issue Year 2019 Volume: 5 Issue: 2

Cite

APA Mersin, K., & Nur, C. (2019). Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit. International Journal of Engineering Technologies IJET, 5(2), 78-83.
AMA Mersin K, Nur C. Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit. IJET. June 2019;5(2):78-83.
Chicago Mersin, Kadir, and Cemile Nur. “Mathematical Model of the Traveling Salesman Problem With Delivery and Draft Limit”. International Journal of Engineering Technologies IJET 5, no. 2 (June 2019): 78-83.
EndNote Mersin K, Nur C (June 1, 2019) Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit. International Journal of Engineering Technologies IJET 5 2 78–83.
IEEE K. Mersin and C. Nur, “Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit”, IJET, vol. 5, no. 2, pp. 78–83, 2019.
ISNAD Mersin, Kadir - Nur, Cemile. “Mathematical Model of the Traveling Salesman Problem With Delivery and Draft Limit”. International Journal of Engineering Technologies IJET 5/2 (June 2019), 78-83.
JAMA Mersin K, Nur C. Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit. IJET. 2019;5:78–83.
MLA Mersin, Kadir and Cemile Nur. “Mathematical Model of the Traveling Salesman Problem With Delivery and Draft Limit”. International Journal of Engineering Technologies IJET, vol. 5, no. 2, 2019, pp. 78-83.
Vancouver Mersin K, Nur C. Mathematical Model of the Traveling Salesman Problem with Delivery and Draft Limit. IJET. 2019;5(2):78-83.

88x31.png Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)