Optimization on linear integer programming model for a grain multimodal transport system

Short path problem (SPP) is a network problem classic, whose theoretical solutions have been studied because of global supply chains development. Grain production growth in the Brazilian Cerrado biome region has resulted in transportation challenges for grains from production centers to export seaports. Logistics infrastructure lack that adequately serves the region results in high transportation costs, reducing part of the competitiveness of local high-productivity crops. To contribute to decision-making regarding the lowest-cost route for transporting grains to destination ports, a grain multimodal transport system optimization model is proposed using least-cost transportation problem concept, and a real system representation in network flow model with a graph topology in combinatorial optimization field, considering objective function real constraints. A qualitative comparison for solving networks (graphs) linear programming classical methods, dynamic programming, and a heuristic method (genetic algorithm) is carried out, and the reasons to choose the adopted method are shown. A real case is simulated using the adopted method in computational experiments.