Loading

Theoretical Framework for the Freight Movements Through a Multicommodity Port
P. Oliver jayaprakash1, A K.Gunasekaran2

1Dr. P. Oliver jayaprakash, Professor, Civil Engineering, Sethu Institute of Technology (Autonomous) Kariapatti.
2A Dr. K. Gunasekaran, Professor& Head, Transportation Engg. Division, College of Engg. Guindy, Anna University, Chennai.

Manuscript received on August 01, 2020. | Revised Manuscript received on August 05, 2020. | Manuscript published on September 30, 2020. | PP: 399-410 | Volume-9 Issue-3, September 2020. | Retrieval Number: 100.1/ijrte.C4290099320 | DOI: 10.35940/ijrte.C4290.099320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: –Port based freight movement planning is a complicated task that could be carried out efficiently to handle the cargo, optimally utilize the infrastructure and plan the future infrastructure requirements. The nature of activities at the port is dynamic with uncertainties,since the operationsare time bound, scholastic and probabilistic.As the huge capital is involved in port infrastructure, the inter-relationship between port activities need to be understood and a system model enveloping the relationship among the variables is much needed for optimal utilization of existing facilities and to predict the future infrastructure requirements. The conventional four step model approach for modeling the person trips would not effectively reflect the commercial scheduling constraintsand requirements of freight trips. This research workattemptsto model the port operations, to assess the level of service of roads and gate operations as subsystems to understand the interdependencies between the variables and the impact on the port operations as a whole.
Keywords: System, Modeling, Multicommodity port, dynamic commodity flow, Turnaround time, Vessel arrival.