PDDL optimal planning as the Linear Programming Problem in a seaport container terminal

International Seaports, as in the Shanghai International Container Seaport example, have problem with Planning Seaport Operations and one of the approaches to solve this planning problem is Seaport Operations Planning in the Planning Domain Description Language (PDDL). The problem with the PDDL planning is that it is computational resource intensive. That is why we have introduced transformation from the PDDL planning to linear programming in order to solve it. Linear programming is computational resource light. The plan computed in this way requires binary decision on an action. Therefore the nonbinary decision of linear programming algorithm computation has been interpreted as degrees of truth.